Differential Fast Fixed-Point Algorithms for Underdetermined Instantaneous and Convolutive Partial Blind Source Separation

DOI10.1109/TSP.2007.894243zbMATH Open1391.94414arXiv0806.3195MaRDI QIDQ4564754FDOQ4564754

Authors: Johan Thomas, Yannick Deville, Shahram Hosseini 

Publication date: 12 June 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: This paper concerns underdetermined linear instantaneous and convolutive blind source separation (BSS), i.e., the case when the number of observed mixed signals is lower than the number of sources.We propose partial BSS methods, which separate supposedly nonstationary sources of interest (while keeping residual components for the other, supposedly stationary, "noise" sources). These methods are based on the general differential BSS concept that we introduced before. In the instantaneous case, the approach proposed in this paper consists of a differential extension of the FastICA method (which does not apply to underdetermined mixtures). In the convolutive case, we extend our recent time-domain fast fixed-point C-FICA algorithm to underdetermined mixtures. Both proposed approaches thus keep the attractive features of the FastICA and C-FICA methods. Our approaches are based on differential sphering processes, followed by the optimization of the differential nonnormalized kurtosis that we introduce in this paper. Experimental tests show that these differential algorithms are much more robust to noise sources than the standard FastICA and C-FICA algorithms.

Full work available at URL: https://arxiv.org/abs/0806.3195

Recommendations

• Fast fixed-point independent vector analysis algorithms for convolutive blind source separation
• Differential source separation for underdetermined instantaneous or convolutive mixtures: Concept and algorithms
• A fixed-point algorithm for blind source separation with nonlinear autocorrelation
• A Fast Algorithm for Nonunitary Joint Diagonalization and Its Application to Blind Source Separation
• A Soft-Constrained Dynamic Iterative Method of Blind Source Separation
• Fixed-point algorithms for the blind separation of arbitrary complex-valued non-Gaussian signal mixtures
• Algorithms with high order convergence speed for blind source extraction

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Detection theory in information and communication theory (94A13)

Cited In (4)

• A Soft-Constrained Dynamic Iterative Method of Blind Source Separation
• Algorithms with high order convergence speed for blind source extraction
• A new blind method for separating M+1 sources from M mixtures
• Fast nonlinear autocorrelation algorithm for source separation

This page was built for publication: Differential Fast Fixed-Point Algorithms for Underdetermined Instantaneous and Convolutive Partial Blind Source Separation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4564754)