SDApr 16, 2016

Two Pairwise Iterative Schemes For High Dimensional Blind Source Separation

arXiv:1604.04669v14 citations
Originality Incremental advance
AI Analysis

This addresses the challenge of separating many sources in real-world applications, though it appears incremental as it builds on existing ICA methods.

The paper tackles the high dimensionality problem in blind source separation by proposing two pairwise iterative schemes based on a new Convex Cauchy-Schwarz Divergence, enabling fast and efficient demixing of sources, with demonstrated performance superiority over existing algorithms like FastICA and RobustICA.

This paper addresses the high dimensionality problem in blind source separation (BSS), where the number of sources is greater than two. Two pairwise iterative schemes are proposed to tackle this high dimensionality problem. The two pairwise schemes realize nonparametric independent component analysis (ICA) algorithms based on a new high-performance Convex CauchySchwarz Divergence (CCSDIV). These two schemes enable fast and efficient demixing of sources in real-world high dimensional source applications. Finally, the performance superiority of the proposed schemes is demonstrated in metric-comparison with FastICA, RobustICA, convex ICA (CICA), and other leading existing algorithms.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes