Fast approximate joint diagonalization incorporating weight matrices
IEEE Transactions on Signal Processing
DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
Complex blind source separation via simultaneous strong uncorrelating transform
LVA/ICA'10 Proceedings of the 9th international conference on Latent variable analysis and signal separation
Sensitivity of joint approximate diagonalization in FD BSS
LVA/ICA'10 Proceedings of the 9th international conference on Latent variable analysis and signal separation
On computation of approximate joint block-diagonalization using ordinary AJD
LVA/ICA'12 Proceedings of the 10th international conference on Latent Variable Analysis and Signal Separation
| Hi-index | 0.00 |
We investigate the sensitivity of the problem of nonorthogonal (matrix) joint diagonalization (NOJD). First, we consider the uniqueness conditions for the problem of exact joint diagonalization (EJD), which is closely related to the issue of uniqueness in tensor decompositions. As a byproduct, we derive the well-known identifiability conditions for independent component analysis (ICA) based on an EJD formulation of ICA. We next introduce some known cost functions for NOJD and derive flows based on these cost functions for NOJD. Then we define and investigate the noise sensitivity of the stationary points of these flows. We show that the condition number of the joint diagonalizer and uniqueness of the joint diagonalizer as measured by modulus of uniqueness (as defined in this paper) affect the sensitivity. We also investigate the effect of the number of matrices on the sensitivity. Our numerical experiments confirm the theoretical results.While this paper was under review a few of its results were presented in ICASSP07 conference in Honolulu, HI .