Estimating the mixing matrix in Sparse Component Analysis (SCA) based on partial k-dimensional subspace clustering

Authors:
Farid Movahedi Naini;G. Hosein Mohimani;Massoud Babaie-Zadeh;Christian Jutten
Affiliations:
Electrical Engineering Department, Sharif University of Technology, Tehran, Iran;Electrical Engineering Department, Sharif University of Technology, Tehran, Iran;Electrical Engineering Department, Sharif University of Technology, Tehran, Iran;Laboratory of Images and Signals (CNRS UMR 5083, INPG, UJF), Grenoble, France
Venue:
Neurocomputing
Year:
2008

Citing 8
Cited 4

Probability and statistics

Probability and statistics
A neural net for blind separation of nonstationary signals

Neural Networks
Adaptive Blind Signal and Image Processing: Learning Algorithms and Applications

Adaptive Blind Signal and Image Processing: Learning Algorithms and Applications
Analysis of sparse representation and blind source separation

Neural Computation
Blind Source Separation by Sparse Decomposition in a Signal Dictionary

Neural Computation
Estimating the mixing matrix in sparse component analysis based on converting a multiple dominant to a single dominant problem

ICA'07 Proceedings of the 7th international conference on Independent component analysis and signal separation
-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation

IEEE Transactions on Signal Processing
Sparse component analysis and blind source separation of underdetermined mixtures

IEEE Transactions on Neural Networks

A fast approach for overcomplete sparse decomposition based on smoothed l0 norm

IEEE Transactions on Signal Processing
Fast sparse representation based on smoothed lo norm

ICA'07 Proceedings of the 7th international conference on Independent component analysis and signal separation
Sparse source separation with unknown source number

ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part II
Approximated Cramér-Rao bound for estimating the mixing matrix in the two-sensor noisy Sparse Component Analysis (SCA)

Digital Signal Processing

Quantified Score

Hi-index	0.02

Visualization

Abstract

One of the major problems in underdetermined Sparse Component Analysis (SCA) in the field of (semi) Blind Source Separation (BSS) is the appropriate estimation of the mixing matrix, A, in the linear model X=AS, especially where more than one source is active at each instant of time. Most existing algorithms require the restriction that at each instant (i.e. in each column of the source matrix S), there is at most one single dominant component. Moreover, these algorithms require that the number of sources must be determined in advance. In this paper, we proposed a new algorithm for estimating the matrix A, which does not require the restriction of single dominant source at each instant. Moreover, it is not necessary that the exact number of sources be known a priori.