A Robust Algorithm for Blind Separation of Convolutive Mixture of Sources

This paper focuses on the blind source separation of convolutive mixtures based on high order cumulants. It is proved that the zero-forcing of pairwise cross-cumulants of the outputs of separation system is a sufficient criterion for the separation of convolutive mixtures. New algorithm is developed based on this criterion. Simulation results are presented to support the validity of the algorithm.

<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> This letter addresses the problem of the nonunitary joint block diagonalization of a given set of complex matrices whose potential applications stem from the blind separation of convolutive mixtures of sources and from the array processing. The proposed algorithm is based on the algebraic optimization of a least-mean-square criterion. One of its advantage is that a pre-whitening stage is no more compulsorily required when this algorithm is applied in the blind source separation context. Computer simulations are provided in order to illustrate its behavior in three cases: when exact block-diagonal matrices are built, then when they are progressively perturbed by an additive Gaussian noise and, finally, in the context of blind separation of convolutive mixtures of temporally correlated sources with estimated correlation matrices. A comparison with a classical orthogonal joint block diagonalization algorithm is also performed, and a new performance index is introduced to measure the performance of the separation. </para>

We propose a new algorithm for blind source separation (BSS), in which independent component analysis (ICA) and beamforming are combined to resolve the low-convergence problem through optimization in ICA. The proposed method consists of the following three parts: (1) frequency-domain ICA with direction-of-arrival (DOA) estimation; (2) null beamforming based on the estimated DOA; (3) integration of (1) and (2) based on the algorithm diversity in both iteration and frequency domain. The inverse of the mixing matrix obtained by ICA is temporally substituted by the matrix based on null beamforming through iterative optimization, and the temporal alternation between ICA and beamforming can realize fast- and high-convergence optimization. The results of the signal separation experiments reveal that the signal separation performance of the proposed algorithm is superior to that of the conventional ICA-based BSS method, even under reverberant conditions.

Blind single-channel source separation is a long-standing machine learning and signal processing problem. Traditional blind source separation (BSS) algorithms were proposed to solve this task utilizing multiple signal constraints. Generative adversarial network (GAN) are free from statistical constraints and samples, but the role of adversarial training in the task of BSS has not been fully demonstrated. Therefore, a new separation network model that enables to learn the known separated signal distribution from the stepwise fine estimation of the unknown mixture distribution was presented in this paper, and a self-attention mechanism was introduced to solve the problem of the blurring details of the generated image by the generator which preserves image details in the process of image separation. Compared with the existing single-channel blind source separation algorithm based on generative adversarial network-neural egg separation (NES), the detailed information of this new separation algorithm is more prominent, and the source signal in the mixed image has been separated more effectively, and has better separation performance than the classic blind source separation algorithms.

This paper describes a novel modification to the well-known natural gradient or INFOMAX algorithm for blind source separation that largely mitigates its divergence problems. The modified algorithm imposes an a posteriori scalar gradient constraint that adds little computational complexity to the algorithm and exhibits fast convergence and excellent performance for fixed step size values that are largely independent of input signal magnitudes and initial separation matrix estimates. Evaluation of the approach for the separation of instantaneous and convolutive source mixtures using both time- and frequency-domain implementations shows its excellent separation behavior.

For the blind source separation algorithm, choices of nonlinear function and step-size are very important. In this paper, we propose a novel natural gradient speech blind separation algorithm. The main ingredients are the use of a variable step-size technology and a nonlinear function based on Laplacian normal mixture distribution. Simulation results indicate the proposed method ensures steady state error of algorithm and accelerates convergence speed of algorithm.

An adaptive blind source separation algorithm for the separation of convolutive mixtures of cyclostationary signals is proposed. The algorithm is derived by applying natural gradient iterative learning to a novel cost function which is defined according to the wide sense cyclostationarity of signals and can be deemed as a new member of the family of natural gradient algorithms for convolutive mixtures. A method based on estimating the cycle frequencies required for practical implementation of the proposed algorithm is presented. The efficiency of the algorithm is supported by simulations, which show that the proposed algorithm has improved performance for the separation of convolved cyclostationary signals in terms of convergence speed and waveform similarity measurement, as compared to the conventional natural gradient algorithm for convolutive mixtures. Copyright © 2004 John Wiley &amp; Sons, Ltd.

A comparative study of approximate joint diagonalization algorithms of a set of matrices is presented. Using a weighted least-squares criterion, without the orthogonality constraint, an algorithm is compared with an analogous one for blind source separation (BSS). The criterion of the present algorithm is on the separating matrix while the other is on the mixing matrix. The convergence of the algorithm is proved under some mild assumptions. The performances of the two algorithms are compared with usual standard algorithms using BSS simulations results. We show that the improvement in estimating the separating matrix, resulting from the relaxation of the orthogonality restriction, can be achieved in presence of additive noise when the length of observed sequences is sufficiently large and when the mixing matrix is not close to an orthogonal matrix

This work presents the application of Blind Source Separation (BSS) Algorithms on Dual-band IR Spectrogram for breast cancer detection and tracing the effect of long-term chemotherapy for breast-cancer patients. We take Dual-band IR Spectrogram's RAW Data as an input to the BSS algorithms. Integrated into the back-end processor of a Dual-band IR Sensor and Readout Circuit Platform, our Improved Neighbor-based BSS algorithm operated on Dual-band IR Spectrogram provides a better breast cancer detection. Considering the demarcating degree, our Improved Neighbor-based BSS algorithm is approximately 15% better than other algorithms. As to the correctness rate, our improved algorithm approximately increases 10% compared with other algorithms.

Upgrading Sparse NMF algorithm for blind source separation through Adaptive Parameterized Hybrid Kernel based approach

This article addresses the problem of the Non Unitary Joint Block Diagonalization ( $$\mathsf {NU-JBD}$$ ) of a given set of complex matrices for the blind separation of convolutive mixtures of sources. We propose new different iterative optimization schemes based on Conjugate Gradient, Preconditioned Conjugate Gradient, Levenberg–Marquardt and Quasi-Newton methods. We perform also a study to determine which of these algorithms offer the best compromise between efficiency and convergence speed in the studied context. To be able to derive all these algorithms, a preconditioner has to be computed which requires either the calculation of the complex Hessian matrices or the use of an approximation to these Hessian matrices. Furthermore, the optimal stepsize is also computed algebraically to speed up the convergence of these algorithms. Computer simulations are provided in order to illustrate the behavior of the different algorithms in various contexts: when exactly block-diagonal matrices are considered but also when these matrices are progressively perturbed by an additive Gaussian noise. Finally, it is shown that these algorithms enable solving the blind separation of the convolutive mixtures of sources problem.

Blind source separation (BSS) algorithms are often categorized as either narrowband or broadband algorithms depending on whether their respective cost functions aim at individual DFT bins or the entire broadband signal. In this contribution, we present comparable general natural gradient-based formulations of both concepts based on the TRINICON framework. As a distinctive feature, narrowband algorithms imply an internal permutation and scaling problem. We show that the common DOA estimation-based methods for aligning the permutations effectively rely on geometric a-priori knowledge, and we explain why they need to be complemented by additional repair mechanisms for robust BSS. The latter can already be viewed as approximations of the generic TRINICON broadband algorithm. As a conclusion, we propose to always use a generic broadband algorithm as a starting point for the design of new BSS algorithms.

In the recent past, blind source separation (BSS) algorithms using multivariate statistical data analysis technique have been successfully used for source identification and separation in the field of biomedical and statistical signal processing. Recently numbers of different BSS techniques have been developed. With BSS methods being the feasible method for source separation and decomposition of biosignals, it is important to compare the different techniques and determine the most suitable method for the applications. This paper presents the performance of five BSS algorithms (SOBI, TDSEP, FastICA, JADE and Infomax) for decomposition of sEMG to identify subtle finger movements. It is observed that BSS algorithms based on second-order statistics (SOBI and TDSEP) gives better performance compared to algorithms based on higher-order statistics (FastICA, JADE and infomax).

This letter proposes a novel method of a highly secured time domain cryptosystem to provide security for mobile voice calls. Using a modified version of blind source separation (BSS) algorithms, the proposed cryptosystem provides a complete solution for highly secured communications between the two ends of any voice call without the need for modifying the existing mobile network infrastructure. Moreover, this system can be easily connected to any type of mobile equipment. To overcome the bandwidth expansion usually associated with BSS algorithms, the proposed system uses a modified key generation process to limit the bandwidth occupied by the encrypted speech signal. Evaluation of the modified encryption and decryption algorithms proved the validity of these changes for speech signals in terms of signal to noise ratio and residual intelligibility.

Blind Source Separation (BSS) algorithms based on the noise-free model are not applicable when the Signal Noise Ratio (SNR) is low. In view of this situation, our solution is to denoise the mixtures with additive white Gaussian noise firstly, and then use BSS algorithms. This paper proposes a piecewise Empirical Mode Decomposition (EMD) thresholding approach to denoise mixtures with strong noise. This approach can distinguish the noise-dominated IMFs and signal-dominated IMFs, and then respectively apply different thresholdings methods. Simulation results show that compared with the Wavelet denoising, the proposed approach has a better denoising performance, and can remarkably enhance the separation performance of BSS algorithms, especially when the signal SNR is low.