Sciweavers

1582 search results - page 78 / 317
» On sparse signal representations
Sort
View
IJON
2002
128views more  IJON 2002»
15 years 5 months ago
Extraction of a source from multichannel data using sparse decomposition
It was discovered recently that sparse decomposition by signal dictionaries results in dramatic improvement of the qualities of blind source separation. We exploit sparse decompos...
Michael Zibulevsky, Yehoshua Y. Zeevi
CORR
2011
Springer
148views Education» more  CORR 2011»
15 years 1 months ago
How well can we estimate a sparse vector?
The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on t...
Emmanuel J. Candès, Mark A. Davenport
CORR
2008
Springer
186views Education» more  CORR 2008»
15 years 6 months ago
Greedy Signal Recovery Review
The two major approaches to sparse recovery are L1-minimization and greedy methods. Recently, Needell and Vershynin developed Regularized Orthogonal Matching Pursuit (ROMP) that ha...
Deanna Needell, Joel A. Tropp, Roman Vershynin
ISBI
2011
IEEE
14 years 9 months ago
Sparse Riemannian manifold clustering for HARDI segmentation
We address the problem of segmenting high angular resolution diffusion images of the brain into cerebral regions corresponding to distinct white matter fiber bundles. We cast thi...
Hasan Ertan Çetingül, René Vida...
ICASSP
2011
IEEE
14 years 9 months ago
Lorentzian based iterative hard thresholding for compressed sensing
In this paper we propose a robust iterative hard thresolding (IHT) algorithm for reconstructing sparse signals in the presence of impulsive noise. To address this problem, we use ...
Rafael E. Carrillo, Kenneth E. Barner