A geometric algorithm for overcomplete linear ICA

Neurocomputing

Volumn 56, Issue 1-4, 2004, Pages 381-398

  Theis, Fabian J ^a   Lang, Elmar W ^a   Puntonet, Carlos G ^b  

^a UNIVERSITY OF REGENSBURG   (Germany)

^b UNIVERSITY OF GRANADA   (Spain)

Author keywords

Geometric independent component analysis; Overcomplete blind source separation; Overcomplete independent component analysis; Overcomplete representation

Indexed keywords

ALGORITHMS; GEOMETRY; NEUROLOGY; SENSORS; SIGNAL PROCESSING;

SIGNAL SEPARATION;

INDEPENDENT COMPONENT ANALYSIS;

ALGORITHM; ARTICLE; GEOMETRY; LINEAR SYSTEM; MAXIMUM LIKELIHOOD METHOD; PRIORITY JOURNAL; SENSOR; STATISTICAL ANALYSIS;

EID: 0742306442     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.neucom.2003.09.008     Document Type: Article

References (30)

1. Amari S. Natural gradient works efficiently in learning Neural Comput. 10 2 1998 251-276
2. Amari S. Cichocki A. Yang H.H. A new learning algorithm for blind signal separation Adv. Neural Inform. Process. Systems 8 1996 757-763
3. Bauer Ch. Habl M. Lang E.W. Puntonet C.G. Alvarez M.R. Probabilistic and geometric ICA applied to the separation of EEG signals in: Hamza M.H. (Ed.), Signal Processing and Communication (Proceedings of SPC'2000) 2000 339-346 IASTED/ACTA Press Anaheim, USA
4. C.T. Bauer, C.G. Puntonet, M.R. Alvarez, E.W. Lang, Separation of related EEG signals with geometric procedures, Second International ICSC Symposium on Engineering of Intelligent Systems (EIS'2000), Paisley, Scotland, 27-30 June, 2000, pp. 104-108.
5. Bell A.J. Sejnowski T.J. An information-maximisation approach to blind separation and blind deconvolution Neural Comput. 7 1995 1129-1159
6. P. Bofill, M. Zibulevsky, Blind separation of more sources than mixtures using sparsity of their short-time Fourier transform, in: P. Pajunen, J. Karhunen (Eds.), Independent Component Analysis and Blind Signal Separation (Proceedings of ICA'2000), Helsinki, Finland, 2000, pp. 87-92.
7. Cardoso J.F. Laheld B.H. Equivariant adaptive source separation IEEE Trans. Signal Process. 44 12 1996 3017-3030
8. S. Chen, D.L. Donoho, M.A. Saunders, Atomic decomposition by basis pursuit, Technical Report, Department of Statistics, Stanford University, Stanford, CA, 1996.
9. Comon P. Independent component analysis - a new concept? Signal Process. 36 1994 287-314
10. L. De Lathauwer, P. Comon, B. De Moor, J. Vandewalle, ICA algorithms for 3 sources and 2 sensors, IEEE Signal Processing Workshop on Higher-Order Statistics, Caesarea, Israel, June 14-16, 1999, pp. 116-120.
11. Harpur G.F. Prager R.W. Development of low-entropy coding in a recurrent network Network 7 1996 277-284
12. Hyvärinen A. Fast and robust fixed-point algorithms for independent component analysis IEEE Trans. Neural Networks 10 3 1999 626-634
13. Hyvärinen A. Oja E. A fast fixed-point algorithm for independent component analysis Neural Comput. 9 1997 1483-1492
14. A. Jung, F.J. Theis, C.G. Puntonet, E.W. Lang, Fastgeo-a histogram based approach to linear geometric ica, Proceedings of ICA 2001, San Diego, CA, 2001, pp. 418-423.
15. Jutten C. Herault J. Blind separation of sources, part I: an adaptive algorithm based on neuromimetic architecture Signal Process. 24 1991 1-10
16. Jutten C. Herault J. Comon P. Sorouchiary E. Blind separation of sources, parts I, II and III Signal Process. 24 1991 1-29
17. Lee T. Lewicki M.S. Girolami M. Sejnowski T.J. Blind source separation of more sources than mixtures using overcomplete representations IEEE Signal Process. Lett. 6 4 1999 87-90
18. Lewicki M.S. Olshausen B.A. Probabilistic framework for the adaptation and comparison of image codes J. Optical Soc. America 16 7 1999 1587-1601
19. Lewicki M.S. Sejnowski T.J. Learning overcomplete representations Neural Comput 12 2000 337-365
20. M.S. Lewicki, T.J. Sejnowski, Learning nonlinear overcomplete representations for efficient coding, in: M.I. Jordan, M.J. Kearns, S.A. Solla (Eds.), Advances in Neural Information Processing Systems, Vol. 10, The MIT Press, Cambridge, 1998.
21. R. Linsker, An application of the principle of maximum information preservation to linear systems, in: D.S. Touretzky (Ed.), Advances in Neural Information Processing Systems, Vol. 1, Morgan Kaufmann, San Mateo, CA, 1989, pp. 186-194.
22. Linsker R. Local synaptic learning rules suffice to maximize mutual information in a linear network Neural Comput. 4 1992 691-702
23. B.A. Olshausen, Learning linear, sparse, factorial codes, Technical Report, AIM-1580, 1996.
24. B.A. Olshausen, D.J. Field, Sparse coding of natural images produces localized, oriented, bandpass receptive fields, Technical Report CCN-110-95, Department of Psychology, Cornell University, Ithaca, NY 14853, 1995.
25. C.G. Puntonet, M.R. Alvarez, A. Prieto, B. Prieto, Separation of speech signals for nonlinear mixtures, Lecture Notes in Computer Science, Vol. 1607, Springer, Berlin, 1999, pp. 665-673.
26. C.G. Puntonet, Ch. Bauer, E.W. Lang, M.R. Alvarez, B. Prieto, Adaptive-geometric methods: application to the separation of EEG signals, in: P. Pajunen, J. Karhunen (Eds.), Independent Component Analysis and Blind Signal Separation (Proceedings of ICA'2000), Helsinki, Finland, 2000, pp. 273-278.
27. C.G. Puntonet, A. Prieto, An adaptive geometrical procedure for blind separation of sources, Neural Process. Lett. 2 (1995).
28. Puntonet C.G. Prieto A. Neural net approach for blind separation of sources based on geometric properties Neurocomputing 18 1998 141-164
29. Puntonet C.G. Prieto A. Jutten C. Alvarez M.R. Ortega J. Separation of sources: a geometry-based procedure for reconstruction of n-valued signals Signal Process. 46 1995 267-284
30. F.J. Theis, A. Jung, E.W. Lang, C.G. Puntonet, A theoretic model for geometric linear ICA, Proceedings of ICA 2001, San Diego, CA, 2001, pp. 349-354.