Given a linear and instantaneous mixture model, we prove that for blind source separation (BSS) algorithms based on mutual information, only sources with non-Gaussian distribution are consistently reconstructed independent of initial conditions. This allows the identification of non-Gaussian sources and consequently the identification of signal and noise subspaces through BSS. The results are illustrated with a simple example, and the implications for a variety of signal processing applications, such as denoising and model identification, are discussed
International audienceFor the convolutive mixture, a subspace method to separate the sources is prop...
Most source separation algorithms are based on a model of stationary sources. However, it is a simpl...
International audienceFor the convolutive mixture, a subspace method to separate the sources is prop...
Given a linear and instantaneous mixture model, we prove that for blind source separation (BSS) algo...
We propose an algorithm for blind separation of sources in convolutive mixtures based on a subspace ...
This paper considers the problem of blindly separating sub- and super-Gaussian sources from underdet...
In the basic signal model of blind source separation (BSS), an unknown linear mixing process is assu...
Abstract—Blind system identification and subspace tracking represent two important classes of signal...
We analyze blind separation of independent sources in the face of additive noise. The analysis is ca...
This paper deals with the problem of blind identification and source separation which consists of es...
International audienceFor the convolutive mixture, a subspace method to separate the sources is prop...
International audienceFor the convolutive mixture, a subspace method to separate the sources is prop...
International audienceFor the convolutive mixture, a subspace method to separate the sources is prop...
International audienceFor the convolutive mixture, a subspace method to separate the sources is prop...
International audienceFor the convolutive mixture, a subspace method to separate the sources is prop...
International audienceFor the convolutive mixture, a subspace method to separate the sources is prop...
Most source separation algorithms are based on a model of stationary sources. However, it is a simpl...
International audienceFor the convolutive mixture, a subspace method to separate the sources is prop...
Given a linear and instantaneous mixture model, we prove that for blind source separation (BSS) algo...
We propose an algorithm for blind separation of sources in convolutive mixtures based on a subspace ...
This paper considers the problem of blindly separating sub- and super-Gaussian sources from underdet...
In the basic signal model of blind source separation (BSS), an unknown linear mixing process is assu...
Abstract—Blind system identification and subspace tracking represent two important classes of signal...
We analyze blind separation of independent sources in the face of additive noise. The analysis is ca...
This paper deals with the problem of blind identification and source separation which consists of es...
International audienceFor the convolutive mixture, a subspace method to separate the sources is prop...
International audienceFor the convolutive mixture, a subspace method to separate the sources is prop...
International audienceFor the convolutive mixture, a subspace method to separate the sources is prop...
International audienceFor the convolutive mixture, a subspace method to separate the sources is prop...
International audienceFor the convolutive mixture, a subspace method to separate the sources is prop...
International audienceFor the convolutive mixture, a subspace method to separate the sources is prop...
Most source separation algorithms are based on a model of stationary sources. However, it is a simpl...
International audienceFor the convolutive mixture, a subspace method to separate the sources is prop...