Fetching the paper…
Reading the bibliography…
The Compressive Sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by reducing the sampling rate required to acquire and stably recover sparse signals.
“Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition,”
T. M. Cover, · 1965
Earlier work this paper cites.
“A new proof of the transposition theorem,”
L. Flatto, · 1970
Earlier work this paper cites.
“Quantization and saturation noise due to analog-to-digital conversion,”
G. Gray and G. Zeoli, · 1971
Earlier work this paper cites.
“Robust regression: Asymptotics, conjectures, and Monte Carlo,”
P. J. Huber, · 1973
Earlier work this paper cites.
Oversampling Delta-Sigma converters
J. C. Candy and G. C. Temes, Eds., · 1992
Earlier work this paper cites.
Continuous univariate distributions, vol. 1
N. Johnson, S. Kotz, and N. Balakrishnan, · 1994
Earlier work this paper cites.
“Sparse approximate solutions to linear systems,”
B. K. Natarajan, · 1995
Earlier work this paper cites.
“Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming,”
M. Goemans and D. Williamson, · 1995
Earlier work this paper cites.
“An overview of Sigma-Delta converters,”
P. M. Aziz, H. V. Sorensen, and J. Van Der Spiegel, · 1996
Earlier work this paper cites.
“Vector quantization analysis of
N. T. Thao, · 1996
Earlier work this paper cites.
“Regression shrinkage and selection via the lasso,”
R. Tibshirani, · 1996
Earlier work this paper cites.
“An elementary introduction to modern convex geometry,”
K. Ball, · 1997
Earlier work this paper cites.
“Atomic decomposition by basis pursuit,”
S. S. Chen, D.L. Donoho, and M.A. Saunders, · 1998
Earlier work this paper cites.
“Quantized overcomplete expansions in
V. K. Goyal, M. Vetterli, and N. Thao, · 1998
Earlier work this paper cites.
“Approximate nearest neighbors: towards removing the curse of dimensionality,”
P. Indyk and R. Motwani, · 1998
Earlier work this paper cites.
“Boosting the margin: a new explanation for the effectiveness of voting methods,”
O. Bartlett, Y. Freund, W. S. Lee, and R. E. Schapire, · 1998
Earlier work this paper cites.
On-line algorithms in machine learning
A. Blum, · 1998
Earlier work this paper cites.
“Analog-to-digital converter survey and analysis,”
R. Walden, · 1999
Earlier work this paper cites.
“One-bit sigma-delta quantization with exponential accuracy,”
C.S. Güntürk, · 2003
Earlier work this paper cites.
“Are loss functions all the same?,”
L. Rosasco, E. De Vito, A. Caponnetto, M. Piana, and A. Verri, · 2004
Earlier work this paper cites.
“Analog-to-digital converters,”
B. Le, T. W. Rondeau, J. H. Reed, and C. W. Bostian, · 2005
Earlier work this paper cites.
“Efficient margin maximizing with boosting,”
G. Ratsch and M. Warmuth, · 2005
Earlier work this paper cites.
“Compressive sampling,”
E. Candès, · 2006
Earlier work this paper cites.
“Compressed sensing,”
D. Donoho, · 2006
Cited alongside, same era.
“Stable signal recovery from incomplete and inaccurate measurements,”
E. Candès, J. Romberg, and T. Tao, · 2006
Cited alongside, same era.
“Random filters for compressive sampling and reconstruction,”
J. Tropp, M. Wakin, M. Duarte, D. Baron, and R. Baraniuk, · 2006
Cited alongside, same era.
Quantization and erasures in frame representations
P. Boufounos, · 2006
Cited alongside, same era.
“Sigma-delta quantization and finite frames,”
J. J. Benedetto, A. M. Powell, and O. Yilmaz, · 2006
Cited alongside, same era.
“Quantization noise shaping on arbitrary frame expansions,”
P. Boufounos and A. V. Oppenheim, · 2006
Cited alongside, same era.
“Quantization for compressed sensing reconstruction,”
J. Sun and V. Goyal, · 2009
Later among the works it cites.
“Greedy sparse signal reconstruction from sign measurements,”
P. Boufounos, · 2009
Later among the works it cites.
“Optimal quantization of random measurements in compressed sensing,”
J. Z. Sun and V. K. Goyal, · 2009
Later among the works it cites.
“Locality-sensitive binary codes from shift-invariant kernels,”
M. Raginsky and S. Lazebnik, · 2009
Later among the works it cites.
The elements of statistical learning
T. Hastie, R. Tibshirani, and J. Friedman, · 2009
Later among the works it cites.
“Beyond Nyquist: Efficient sampling of sparse, bandlimited signals,”
J. Tropp, J. Laska, M. Duarte, J. Romberg, and R. Baraniuk, · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Locality-sensitive hashing scheme based on p-stable distributions,”
A. Andoni, M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni, · 2006
Cited alongside, same era.
“A fixed-point continuation method for
E. T. Hale, W. Yin, and Y. Zhang, · 2007
Cited alongside, same era.
“Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems,”
M. A. T. Figueiredo, R. D. Nowak, and S. J. Wright, · 2007
Cited alongside, same era.
“Quantization of sparse representations,”
P. Boufounos and R. Baraniuk, · 2007
Cited alongside, same era.
“Sigma delta quantization for compressive sensing,”
P. Boufounos and R. Baraniuk, · 2007
Cited alongside, same era.
“Single-pixel imaging via compressive sampling,”
M. Duarte, M. Davenport, D. Takhar, J. Laska, T. Sun, K. Kelly, and R. Baraniuk, · 2008
Cited alongside, same era.
Random observations on random observations: Sparse signal acquisition and processing
M. Davenport, · 2010
Later among the works it cites.
“Compressed sensing with quantized measurements,”
A. Zymnis, S. Boyd, and E. Candès, · 2010
Later among the works it cites.
“Reconstruction of sparse signals from distorted randomized measurements,”
P. Boufounos, · 2010
Later among the works it cites.
“Sobolev duals for random frames and sigma-delta quantization of compressed sensing measurements,”
S. Gunturk, A. Powell, R. Saab, and O. Yülmaz, · 2010
Later among the works it cites.
“Frame permutation quantization,”
H. Q. Nguyen, V.K. Goyal, and L.R. Varshney, · 2010
Later among the works it cites.
“Randomly driven fuzzy key extraction of unclonable images,”
S. Shariati, L. Jacques, F. X. Standaert, B. Macq, M. A. Salhi, and P. Antoine, · 2010
Later among the works it cites.
“Sample complexity for 1-bit compressed sensing and sparse classification,”
A. Gupta, B. Recht, and R. Nowak, · 2010
Later among the works it cites.
“Compressed sensing with nonlinear observations,”
T. Blumensath, · 2010
Later among the works it cites.
“Smoothness, low-noise, and fast rates,”
N. Srebro, K. Sridharan, and A. Tewari, · 2010
Later among the works it cites.
“Dequantizing compressed sensing: When oversampling and non-gaussian contraints combine,”
L. Jacques, D. Hammond, and M. Fadili, · 2011
Closest in time.
“Democracy in action: Quantization, saturation, and compressive sensing,”
J. Laska, P. Boufounos, M. Davenport, and R. Baraniuk, · 2011
Closest in time.
“Trust, but verify: Fast and accurate signal recovery from 1-bit compressive measurements,”
J. Laska, Z. Wen, W. Yin, and R. Baraniuk, · 2011
Closest in time.
“Dimension reduction by random hyperplane tessellations,”
Y. Plan and R. Vershynin, · 2011
Closest in time.
“One-bit compressed sensing by linear programming,”
Y. Plan and R. Vershynin, · 2011
Closest in time.
“Hierarchical distributed scalar quantization,”
P. T. Boufounos, · 2011
Closest in time.
“Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach,”
Y. Plan and R. Vershynin, · 2012
Closest in time.
“Universal rate-efficient scalar quantization,”
P. Boufounos, · 2012
Closest in time.