Some gradient based joint diagonalization methods for ICA

24Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a set of gradient based orthogonal and non-orthogonal matrix joint diagonalization algorithms. Our approach is to use the geometry of matrix Lie groups to develop continuous-time flows for joint diagonalization and derive their discretized versions. We employ the developed methods to construct a class of Independent Component Analysis (ICA) algorithms based on non-orthogonal joint diagonalization. These algorithms pre-whiten or sphere the data but do not restrict the subsequent search for the (reduced) un-mixing matrix to orthogonal matrices, hence they make effective use of both second and higher order statistics. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Afsari, B., & Krishnaprasad, P. S. (2004). Some gradient based joint diagonalization methods for ICA. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3195, 437–444. https://doi.org/10.1007/978-3-540-30110-3_56

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free