Sciweavers

142 search results - page 19 / 29
» Recovery of Sparsely Corrupted Signals
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Estimating Sparse MIMO channels having Common Support
We propose an algorithm (SCS-FRI) to estimate multipath channels with Sparse Common Support (SCS) based on Finite Rate of Innovation (FRI) sampling. In this setup, theoretical low...
Yann Barbotin, Ali Hormati, Sundeep Rangan, Martin...
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
13 years 2 months ago
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
A. Rakotomamonjy
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 3 months ago
Compressive Principal Component Pursuit
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
John Wright, Arvind Ganesh, Kerui Min, Yi Ma
ICASSP
2011
IEEE
12 years 11 months ago
Linear time decoding of real-field codes over high error rate channels
This paper proposes a novel algorithm for decoding real-field codes over erroneous channels, where the encoded message is corrupted by sparse errors, i.e., impulsive noise. The m...
Zaixing He, Takahiro Ogawa, Miki Haseyama
CORR
2007
Springer
183views Education» more  CORR 2007»
13 years 7 months ago
Compressed Sensing and Redundant Dictionaries
This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, whic...
Holger Rauhut, Karin Schnass, Pierre Vandergheynst