2009

Quantized Compressive Sensing

Dai, Wei, Pham, Hoa Vinh, Milenkovic, Olgica

Understand

We study the average distortion introduced by scalar, vector, and entropy coded quantization of compressive sensing (CS) measurements.

The asymptotic behavior of the underlying quantization schemes is either quantified exactly or characterized via bounds.
We adapt two benchmark CS reconstruction algorithms to accommodate quantization errors, and empirically demonstrate that these methods significantly reduce the reconstruction distortion when compared to standard CS techniques.

PhD thesis, Stanford University, Stanford, CA, 1964
P. Zador, Development and evaluation of procedures for quantizing multivariate distributions · 1964
Earlier work this paper cites.
S. Lloyd, “Least squares quantization in pcm,” Information Theory, IEEE Transactions on
1982
Earlier work this paper cites.
Prentice Hall, 3 edition ed., 1988
Original
H. Royden, Real Analysis · 1988
Earlier work this paper cites.
John Wiley & Sons, 1st edition ed., 1991
T. M. Cover and J. A. Thomas, Elements of Information Theory · 1991
Earlier work this paper cites.
SIAM, 1994
I. E. Nesterov, A. Nemirovskii, and Y. Nesterov, Interior-Point Polynomial Algorithms in Convex Programming · 1994
Earlier work this paper cites.
D. Hui and D. Neuhoff, “Asymptotic analysis of optimal fixed-rate uniform scalar quantization,” IEEE Trans. Inform. Theory
2001
Earlier work this paper cites.
E. Candès and T. Tao, “Decoding by linear programming,” Information Theory, IEEE Transactions on
2005
Earlier work this paper cites.

E. Candès, M. Rudelson, T. Tao, and R. Vershynin, “Error correction via linear programming,” in IEEE Symposium on Foundations of Computer Science (FOCS)
2005
Cited alongside, same era.
Morgan Kaufmann, 3rd edition ed., 2005
K. Sayood, Introduction to Data Compression · 2005
Cited alongside, same era.
D. Donoho, “Compressed sensing,” IEEE Trans. Inform. Theory
2006
Cited alongside, same era.
E. J. Candès and T. Tao, “Near-optimal signal recovery from random projections: Universal encoding strategies?,” IEEE Trans. Inform. Theory
2006
Cited alongside, same era.
E. J. Candès, J. K. Romberg, and T. Tao, “Stable signal recovery from incomplete and inaccurate measurements,” Comm. Pure Appl. Math
2006
Cited alongside, same era.
E. Candès and J. Romberg, “Encoding the ℓ p \ell_{p} ball from limited measurements,” Data Compression Conference
2006
Cited alongside, same era.
M. Akcakaya and V. Tarokh, “On sparsity, redundancy and quality of frame representations,” pp. 951–955, June 2007
2007
Cited alongside, same era.

W. Dai and O. Milenkovic, “Subspace pursuit for compressive sensing signal reconstruction,” IEEE Trans. Inform. Theory
2008
Later among the works it cites.
D. Needell and J. A. Tropp, “CoSaMP: Iterative signal recovery from incomplete and inaccurate samples,” Appl. Comp. Harmonic Anal
2008
Later among the works it cites.
P. Boufounos and R. Baraniuk, “Quantization of sparse representations,” Preprint
2008
Later among the works it cites.
P. Boufounos and R. G. Baraniuk, “1-bit compressive sensing,” in Conf. on Info. Sciences and Systems (CISS)
2008
Later among the works it cites.
V. Goyal, A. Fletcher, and S. Rangan, “Compressive sampling and lossy compression,” IEEE Signal Processing Magazine
2008
Later among the works it cites.
E. Ardestanizadeh, M. Cheraghchi, and A. Shokrollahi, “Bit precision analysis for compressed sensing,” Preprint
2009
Closest in time.

alphaXiv searches the wider corpus for related work and actual follow-ups.

alphaXiv is searching for related work…

Reading the bibliography…