Fetching the paper…
Reading the bibliography…
Scalar quantization is the most practical and straightforward approach to signal quantization.
J. Max, “Quantizing for minimum distortion,” IRE Trans. Info. Theory , vol. 6, no. 1, pp. 7–12, 1960
1960
Earlier work this paper cites.
A. N. Kolmogorov and V. M. Tihomirov, “ ε \varepsilon -entropy and ε \varepsilon -capacity of sets in functional space,” Amer. Math. Soc. Transl. (2) , vol. 17, pp. 277–364, 1961
1961
Earlier work this paper cites.
D. Slepian and J. Wolf, “Noiseless coding of correlated information sources,” IEEE Trans. Info. Theory , vol. 19, no. 4, pp. 471–480, 1973
1973
Earlier work this paper cites.
A. Wyner and J. Ziv, “The rate-distortion function for source coding with side information at the decoder,” IEEE Trans. Info. Theory , vol. 22, no. 1, pp. 1–10, jan. 1976
1976
Earlier work this paper cites.
S. Lloyd, “Least squares quantization in PCM,” IEEE Trans. Info. Theory , vol. 28, no. 2, pp. 129 – 137, Mar. 1982
1982
Earlier work this paper cites.
W. Johnson and J. Lindenstrauss, “Extensions of Lipschitz mappings into a Hilbert space, Conference in modern analysis and probability (New Haven, Conn., 1982),” Contemp. Math , vol. 26, pp. 189–206, 1984
1984
Earlier work this paper cites.
N. Thao and M. Vetterli, “Reduction of the MSE in R-times oversampled A/D conversion O ( 1 / R ) O(1/R) to O ( 1 / R 2 ) O(1/R^{2}) ,” IEEE Trans. Signal Processing , vol. 42, no. 1, pp. 200–203, Jan 1994
1994
Earlier work this paper cites.
N. T. Thao and M. Vetterli, “Lower bound on the mean-squared error in oversampled quantization of periodic signals using vector quantization analysis,” IEEE Trans. Info. Theory , vol. 42, no. 2, pp. 469–479, Mar. 1996
1996
Earlier work this paper cites.
N. T. Thao, “Vector quantization analysis of Σ Δ \Sigma\Delta modulation,” IEEE Trans. Signal Processing , vol. 44, no. 4, pp. 808–817, Apr. 1996
1996
Earlier work this paper cites.
Z. Cvetkovic and M. Vetterli, “Overcomplete expansions and robustness,” in Proceedings of the IEEE-SP International Symposium on Time-Frequency and Time-Scale Analysis, 1996. , Jun. 1996, pp. 325–328
1996
Earlier work this paper cites.
V. K. Goyal, M. Vetterli, and N. T. Thao, “Quantized overcomplete expansions in ℝ N \mathbb{R}^{N} : Analysis, synthesis, and algorithms,” IEEE Trans. Info. Theory , vol. 44, no. 1, pp. 16–31, Jan. 1998
1998
Earlier work this paper cites.
S. Dasgupta and A. Gupta, “An elementary proof of the Johnson-Lindenstrauss lemma,” Tech. Report 99-006, U.C. Berkeley , Mar. 1999
1999
Earlier work this paper cites.
V. Goyal, “Multiple description coding: Compression meets the network,” IEEE Signal Processing Mag. , vol. 18, no. 5, 2001
2001
Earlier work this paper cites.
V. K. Goyal, J. Kovačević, and J. A. Kelner, “Quantized frame expansions with erasures,” Applied and Computational Harmonic Analysis , vol. 10, pp. 203–233, 2001
2001
Earlier work this paper cites.
O. Christensen, An Introduction to Frames and Riesz Bases . Boston, MA: Birkhäuser, 2002
2002
Earlier work this paper cites.
A. R. Calderbank and I. Daubechies, “The pros and cons of democracy,” IEEE Trans. Info. Theory , vol. 48, no. 6, 2002
2002
Earlier work this paper cites.
C. S. Gunturk, “One-bit sigma-delta quantization with exponential accuracy,” Comm. Pure and Applied Math. , vol. 56, no. 11, pp. 1608–1630, 2003
2003
Earlier work this paper cites.
E. Candès and T. Tao, “Decoding by linear programming,” IEEE Trans. Info. Theory , vol. 51, no. 12, pp. 4203–4215, Dec. 2005
2005
Earlier work this paper cites.
M. Püschel and J. Kovačević, “Real, tight frames with maximal robustness to erasures,” in Prococeedings Data Compression Conference (DCC) 2005 . Snowbird, UT: IEEE, Mar. 2005, pp. 63–72
2005
Earlier work this paper cites.
P. Boufounos, “Quantization and erasures in frame representations,” Ph.D. dissertation, MIT EECS, Cambridge, MA, Jan. 2006
2006
Cited alongside, same era.
J. J. Benedetto, A. M. Powell, and O. Yilmaz, “Sigma-Delta quantization and finite frames,” IEEE Trans. Info. Theory , vol. 52, no. 5, pp. 1990–2005, May 2006
2006
Cited alongside, same era.
P. Boufounos and A. V. Oppenheim, “Quantization noise shaping on arbitrary frame expansions,” EURASIP Journal on Applied Signal Processing, Special issue on Frames and Overcomplete Representations in Signal Processing, Communications, and Information Theory , vol. 2006, pp. Article ID 53 807, 12 pages, DOI:10.1155/ASP/2006/53 807, 2006
2006
Cited alongside, same era.
P. Boufounos, “Quantization and erasures in frame representations,” D.Sc. Thesis, MIT EECS, Cambridge, MA, Jan. 2006
2006
Cited alongside, same era.
J. Laska, P. Boufounos, and R. Baraniuk, “Finite-range scalar quantization for compressive sensing,” in Proc. Sampling Theory and Applications (SampTA) , Marseille, France, May 2009
2009
Later among the works it cites.
W. Dai, H. Pham, and O. Milenkovic, “Distortion-rate functions for quantized compressive sensing,” Preprint , 2009
2009
Later among the works it cites.
P. Boufounos, “Greedy sparse signal reconstruction from sign measurements,” Nov. 2009, pp. 1305 –1309
2009
Later among the works it cites.
T. Blumensath and M. Davies, “Sampling theorems for signals from the union of finite-dimensional linear subspaces,” IEEE Trans. Info. Theory , vol. 55, no. 4, pp. 1872–1882, 2009
2009
Later among the works it cites.
Y. Eldar and M. Mishali, “Robust recovery of signals from a structured union of subspaces,” IEEE Trans. Info. Theory , vol. 55, no. 11, pp. 5302–5316, 2009
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
E. J. Candès, “Compressive sampling,” in Proc. International Congress of Mathematicians , vol. 3, Madrid, Spain, 2006, pp. 1433–1452
2006
Cited alongside, same era.
E. J. Candès and T. Tao, “Near optimal signal recovery from random projections: Universal encoding strategies?” IEEE Trans. Info. Theory , vol. 52, no. 12, pp. 5406–5425, Dec. 2006
2006
Cited alongside, same era.
E. Candès, J. Romberg, and T. Tao, “Stable Signal Recovery from Incomplete and Inaccurate Measurements,” Comm. Pure and Applied Math. , vol. 59, no. 8, pp. 1207–1223, Aug. 2006
2006
Cited alongside, same era.
E. J. Candès, J. Romberg, and T. Tao, “Robust Uncertainty Principles: Exact Signal Reconstruction from Highly Incomplete Frequency Information,” IEEE Trans. Info. Theory , vol. 52, no. 2, pp. 489–509, Feb. 2006
2006
Cited alongside, same era.
D. Donoho, “Compressed sensing,” IEEE Trans. Info. Theory , vol. 52, no. 4, pp. 1289–1306, Sept. 2006
2006
Cited alongside, same era.
R. J. Pai, “Nonadaptive lossy encoding of sparse signals,” M.Eng. Thesis, MIT EECS, Cambridge, MA, August 2006
2006
Cited alongside, same era.
Z. Cvetkovic, I. Daubechies, and B. Logan, “Single-bit oversampled A/D conversion with exponential accuracy in the bit rate,” IEEE Trans. Info. Theory , vol. 53, no. 11, pp. 3979 –3989, nov. 2007
2007
Cited alongside, same era.
P. Boufounos and R. Baraniuk, “Quantization of sparse representations,” Mar. 2007, pp. 378 –378
2007
Cited alongside, same era.
2009
Later among the works it cites.
R. Baraniuk and M. Wakin, “Random projections of smooth manifolds,” Foundations of Computational Mathematics , vol. 9, no. 1, pp. 51–77, 2009
2009
Later among the works it cites.
2009
Later among the works it cites.
M. Raginsky and S. Lazebnik, “Locality-sensitive binary codes from shift-invariant kernels,” The Neural Information Processing Systems , vol. 22, 2009
2009
Later among the works it cites.
A. Zymnis, S. Boyd, and E. Candès, “Compressed sensing with quantized measurements,” IEEE Signal Processing Letters , vol. 17, no. 2, Feb. 2010
2010
Closest in time.
——, “Reconstruction of sparse signals from distorted randomized measurements,” in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing (ICASSP) , Dallas, TX, March 14-19 2010
2010
Closest in time.
H. Q. Nguyen, V. Goyal, and L. Varshney, “Frame Permutation Quantization,” Applied and Computational Harmonic Analysis (ACHA) , Nov. 2010
2010
Closest in time.
R. Baraniuk, V. Cevher, M. Duarte, and C. Hegde, “Model-based compressive sensing,” IEEE Trans. Info. Theory , vol. 56, no. 4, pp. 1982–2001, 2010
2010
Closest in time.
S. Rane, Y. Wang, P. Boufounos, and A. Vetro, “Wyner-ziv coding of multispectral images for space and airborne platforms,” in Proc. 28th Picture Coding Symposium (PCS) , Nagoya, Japan, Dec. 7-10 2010
2010
Closest in time.
J. Brandt, “Transform coding for fast approximate nearest neighbor search in high dimensions,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2010, pp. 1815–1822
2010
Closest in time.
J. Laska, P. Boufounos, M. Davenport, and R. Baraniuk, “Democracy in action: Quantization, saturation, and compressive sensing,” Appl. Comput. Harmon. Anal. , 2011, to appear
2011
Closest in time.
L. Jacques, D. Hammond, and M. Fadili, “Dequantizing compressed sensing: When oversampling and non-gaussian contraints combine,” IEEE Trans. Inform. Theory , vol. 57, no. 1, pp. 559–571, 2011
2011
Closest in time.
L. Jacques, J. Laska, P. Boufounos, and R. Baraniuk, “Robust 1-bit compressive sensing via binary stable embeddings of sparse vectors,” 2011, preprint
2011
Closest in time.
P. T. Boufounos, “Hierarchical distributed scalar quantization,” in Proc. Int. Conf. Sampling Theory and Applications (SampTA) , Singapore, May 2-6 2011, accepted
2011
Closest in time.