Jacobi iterations for canonical dependence analysis - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Signal Processing Année : 2013

Jacobi iterations for canonical dependence analysis

Résumé

In this manuscript we will study the advantages of Jacobi iterations to solve the problem of Canonical Dependence Analysis. Canonical Dependence Analysis can be seen as an extension of the Canonical Correlation Analysis where correlation measures are replaced by measures of higher order statistical dependencies. We will show the benefits of choosing an algorithm that exploits the manifold structure on which the optimisation problem can be formulated and contrast our results with the joint blind source separation algorithm that optimises the criterion in its ambient space. A major advantage of the proposed algorithm is the capability of identifying a linear mixture when multiple observation sets are available containing variables that are linearly dependent between the sets, independent within the sets and contaminated with non-Gaussian independent noise. Performance analysis reveals at least linear convergence speed as a function of the number of sweeps.
Fichier principal
Vignette du fichier
ReferencedICA.pdf (382.88 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00998061 , version 1 (30-05-2014)

Identifiants

Citer

Ronald Phlypo. Jacobi iterations for canonical dependence analysis. Signal Processing, 2013, 93 (1), pp.185-197. ⟨10.1016/j.sigpro.2012.07.021⟩. ⟨hal-00998061⟩
129 Consultations
161 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More