Optimization on the orthogonal group for independent component analysis

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

Abstract

This paper derives a new algorithm that performs independent component analysis (ICA) by optimizing the contrast function of the RADICAL algorithm. The core idea of the proposed optimization method is to combine the global search of a good initial condition with a gradient-descent algorithm. This new ICA algorithm performs faster than the RADICAL algorithm (based on Jacobi rotations) while still preserving, and even enhancing, the strong robustness properties that result from its contrast. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Journée, M., Absil, P. A., & Sepulchre, R. (2007). Optimization on the orthogonal group for independent component analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4666 LNCS, pp. 57–64). Springer Verlag. https://doi.org/10.1007/978-3-540-74494-8_8

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