Theis, Fabian J. and Lang, Elmar W. and Puntonet, C. G. (2004) A geometric algorithm for overcomplete linear ICA. NEUROCOMPUTING, 56. pp. 381-398. ISSN 0925-2312
Full text not available from this repository. (Request a copy)Abstract
Geometric algorithms for linear square independent component analysis (ICA) have recently received some attention due to their pictorial description and their relative case of implementation. The geometric approach to ICA was proposed first by Puntonet and Prieto (Neural Process. Lett. 2 (1995), Signal Processing 46 (1995) 267) in order to separate linear mixtures. We generalize these algorithms to overcomplete cases with more sources than sensors. With geometric ICA we get an efficient method for the matrix-recovery step in the framework of a two-step approach to the source separation problem. The second step-source-recovery-uses a maximum-likelihood approach. There we prove that the shortest-path algorithm as proposed by Bofill and Zibulevsky (in: P. Pajunen, J. Karhunen (Eds.), Independent Component Analysis and Blind Signal Separation (Proceedings of ICA'2000), 2000, pp. 87-92) indeed solves the maximum-likelihood conditions. (C) 2003 Elsevier B.V. All rights reserved.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | INDEPENDENT COMPONENT ANALYSIS; BLIND SEPARATION; REPRESENTATIONS; INFORMATION; MIXTURES; SIGNALS; NETWORK; overcomplete blind source separation; overcomplete independent component analysis; overcomplete representation; geometric independent component analysis |
| Subjects: | 500 Science > 570 Life sciences |
| Divisions: | Biology, Preclinical Medicine > Institut für Biophysik und physikalische Biochemie > Prof. Dr. Elmar Lang Biology, Preclinical Medicine > Institut für Biophysik und physikalische Biochemie > Prof. Dr. Elmar Lang > Arbeitsgruppe Dr. Fabian Theis |
| Depositing User: | Dr. Gernot Deinzer |
| Date Deposited: | 09 Aug 2021 06:12 |
| Last Modified: | 09 Aug 2021 06:12 |
| URI: | https://pred.uni-regensburg.de/id/eprint/38226 |
Actions (login required)
 |
View Item |
