Sciweavers

21 search results - page 2 / 5
» Super-Resolution With Sparse Mixing Estimators
Sort
View
ICA
2007
Springer
13 years 8 months ago
Estimating the Mixing Matrix in Sparse Component Analysis Based on Converting a Multiple Dominant to a Single Dominant Problem
We propose a new method for estimating the mixing matrix, A, in the linear model x(t) = As(t), t = 1, . . . , T, for the problem of underdetermined Sparse Component Analysis (SCA)....
Nima Noorshams, Massoud Babaie-Zadeh, Christian Ju...
CISS
2008
IEEE
13 years 11 months ago
Information theory based estimator of the number of sources in a sparse linear mixing model
—In this paper we present an Information Theoretic Estimator for the number of sources mutually disjoint in a linear mixing model. The approach follows the Minimum Description Le...
Radu Balan
ICASSP
2010
IEEE
12 years 11 months ago
Modified hierarchical clustering for sparse component analysis
The under-determined blind source separation (BSS) problem is usually solved using the sparse component analysis (SCA) technique. In SCA, the BSS is usually solved in two steps, w...
Nasser Mourad, James P. Reilly
WSOM
2009
Springer
13 years 11 months ago
Approaching the Time Dependent Cocktail Party Problem with Online Sparse Coding Neural Gas
Abstract. We show how the “Online Sparse Coding Neural Gas” algorithm can be applied to a more realistic model of the “Cocktail Party Problem”. We consider a setting where ...
Kai Labusch, Erhardt Barth, Thomas Martinetz
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 5 months ago
Estimation with Random Linear Mixing, Belief Propagation and Compressed Sensing
Abstract--We apply Guo and Wang's relaxed belief propagation (BP) method to the estimation of a random vector from linear measurements followed by a componentwise probabilisti...
Sundeep Rangan