5 pagesInternational audienceIn this paper, we focus on the mixing matrix estimation which is the first step of Sparse Component Analysis. We propose a novel algorithm based on Expectation- Maximization (EM) algorithm in the case of two-sensor set up. Then, a novel iterative Bayesian clustering is applied to yield better results in estimating the mixing matrix. Also, we compute the Maximum Likelihood (ML) estimates of the elements of the second row of the mixing matrix based on each cluster. The simulations show that the proposed method has better accuracy and less failure than the EM-Laplacian Mixture Model (EM-LMM) method
This thesis concerns several aspects of complex-valued instantaneous mixing matrix estimation. While...
We consider the following sparse representation problem, which is called Sparse Component Analysis: ...
We present the topics and theory of Mixture Models in a context of maximum likelihood and Bayesian i...
In this paper, we focus on the mixing matrix estima-tion which is the rst step of Sparse Component A...
In this paper, we focus on the mixing matrix estima-tion which is the rst step of Sparse Component A...
International audienceIn this letter, we address the theoretical limitations in estimating the mixin...
International audienceOne of the major problems in underdetermined Sparse Component Analysis (SCA) i...
In this paper we propose a new algorithm for identifying mixing (basis) matrix A knowing only sensor...
The method of sparse component analysis in general has two steps: the first step is to identify the ...
The method of sparse component analysis in general has two steps: the first step is to identify the ...
International audienceWe present a Bayesian approach for Sparse Component Analysis (SCA) in the nois...
Classical algorithms for the multiple measurement vector (MMV) problem assume either independent col...
In many practical problems for data mining the data X under consideration (given as (m × N)-matrix) ...
One of the major problems in underdetermined Sparse Com-ponent Analysis (SCA) is the appropriate est...
5 pagesInternational audienceOne of the major problems in underdetermined Sparse Component Analysis ...
This thesis concerns several aspects of complex-valued instantaneous mixing matrix estimation. While...
We consider the following sparse representation problem, which is called Sparse Component Analysis: ...
We present the topics and theory of Mixture Models in a context of maximum likelihood and Bayesian i...
In this paper, we focus on the mixing matrix estima-tion which is the rst step of Sparse Component A...
In this paper, we focus on the mixing matrix estima-tion which is the rst step of Sparse Component A...
International audienceIn this letter, we address the theoretical limitations in estimating the mixin...
International audienceOne of the major problems in underdetermined Sparse Component Analysis (SCA) i...
In this paper we propose a new algorithm for identifying mixing (basis) matrix A knowing only sensor...
The method of sparse component analysis in general has two steps: the first step is to identify the ...
The method of sparse component analysis in general has two steps: the first step is to identify the ...
International audienceWe present a Bayesian approach for Sparse Component Analysis (SCA) in the nois...
Classical algorithms for the multiple measurement vector (MMV) problem assume either independent col...
In many practical problems for data mining the data X under consideration (given as (m × N)-matrix) ...
One of the major problems in underdetermined Sparse Com-ponent Analysis (SCA) is the appropriate est...
5 pagesInternational audienceOne of the major problems in underdetermined Sparse Component Analysis ...
This thesis concerns several aspects of complex-valued instantaneous mixing matrix estimation. While...
We consider the following sparse representation problem, which is called Sparse Component Analysis: ...
We present the topics and theory of Mixture Models in a context of maximum likelihood and Bayesian i...