mlsanityData to 14 Oct 2026

An Information Maximization Based Blind Source Separation Approach for Dependent and Independent Sources

arXiv 2205.00794 ↗First posted 2 May 2022cs.IT eess.SP math.ITcited by 7

Not on the map. Why?

Abstract (arXiv)

We introduce a new information maximization (infomax) approach for the blind source separation problem. The proposed framework provides an information-theoretic perspective for determinant maximization-based structured matrix factorization methods such as nonnegative and polytopic matrix factorization. For this purpose, we use an alternative joint entropy measure based on the log-determinant of covariance, which we refer to as log-determinant (LD) entropy. The corresponding (LD) mutual information between two vectors reflects a level of their correlation. We pose the infomax BSS criterion as the maximization of the LD-mutual information between the input and output of the separator under the constraint that the output vectors lie in a presumed domain set. In contrast to the ICA infomax approach, the proposed information maximization approach can separate both dependent and independent sources. Furthermore, we can provide a finite sample guarantee for the perfect separation condition in the noiseless case.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 2 May 2022.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 3; 2023: 2; 2024: 0; 2025: 0; 2026: 2.

7 papers.