Abstract
In this paper, we generalize the efficient geometric ICA algorithm FastGeo to overcomplete settings with more sources than sensors. The solution to this underdetermined problem will be presented in a two step approach. With geometric ICA we get an efficient method for the step - matrix-recovery - while the second step - source-recovery - uses a maximum-likelihood approach. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Theis, F. J., Puntonet, C. G., & Lang, E. W. (2003). An improved geometric overcomplete blind source separation algorithm. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2687, 265–272. https://doi.org/10.1007/3-540-44869-1_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
