Lorentzian based iterative hard thresholding for compressed sensing

14 years 2 months ago

Download mirlab.org

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 a Lorentzian cost function instead of the

Rafael E. Carrillo, Kenneth E. Barner

Real-time Traffic

Algorithm | Cost Function | ICASSP 2011 | Signal Processing | Traditional Iht Algorithm |

claim paper

» Iterative hard thresholding for compressed sensing with partially known support

» A simple efficient and near optimal algorithm for compressed sensing

» On the Scaling Law for Compressive Sensing and its Applications

» Iterative Sparse Channel Estimation and Decoding for Underwater MIMOOFDM

» Phase Transitions for Greedy Sparse Approximation Algorithms

» Robust 1Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors

» Unmixing Sparse Hyperspectral Mixtures

» GradientBased Methods for Sparse Recovery

Post Info
More Details (n/a)

Added	20 Aug 2011
Updated	20 Aug 2011
Type	Journal
Year	2011
Where	ICASSP
Authors	Rafael E. Carrillo, Kenneth E. Barner

Comments (0)

Sciweavers

Lorentzian based iterative hard thresholding for compressed sensing

Algorithm | Cost Function | ICASSP 2011 | Signal Processing | Traditional Iht Algorithm |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers