Underdetermined independent component analysis by data generation

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 188
  • Download : 0
In independent component analysis (ICA), linear transformation that minimizes the dependence among the components is estimated. Conventional ICA algorithms are applicable when the numbers of sources and observations are equal; however, they are inapplicable to the underdetermined case where the number of sources is larger than that of observations. Most underdetermined ICA algorithms have been developed with an assumption that all sources have sparse distributions. In this paper, a novel method for converting the underdetermined ICA problem to the conventional ICA problem is proposed; by generating hidden observation data, the number of the observations can be made to equal that of the sources. The hidden observation data are generated so that the probability of the estimated sources is maximized. The proposed method can be applied to separate the underdetermined mixtures of sources without the assumption that the sources have sparse distribution. Simulation results show that the proposed method separates the underdetermined mixtures of sources with both sub- and super-Gaussian distributions.
Publisher
SPRINGER-VERLAG BERLIN
Issue Date
2004
Language
English
Article Type
Proceedings Paper
Keywords

BLIND SOURCE SEPARATION; OVERCOMPLETE REPRESENTATIONS

Citation

INDEPENDENT COMPONENT ANALYSIS AND BLIND SIGNAL SEPARATION BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE, v.3195, pp.445 - 452

ISSN
0302-9743
URI
http://hdl.handle.net/10203/82744
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0