All Title Author
Keywords Abstract

Publish in OALib Journal
ISSN: 2333-9721
APC: Only $99

ViewsDownloads

Relative Articles

More...

Measuring Non-Gaussianity by Phi-Transformed and Fuzzy Histograms

DOI: 10.1155/2012/962105

Full-Text   Cite this paper   Add to My Lib

Abstract:

Independent component analysis (ICA) is an essential building block for data analysis in many applications. Selecting the truly meaningful components from the result of an ICA algorithm, or comparing the results of different algorithms, however, is nontrivial problems. We introduce a very general technique for evaluating ICA results rooted in information-theoretic model selection. The basic idea is to exploit the natural link between non-Gaussianity and data compression: the better the data transformation represented by one or several ICs improves the effectiveness of data compression, the higher is the relevance of the ICs. We propose two different methods which allow an efficient data compression of non-Gaussian signals: Phi-transformed histograms and fuzzy histograms. In an extensive experimental evaluation, we demonstrate that our novel information-theoretic measures robustly select non-Gaussian components from data in a fully automatic way, that is, without requiring any restrictive assumptions or thresholds. 1. Introduction Independent component analysis (ICA) is a powerful technique for signal demixing and data analysis in numerous applications. For example, in neuroscience, ICA is essential for the analysis of functional magnetic resonance imaging (fMRI) data and electroencephalograms (EEGs). The function of the human brain is very complex and can be only imaged at a very coarse spatial resolution. Millions of nerve cells are contained in a single voxel of fMRI data. The neural activity is indirectly measured by the so-called BOLD-effect, that is, by the increased supply of active regions with oxygenated blood. In EEG, the brain function can be directly measured by the voltage fluctuations resulting from ionic current flows within the neurons. The spacial resolution of EEG, however, is even much lower than that of fMRI. Usually, an EEG is recorded using an array of 64 electrodes distributed over the scalp. Often, the purpose of acquiring fMRI or EEG data is obtaing a better understanding of brain function while the subject is performing some task. An example for such an experiment is to show subjects images while they are in the scanner to study the processing of visual stimuli, see Section 4.1.4. Recent results in neuroscience, for example [1], confirm the organization of the human brain into distinct functional modules. During task processing, some functional modules are actively contributing to the task. However, many other modules are also active but not involved into task-specific activities. Due to the low resolution of fMRI and EEG data,

References

[1]  O. Sporns, “The human connectome: a complex network,” Annals of the New York Academy of Sciences, vol. 1224, no. 1, pp. 109–125, 2011.
[2]  A. Hyv?rinen, “Fast and robust fixed-point algorithms for independent component analysis,” IEEE Transactions on Neural Networks, vol. 10, no. 3, pp. 626–634, 1999.
[3]  A. Hyv?rinen, J. Karhunen, and E. Oja, Independent Component Analysis, John Wiley & Sons, New York, NY, USA, 2001.
[4]  P. M. Rasmussen, M. M?rup, L. K. Hansen, and S. M. Arnfred, “Model order estimation for independent component analysis of epoched EEG signals,” in Proceedings of the 1st International Conference on Bio-inspired Systems and Signal Processing (BIOSIGNALS '08), pp. 3–10, January 2008.
[5]  C. J. James and C. W. Hesse, “Independent component analysis for biomedical signals,” Physiological Measurement, vol. 26, no. 1, pp. R15–R39, 2005.
[6]  A. Hyv?rinen and E. Oja, “Independent component analysis: algorithms and applications,” Neural Networks, vol. 13, no. 4-5, pp. 411–430, 2000.
[7]  J. Himberg and A. Hyv?rinen, “Icasso: software for investigating the reliability of ica estimates by clustering and visualization,” in Proceedings of the IEEE Workshop on Neural Networks for Signal Processing (NNSP '03), pp. 259–268, 2003.
[8]  F. Meinecke, A. Ziehe, M. Kawanabe, and K. R. Müller, “A resampling approach to estimate the stability of one-dimensional or multidimensional independent components,” IEEE Transactions on Biomedical Engineering, vol. 49, no. 12, pp. 1514–1525, 2002.
[9]  G. Qian, “Computing minimum description length for robust linear regression model selection,” in Proceedings of the Pacific Symposium on Biocomputing, pp. 314–325, 1999.
[10]  S. R. Rao, H. Mobahi, A. Y. Yang, S. S. Sastry, and Y. Ma, “Natural image segmentation with adaptive texture and boundary encoding,” in Proceedings of the Asian Conference on Computer Vision (ACCV '09), vol. 5994 of Lecture Notes in Computer Science, pp. 135–146, 2009.
[11]  T. Wekel and O. Hellwich, “Selection of an optimal polyhedral surface model using the minimum description length principle,” in Proceedings of the 32nd Symposium of the German Association for Pattern Recognition (DAGM '10), vol. 6376 of Lecture Notes in Computer Science, pp. 553–562, 2010.
[12]  J. Sun, C. Faloutsos, S. Papadimitriou, and P. S. Yu, “GraphScope: parameter-free mining of large time-evolving graphs,” in Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '07), pp. 687–696, August 2007.
[13]  D. Pelleg and A. W. Moore, “X-means: extending k-means with efficient estimation of the number of clusters,” in Proceedings of the 17th International Conference on Machine Learning (ICML '00), pp. 727–734, 2000.
[14]  C. B?hm, C. Faloutsos, J. Y. Pan, and C. Plant, “Robust information-theoretic clustering,” in Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '06), pp. 65–75, August 2006.
[15]  C. B?hm, C. Faloutsos, and C. Plant, “Outlier-robust clustering using independent components,” in Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD '08), pp. 185–198, June 2008.
[16]  C. B?hm, K. Haegler, N. S. Müller, and C. Plant, “CoCo: coding cost for parameter-free outlier detection,” in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '09), pp. 149–157, July 2009.
[17]  P. Gruber, F. Theis, A. Tome, and E. Lang, “Automatic denoising using local independent component analysis,” in Proceedings of the 4th International ICSC Symposium on Engineering of Intelligent Systems (EIS '04), 2004.
[18]  A. Barron, J. Rissanen, and B. Yu, “The Minimum Description Length Principle in Coding and Modeling,” IEEE Transactions on Information Theory, vol. 44, no. 6, pp. 2743–2760, 1998.
[19]  T. C. M. Lee, “Regression spline smoothing using the minimum description length principle,” Statistics and Probability Letters, vol. 48, no. 1, pp. 71–82, 2000.
[20]  T. W. Lee, M. S. Lewicki, and T. J. Sejnowski, “ICA mixture models for unsupervised classification of non-Gaussian classes and automatic context switching in blind signal separation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 10, pp. 1078–1089, 2000.
[21]  A. Wismüller, O. Lange, D. R. Dersch et al., “Cluster analysis of biomedical image time-series,” International Journal of Computer Vision, vol. 46, no. 2, pp. 103–128, 2002.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133