Relative Newton and Smoothing Multiplier Optimization Methods for Blind Source Separation

This paper presents a convex geometry (CG)-based method for blind separation of nonnegative sources. First, the unaccessible source matrix is normalized to be column-sum-to-one by mapping the available observation matrix. Then, its zero-samples are found by searching the facets of the convex hull spanned by the mapped observations. Considering these zero-samples, a quadratic cost function with respect to each row of the unmixing matrix, together with a linear constraint in relation to the involved variables, is proposed. Upon which, an algorithm is presented to estimate the unmixing matrix by solving a classical convex optimization problem. Unlike the traditional blind source separation (BSS) methods, the CG-based method does not require the independence assumption, nor the uncorrelation assumption. Compared with the BSS methods that are specifically designed to distinguish between nonnegative sources, the proposed method requires a weaker sparsity condition. Provided simulation results illustrate the performance of our method.

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

Blind source separation and feature extraction in concurrent control charts pattern recognition: Novel analyses and a comparison of different methods

The most standard blind source separation (BSS) methods address the situation when a set of signals are available, e.g. from measurements, and all of them are linear memoryless combinations, with unknown coefficient values, of the same limited set of unknown source signals. BSS methods aim at estimating these unknown source signals and/or coefficients. This generic problem is e.g. faced in the field of Earth observation (where it is also called “unsupervised unmixing”), when considering the commonly used (over)simplified model of hyperspectral images. Each pixel of such an image has an associated reflectance spectrum derived from measurements, which is defined by the fraction of sunlight power reflected by the corresponding Earth surface at each wavelength. Each source signal is then the single reflectance spectrum associated with one of the classes of pure materials which are present in the region of Earth corresponding to the overall considered hyperspectral image. Besides, the associated coefficients define the surfaces on Earth covered with each of these pure materials in each sub-region corresponding to one pixel of the considered image. However, real hyperspectral data e.g. obtained in urban areas have a much more complex structure than the above basic model: each class of pure materials (e.g. roof tiles, trees or asphalt) has so-called spectral or intra-class variability, i.e. it yields a somewhat different spectral component in each pixel of the image. In this complex framework, this chapter shows that Principal Component Analysis (PCA) and its proposed extension are of high interest at three stages of our investigation. First, PCA allows us to analyze the above-mentioned spectral variability of real high-dimensional hyperspectral data and to propose an extended data model which is suited to these complex data. We then develop a versatile extension of BSS methods based on Nonnegative Matrix Factorization, which adds the capability to handle arbitrary forms of intra-class variability by transposing PCA concepts to this original version of the BSS tramework. Finally, PCA again proves to be very well suited to analyzing the high-dimensional data obtained as the result of the proposed BSS method.

The methods that can be done for the estimation of the number of source signals and separation of source signals using time‐frequency information are proposed as a method of blind source separation. In these methods, some independent conditions are assumed in a time‐frequency domain, and observed signals are expanded to time‐frequency domain using wavelet analysis. However, these methods are not considered phase differences (difference of distance) between source signals and observed signals. A new method is proposed. The method can be done not only for the source separation but also the specification of the locations of source signals considering phase differences. In this method, it is necessary to assume a rather stronger independent condition than former methods. But, on account of this assumption, a function that becomes a real value only when phase differences are coincidence in time‐frequency domain is determined. Using this function, first of all, the number of source signals is calculated, then the locations of source signals and source signals are calculated. The effectiveness of the method is shown using actual synthetic signals.

Event-related potentials (ERPs) are a superposition of electric potential differences generated by neurophysiological activity associated with psychophysical events. Spatiotemporal dissociation of these signal sources can supplement conventional ERP analysis and improve source localization. However, results from established source separation methods applied to ERPs can be challenging to interpret. Hence, we have developed a recurrent neural network (RNN) method for blind source separation. The RNN transforms input step pulse signals representing events into corresponding ERP difference waveforms. Source waveforms are obtained from penultimate layer units and scalp maps are obtained from feed-forward output layer weights that project these source waveforms onto EEG electrode amplitudes. An interpretable, sparse source representation is achieved by incorporating L1 regularization of signals obtained from the penultimate layer of the network during training. This RNN method was applied to four ERP difference waveforms (MMN, N170, N400, P3) from the open-access ERP CORE database, and independent component analysis (ICA) was applied to the same data for comparison. The RNN decomposed these ERPs into eleven spatially and temporally separate sources that were less noisy, tended to be more ERP-specific, and were less similar to each other than ICA-derived sources. The RNN sources also had less ambiguity between source waveform amplitude, scalp potential polarity, and equivalent current dipole orientation than ICA sources. In conclusion, the proposed RNN blind source separation method can be effectively applied to grand-average ERP difference waves and holds promise for further development as a computational model of event-related neural signals.

In this paper, we introduce a new blind source separation (BSS) method for linear instantaneous mixtures, which only assumes the sources to be uncorrelated. It is based on the time-segmented frequency- dependent real coherence function of the observed signals. This parameter makes it possible to detect time-frequency zones where only one source is active. Such zones are then used to identify the required separating coefficients by means of ratios of power spectral densities of the observed signals. This BSS method yields very high performance for mixtures of speech and/or noise signals, i.e. SNR improvements range from 50 dB to more than 90 dB.

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).

We propose a new method for blind source separation of cyclostationary sources, whose cyclic frequencies are unknown and may share one or more common cyclic frequencies. The suggested method exploits the cyclic correlation function of observation signals to compose a set of matrices which has a particular algebraic structure. The aforesaid matrices are automatically selected by proposing two new criteria. Then, they are jointly diagonalized so as to estimate the mixing matrix and retrieve the source signals as a consequence. The nonunitary joint diagonalization (NU‐JD) is ensured by Broyden‐Fletcher‐Goldfarb‐Shanno (BFGS) method which is the most commonly used update strategy for implementing a quasi‐Newton technique. The efficiency of the method is illustrated by numerical simulations in digital communications context, which show good performances comparing to other state‐of‐the‐art methods.

A novel semi-blind source separation framework towards maximum signal-to-interference ratio

Chapter 1 - Introduction

Dynamic blind source separation based on source-direction prediction

In this paper, we propose a novel method for blind source separation (BSS) based on time-frequency sparseness (TF) that can estimate the number of sources and time-frequency masks, even if the spatial aliasing problem exists. Many previous approaches, such as degenerate unmixing estimation technique (DUET) or observation vector clustering (OVC), are limited to microphone arrays of small spatial extent to avoid spatial aliasing. We develop an offline and an online algorithm that can both deal with spatial aliasing by directly comparing observed and model phase differences using a distance metric that incorporates the phase indeterminacy of 2p and considering all frequency bins simultaneously. Separation is achieved using a linear blind beamformer approach, hence musical noise common to binary masking is avoided. Furthermore, the offline algorithm can estimate the number of sources. Both algorithms are evaluated in simulations and real-world scenarios and show good separation performance.

Blind source separation has found applications in various areas including biomedical signal processing and genomic signal processing. Often, blind source separation is solved via independent component analysis (ICA) by assuming and utilizing mutual independence among source signals. However, in bio-signal and genomic signal processing, the assumption of independence is often untrue, and the performance of the ICA approach is not as good. Much effort has been devoted to searching alternative approaches to blind source separation without the independence assumption. One idea known as network component analysis (NCA) is developed to identify the underlying regulatory signals of transcription factors in the gene regulatory network. In this paper we show that NCA is a general method for blind source separation using a priori information on the mixing matrix. An alternative proof of identifiability using NCA is proposed and a novel method to solve the problem is developed. Validation is made through computer simulations.

We present a method of blind source separation (BSS) for speech signals using a complex extension of infinite sparse factor analysis (ISFA) in the frequency domain. Our method is robust against delayed signals that usually occur in real environments, such as reflections, short-time reverberations, and time lags of signals arriving at microphones. ISFA is a conventional non-parametric Bayesian method of BSS, which has only been applied to time domain signals because it can only deal with real signals. Our method uses complex normal distributions to estimate source signals and mixing matrix. Experimental results indicate that our method outperforms the conventional ISFA in the average signal-to-distortion ratio (SDR).