Generalized Non-orthogonal Joint Diagonalization with LU Decomposition and Successive Rotations

by   Xiao-Feng Gong, et al.

Non-orthogonal joint diagonalization (NJD) free of prewhitening has been widely studied in the context of blind source separation (BSS) and array signal processing, etc. However, NJD is used to retrieve the jointly diagonalizable structure for a single set of target matrices which are mostly formulized with a single dataset, and thus is insufficient to handle multiple datasets with inter-set dependences, a scenario often encountered in joint BSS (J-BSS) applications. As such, we present a generalized NJD (GNJD) algorithm to simultaneously perform asymmetric NJD upon multiple sets of target matrices with mutually linked loading matrices, by using LU decomposition and successive rotations, to enable J-BSS over multiple datasets with indication/exploitation of their mutual dependences. Experiments with synthetic and real-world datasets are provided to illustrate the performance of the proposed algorithm.



There are no comments yet.


page 12


Graph Signal Processing Meets Blind Source Separation

In graph signal processing (GSP), prior information on the dependencies ...

Double Coupled Canonical Polyadic Decomposition for Joint Blind Source Separation

Joint blind source separation (J-BSS) is an emerging data-driven techniq...

A Joint Diagonalization Based Efficient Approach to Underdetermined Blind Audio Source Separation Using the Multichannel Wiener Filter

This paper presents a computationally efficient approach to blind source...

unrolling palm for sparse semi-blind source separation

Sparse Blind Source Separation (BSS) has become a well established tool ...

Sparsity and adaptivity for the blind separation of partially correlated sources

Blind source separation (BSS) is a very popular technique to analyze mul...

Diagonalisation of covariance matrices in quaternion widely linear signal processing

Recent developments in quaternion-valued widely linear processing have i...

Beyond Pham's algorithm for joint diagonalization

The approximate joint diagonalization of a set of matrices consists in f...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.