pith. sign in

arxiv: 1512.09184 · v1 · pith:CNRSFFGCnew · submitted 2015-12-30 · 💻 cs.IT · math.IT· math.NA

Methods for Quantized Compressed Sensing

classification 💻 cs.IT math.ITmath.NA
keywords quantizedcompressedgreedysensingalgorithmscompareperformancepursuit
0
0 comments X
read the original abstract

In this paper, we compare and catalog the performance of various greedy quantized compressed sensing algorithms that reconstruct sparse signals from quantized compressed measurements. We also introduce two new greedy approaches for reconstruction: Quantized Compressed Sampling Matching Pursuit (QCoSaMP) and Adaptive Outlier Pursuit for Quantized Iterative Hard Thresholding (AOP-QIHT). We compare the performance of greedy quantized compressed sensing algorithms for a given bit-depth, sparsity, and noise level.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.