Differential fast fixed-point algorithms for underdetermined instantaneous and convolutive partial blind source separation

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.Comment: this paper describes our differential FastICA-like algorithms for linear instantaneous and convolutive underdetermined mixture

SZ and CMB reconstruction using Generalized Morphological Component Analysis

In the last decade, the study of cosmic microwave background (CMB) data has become one of the most powerful tools to study and understand the Universe. More precisely, measuring the CMB power spectrum leads to the estimation of most cosmological parameters. Nevertheless, accessing such precious physical information requires extracting several different astrophysical components from the data. Recovering those astrophysical sources (CMB, Sunyaev-Zel'dovich clusters, galactic dust) thus amounts to a component separation problem which has already led to an intense activity in the field of CMB studies. In this paper, we introduce a new sparsity-based component separation method coined Generalized Morphological Component Analysis (GMCA). The GMCA approach is formulated in a Bayesian maximum a posteriori (MAP) framework. Numerical results show that this new source recovery technique performs well compared to state-of-the-art component separation methods already applied to CMB data.Comment: 11 pages - Statistical Methodology - Special Issue on Astrostatistics - in pres

Jointly Tracking and Separating Speech Sources Using Multiple Features and the generalized labeled multi-Bernoulli Framework

This paper proposes a novel joint multi-speaker tracking-and-separation method based on the generalized labeled multi-Bernoulli (GLMB) multi-target tracking filter, using sound mixtures recorded by microphones. Standard multi-speaker tracking algorithms usually only track speaker locations, and ambiguity occurs when speakers are spatially close. The proposed multi-feature GLMB tracking filter treats the set of vectors of associated speaker features (location, pitch and sound) as the multi-target multi-feature observation, characterizes transitioning features with corresponding transition models and overall likelihood function, thus jointly tracks and separates each multi-feature speaker, and addresses the spatial ambiguity problem. Numerical evaluation verifies that the proposed method can correctly track locations of multiple speakers and meanwhile separate speech signals

A matrix-pencil approach to blind separation of colored nonstationary signals

For many signal sources such as speech with distinct, nonwhite power spectral densities, second-order statistics of the received signal mixture can be exploited for signal separation. Without knowledge on noise correlation matrix, we propose a simple and yet effective signal extraction method for signal source separation under unknown temporally white noise. This new and unbiased signal extractor is derived from the matrix pencil formed between output autocorrelation matrices at different delays. Based on the matrix pencil, an ESPRIT-type algorithm is derived to get an optimal solution in least square sense. Our method is well suited for systems with colored sensor noises and for nonstationary signals. © 2000 IEEE.published_or_final_versio