Joint diagonalization via subspace fitting techniques

Authors:
A.-J. van der Veen
Affiliations:
Dept. of Electr. Eng., Delft Univ. of Technol., Netherlands
Venue:
ICASSP '01 Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05
Year:
2001

Citing 0
Cited 8

A Fast Algorithm for Joint Diagonalization with Non-orthogonal Transformations and its Application to Blind Source Separation

The Journal of Machine Learning Research
Fast approximate joint diagonalization incorporating weight matrices

IEEE Transactions on Signal Processing
Gradient-based joint block diagonalization algorithms: Application to blind separation of FIR convolutive mixtures

Signal Processing
Blind separation of mutually correlated sources using precoders

IEEE Transactions on Neural Networks
QML-based joint diagonalization of positive-definite hermitian matrices

IEEE Transactions on Signal Processing
An algebraic method for approximate rank one factorization of rank deficient matrices

LVA/ICA'12 Proceedings of the 10th international conference on Latent Variable Analysis and Signal Separation
Fast nonunitary joint block diagonalization with degenerate solution elimination for convolutive blind source separation

Digital Signal Processing
Spherical mesh adaptive direct search for separating quasi-uncorrelated sources by range-based independent component analysis

Neural Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

Joint diagonalization problems of Hermitian or non-Hermitian matrices occur as the final parameter estimation step in several blind source separation problems such as ACMA, JADE, PARAFAC, and SOBI. Previous approaches have been Jacobi iteration schemes and alternating projections. Here we show how the joint diagonalization problem can be formulated as a (weighted) subspace fitting problem so that it can be solved using the efficient Gauss-Newton optimization algorithm proposed for that problem. Since a good initial point is usually available, the algorithm converges very fast.