Monotonic convergence of fixed-point algorithms for ICA - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Neural Networks Année : 2003

Monotonic convergence of fixed-point algorithms for ICA

Résumé

We re-examine a fixed-point algorithm proposed by Hyvarinen for independent component analysis, wherein local convergence is proved subject to an ideal signal model using a square invertible mixing matrix. Here, we derive step-size bounds which ensure monotonic convergence to a local extremum for any initial condition. Our analysis does not assume an ideal signal model but appeals rather to properties of the contrast function itself, and so applies even with noisy data and/or more sources than sensors. The results help alleviate the guesswork that often surrounds step-size selection when the observed signal does not fit an idealized model
Fichier non déposé

Dates et versions

hal-01345079 , version 1 (13-07-2016)

Identifiants

Citer

Phillip Regalia, Eleftherios Kofidis. Monotonic convergence of fixed-point algorithms for ICA. IEEE Transactions on Neural Networks, 2003, 14 (4), pp.943 - 949. ⟨10.1109/TNN.2003.813843⟩. ⟨hal-01345079⟩
97 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More