Fetching the paper…
Reading the bibliography…
Quantized compressive sensing (QCS) deals with the problem of coding compressive measurements of low-complexity signals with quantized, finite precision representations, i.e., a mandatory process involved in any practical sensing model.
J. J. Bussgang, “Crosscorrelation functions of amplitude-distorted gaussian signals,” 1952
1952
Earlier work this paper cites.
M. Ledoux and M. Talagrand,
1991
Earlier work this paper cites.
V. Tikhomirov, “
1993
Earlier work this paper cites.
B. K. Natarajan, “Sparse approximate solutions to linear systems,”
1995
Earlier work this paper cites.
R. M. Gray and D. L. Neuhoff, “Quantization,”
1998
Earlier work this paper cites.
G. Pisier,
1999
Earlier work this paper cites.
M. Fazel, “Matrix rank minimization with applications,” Ph.D. dissertation, PhD thesis, Stanford University, 2002
2002
Earlier work this paper cites.
E. J. Candès and T. Tao, “Decoding by linear programming,”
2005
Earlier work this paper cites.
B. Klartag and S. Mendelson, “Empirical processes and random projections,”
2005
Earlier work this paper cites.
J. Dattorro, “Convex Optimization and Euclidean Distance Geometry,”
2005
Earlier work this paper cites.
D. L. Donoho, “Compressed sensing,”
2006
Earlier work this paper cites.
E. J. Candès, J. K. Romberg, and T. Tao, “Stable signal recovery from incomplete and inaccurate measurements,”
2006
Earlier work this paper cites.
R. J. Pai, “Nonadaptive lossy encoding of sparse signals,” Ph.D. dissertation, Massachusetts Institute of Technology, 2006
2006
Earlier work this paper cites.
E. J. Candès and T. Tao, “Near-optimal signal recovery from random projections: Universal encoding strategies?”
2006
Earlier work this paper cites.
J. A. Tropp and A. C. Gilbert, “Signal recovery from random measurements via orthogonal matching pursuit,”
2007
Earlier work this paper cites.
R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin, “A simple proof of the restricted isometry property for random matrices,”
2008
Earlier work this paper cites.
S. Mendelson, A. Pajor, and N. Tomczak-Jaegermann, “Uniform uncertainty principle for Bernoulli and subgaussian ensembles,”
2008
Earlier work this paper cites.
P. T. Boufounos and R. G. Baraniuk, “1-bit compressive sensing,” in
2008
Earlier work this paper cites.
H. Rauhut, K. Schnass, and P. Vandergheynst, “Compressed sensing and redundant dictionaries,”
2008
Earlier work this paper cites.
A. Cohen, W. Dahmen, and R. DeVore, “Compressed sensing and best
2009
Earlier work this paper cites.
T. Blumensath and M. E. Davies, “Iterative hard thresholding for compressed sensing,”
2009
Earlier work this paper cites.
W. Dai, H. V. Pham, and O. Milenkovic, “Distortion-rate functions for quantized compressive sensing,” in
2009
Earlier work this paper cites.
H. Rauhut, “Compressive sensing and structured random matrices,”
2010
Earlier work this paper cites.
J. H. Ender, “On compressive sensing applied to radar,”
2010
Earlier work this paper cites.
R. G. Baraniuk, V. Cevher, M. F. Duarte, and C. Hegde, “Model-based compressive sensing,”
2010
Earlier work this paper cites.
A. Zymnis, S. Boyd, and E. J. Candès, “Compressed Sensing with Quantized Measurements,”
2010
Earlier work this paper cites.
B. Recht, M. Fazel, and P. A. Parrilo, “Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,”
2010
Cited alongside, same era.
H. Q. Nguyen, V. K. Goyal, and L. R. Varshney, “Frame permutation quantization,”
2011
Cited alongside, same era.
E. J. Candès and Y. Plan, “Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements,”
2011
Cited alongside, same era.
S. Foucart, “Hard thresholding pursuit: an algorithm for compressive sensing,”
2011
Cited alongside, same era.
P. T. Boufounos, “Universal rate-efficient scalar quantization,”
2012
Cited alongside, same era.
U. S. Kamilov, V. K. Goyal, and S. Rangan, “Message-passing de-quantization with applications to compressed sensing,”
U. Ayaz, S. Dirksen, and H. Rauhut, “Uniform recovery of fusion frame structured sparse signals,”
2016
Later among the works it cites.
H.-J. M. Shi, M. Case, X. Gu, S. Tu, and D. Needell, “Methods for quantized compressed sensing,” in
2016
Later among the works it cites.
L. Jacques, “Error decay of (almost) consistent signal estimations from quantized Gaussian random projections,”
2016
Later among the works it cites.
Y. Plan and R. Vershynin, “The generalized lasso with non-linear observations,”
2016
Later among the works it cites.
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2012
Cited alongside, same era.
R. E. Carrillo, J. McEwen, and Y. Wiaux, “Sparsity averaging reweighted analysis (sara): a novel algorithm for radio-interferometric imaging,”
2012
Cited alongside, same era.
R. Vershynin,
2012
Cited alongside, same era.
V. Chandrasekaran, B. Recht, P. A. Parrilo, and A. S. Willsky, “The convex geometry of linear inverse problems,”
2012
Cited alongside, same era.
M. Golbabaee and P. Vandergheynst, “Hyperspectral image compressed sensing via low-rank and joint-sparse matrix recovery,” in
2012
Cited alongside, same era.
S. Foucart and H. Rauhut,
2013
Cited alongside, same era.
C. S. Güntürk, M. Lammers, A. M. Powell, R. Saab, and Ö. Yılmaz, “Sobolev duals for random frames and
2013
Cited alongside, same era.
2016
Later among the works it cites.
K. Wei, J.-F. Cai, T. F. Chan, and S. Leung, “Guarantees of Riemannian optimization for low rank matrix recovery,”
2016
Later among the works it cites.
N. Keriven, A. Bourrier, R. Gribonval, and P. Pérez, “Sketching for large-scale learning of mixture models,” in
2016
Later among the works it cites.
A. Moshtaghpour, L. Jacques, V. Cambareri, K. Degraux, and C. De Vleeschouwer, “Consistent basis pursuit for signal and matrix estimates in quantized compressed sensing,”
2016
Later among the works it cites.
H.-J. M. Shi, M. Case, X. Gu, S. Tu, and D. Needell, “Methods for quantized compressed sensing,” in
2016
Later among the works it cites.
2017
Later among the works it cites.
R. G. Baraniuk, S. Foucart, D. Needell, Y. Plan, and M. Wootters, “Exponential decay of reconstruction error from binary measurements of sparse signals,”
2017
Later among the works it cites.
L. Jacques and V. Cambareri, “Time for dithering: fast and quantized random embeddings via the restricted isometry property,”
2017
Later among the works it cites.
B. Adcock, A. C. Hansen, C. Poon, and B. Roman, “Breaking the coherence barrier: A new theory for compressed sensing,”
2017
Later among the works it cites.
2017
Later among the works it cites.
Y. Plan, R. Vershynin, and E. Yudovina, “High-dimensional estimation with geometric constraints,”
2017
Later among the works it cites.
A. Zebadua, “Compressed-domain signal processing and one-bit quantization: two tools for contexts undercommunication constraints,” Theses, Université Grenoble Alpes, Dec. 2017, (in French). [Online]. Available:
2017
Later among the works it cites.
A. G. Zebadua, P.-O. Amblard, E. Moisan, and O. J. Michel, “Compressed and quantized correlation estimators,”
2017
Later among the works it cites.
C. Liaw, A. Mehrabian, Y. Plan, and R. Vershynin, “A simple tool for bounding the deviation of random matrices on geometric sets,”
2017
Later among the works it cites.
P. T. Boufounos, S. Rane, and H. Mansour, “Representation and coding of signal geometry,”
2017
Later among the works it cites.
N. Keriven and R. Gribonval, “Instance Optimal Decoding and the Restricted Isometry Property,”
2018
Closest in time.
2018
Closest in time.
S. Foucart and R. Lynch, “Recovering Low-Rank Matrices from Binary Measurements,”
2018
Closest in time.
2018
Closest in time.