Jacobi iterations for Canonical Dependence Analysis

  • Authors:
  • R. Phlypo

  • Affiliations:
  • Vision and Brain Signal Processing (ViBS) Research Group, Université de Grenoble/CNRS UMR 5216, Domaine Universitaire, 11 rue des Mathématiques, BP 46, 38402 Saint Martin d'Hères Ce ...

  • Venue:
  • Signal Processing
  • Year:
  • 2013

Quantified Score

Hi-index 0.08

Visualization

Abstract

In this paper 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.