Sciweavers

38 search results - page 2 / 8
» Iteratively reweighted algorithms for compressive sensing
Sort
View
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
14 years 8 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
ECCV
2010
Springer
14 years 23 days ago
Reweighted Random Walks for Graph Matching
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...
Minsu Cho (Seoul National University), Jungmin Lee...
ICASSP
2011
IEEE
12 years 11 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
ICASSP
2011
IEEE
12 years 11 months ago
Iterative hard thresholding for compressed sensing with partially known support
Recent works in modified compressed sensing (CS) show that reconstruction of sparse or compressible signals with partially known support yields better results than traditional CS...
Rafael E. Carrillo, Luisa F. Polania, Kenneth E. B...
ICASSP
2009
IEEE
14 years 2 months ago
A simple, efficient and near optimal algorithm for compressed sensing
When sampling signals below the Nyquist rate, efficient and accurate reconstruction is nevertheless possible, whenever the sampling system is well behaved and the signal is well ...
Thomas Blumensath, Mike E. Davies