A Comparative Study of Approximate Joint Diagonalization Algorithms for Blind Source Separation in Presence of Additive Noise

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.

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.

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 paper addresses the problem of blind equalization based on a multi-input multi-output (MIMO) model. Using a more general structure for MIMO channels, we present a method that combines fractional sampling and a blind source separation (BSS) algorithm to recover transmitted symbols in the presence of ISI (intersymbol interference). Oversampling allows for converting the FIR MIMO model to an instantaneous mixing model. The equalization may then be performed via BSS. We propose a recursive estimator stemming from the Kalman filter for this task. The method achieves equalization even in the case of a slowly time-varying channel and in the presence of additive noise. Simulation results are presented illustrating the good performance of the method.

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.

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.

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.

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.

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.

A new blind image source separation algorithm based on feedback sparse component analysis

Conventional algorithms for blind source separation do not necessarily work well for real-world data. One of the reasons is that, in actual applications, the mixing matrix is often almost singular at some part of frequency range and it can cause a certain computational instability. This paper proposes a new algorithm to overcome this singularity problem. The algorithm is based on the minimal distortion principle proposed by the authors and in addition incorporates a kind of regularization term into it, which has a role to suppress the gain of the separator for the frequency range at which the mixing matrix is almost singular.

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, and (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.

In this paper, a novel PARAllel FACtor (PARAFAC) decomposition based Blind Source Separation (BSS) algorithm is proposed for modal identification of structures equipped with tuned mass dampers. Tuned mass dampers (TMDs) are extremely effective vibration absorbers in tall flexible structures, but prone to get de-tuned due to accidental changes in structural properties, alteration in operating conditions, and incorrect design forecasts. Presence of closely spaced modes in structures coupled with TMDs renders output-only modal identification difficult. Over the last decade, second-order BSS algorithms have shown significant promise in the area of ambient modal identification. These methods employ joint diagonalization of covariance matrices of measurements to estimate the mixing matrix (mode shape coefficients) and sources (modal responses). Recently, PARAFAC BSS model has evolved as a powerful multi-linear algebra tool for decomposing an nth order tensor into a number of rank-1 tensors. This method is utilized in the context of modal identification in the present study. Covariance matrices of measurements at several lags are used to form a 3rd order tensor and then PARAFAC decomposition is employed to obtain the desired number of components, comprising of modal responses and the mixing matrix. The strong uniqueness properties of PARAFAC models enable direct source separation with fine spectral resolution even in cases where the number of sensor observations is less compared to the number of target modes, i.e., the underdetermined case. This capability is exploited to separate closely spaced modes of the TMDs using partial measurements, and subsequently to estimate modal parameters. The proposed method is validated using extensive numerical studies comprising of multi-degree-of-freedom simulation models equipped with TMDs, as well as with an experimental set-up.

It is inevitable that measured signals are contaminated with noise when MEMS sensor is used for an outdoor measurement. So the obtained signals need noise elimination, which is one of key technologies for signal conditioning. In this paper, a novel noise elimination method based on algorithm of blind source separation (BSS) for MEMS sensor is proposed to separate the source signals from the mixed signals with noises. The BSS algorithm based on maximum signal noise ratio (SNR) is a method of global optimal property, using the characteristic that SNR is maximal when statistically independent source signals are completely separated.The algorithm has a low computational complexity for instantaneous linear mixture signals. It is effective to acquire the source signals from the mixed signals with noises obtained by MEMS sensor,and is successfully verified by simulation experiment of BSS algorithm.The result of noise elimination experiment has achieved signal conditioning and eliminates ambient noises for MEMS sensor signals.

The question of how to separate individual brain and non-brain signals, mixed by volume conduction in electroencephalographic (EEG) and other electrophysiological recordings, is a significant problem in contemporary neuroscience. This study proposes and evaluates a novel EEG Blind Source Separation (BSS) algorithm based on a weak exclusion principle (WEP). The chief point in which it differs from most previous EEG BSS algorithms is that the proposed algorithm is not based upon the hypothesis that the sources are statistically independent. Our first step was to investigate algorithm performance on simulated signals which have ground truth. The purpose of this simulation is to illustrate the proposed algorithm's efficacy. The results show that the proposed algorithm has good separation performance. Then, we used the proposed algorithm to separate real EEG signals from a memory study using a revised version of Sternberg Task. The results show that the proposed algorithm can effectively separate the non-brain and brain sources.