On the use of joint diagonalization in blind signal processing

Blind source separation (BSS) tries to decompose a given multivariate data set into the product of a mixing matrix and a source vector, both of which are unknown. The sources can be recovered if we pose additional constraints to this model. One class of BSS algorithms is given by algebraic BSS, which recovers the mixing structure by jointly diagonalizing various source condition matrices corresponding to different source models. We review classical BSS algorithms such as FOBI, JADE, AMUSE, SOBI, TDSEP and SONS within this framework; combination of the respective source conditions can then yield additional algorithms as implemented e.g. by JADE_TD. Extensions to dependent component analysis models such as spatiotemporal or multidimensional BSS are discussed