Fetching the paper…
Reading the bibliography…
Compressive sensing is a signal acquisition framework based on the revelation that a small collection of linear projections of a sparse signal contains enough information for stable recovery.
D. Slepian and J. K. Wolf, “Noiseless coding of correlated information sources,”
1973
Earlier work this paper cites.
New York: Wiley, 1991
T. M. Cover and J. A. Thomas, · 1991
Earlier work this paper cites.
R. A. DeVore, B. Jawerth, and B. J. Lucier, “Image compression through wavelet transform coding,”
1992
Earlier work this paper cites.
J. Shapiro, “Embedded image coding using zerotrees of wavelet coefficients,”
1993
Earlier work this paper cites.
W. Pennebaker and J. Mitchell, “JPEG: Still image data compression standard,”
1993
Earlier work this paper cites.
C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error correcting coding and decoding: Turbo codes,”
1993
Earlier work this paper cites.
Prentice Hall, 1996
D. B. West, · 1996
Earlier work this paper cites.
Z. Xiong, K. Ramchandran, and M. T. Orchard, “Space-frequency quantization for wavelet image coding,”
1997
Earlier work this paper cites.
R. Venkataramani and Y. Bresler, “Further results on spectrum blind sampling of 2D signals,” in
1998
Earlier work this paper cites.
San Diego: Academic Press, 1999
S. Mallat, · 1999
Earlier work this paper cites.
K. Brandenburg, “MP3 and AAC explained,” in
1999
Earlier work this paper cites.
E. Candès and D. Donoho, “Curvelets — A surprisingly effective nonadaptive representation for objects with edges,”
1999
Earlier work this paper cites.
C. Weidmann and M. Vetterli, “Rate-distortion analysis of spike processes,” in
1999
Earlier work this paper cites.
G. J. Pottie and W. J. Kaiser, “Wireless integrated network sensors,”
2000
Earlier work this paper cites.
R. Wagner, R. G. Baraniuk, and R. D. Nowak, “Distributed image compression for sensor networks using correspondence analysis and super-resolution,” in
2000
Earlier work this paper cites.
Kluwer, 2001
D. S. Taubman and M. W. Marcellin, · 2001
Earlier work this paper cites.
T. Uyematsu, “Universal coding for correlated sources with memory,” in
2001
Earlier work this paper cites.
D. Estrin, D. Culler, K. Pister, and G. Sukhatme, “Connecting the physical world with pervasive networks,”
2002
Earlier work this paper cites.
R. Puri and K. Ramchandran, “PRISM: A new robust video coding architecture based on distributed compression principles,” in
2002
Earlier work this paper cites.
S. Pradhan and K. Ramchandran, “Distributed source coding using syndromes (DISCUS): Design and construction,”
2003
Earlier work this paper cites.
J. Garcia-Frias and W. Zhong, “LDPC codes for compression of multi-terminal sources with hidden Markov correlation,”
2003
Earlier work this paper cites.
Z. Xiong, A. Liveris, and S. Cheng, “Distributed source coding for sensor networks,”
2004
Earlier work this paper cites.
R. Cristescu, B. Beferull-Lozano, and M. Vetterli, “On network correlated data gathering,” in
2004
Earlier work this paper cites.
V. N. Temlyakov, “A remark on simultaneous sparse approximation,”
2004
Earlier work this paper cites.
D. Baron, M. F. Duarte, S. Sarvotham, M. B. Wakin, and R. G. Baraniuk, “An information-theoretic approach to distributed compressed sensing,” in
2005
Cited alongside, same era.
M. F. Duarte, S. Sarvotham, D. Baron, M. B. Wakin, and R. G. Baraniuk, “Distributed compressed sensing of jointly sparse signals,” in
2005
Cited alongside, same era.
M. B. Wakin, S. Sarvotham, M. F. Duarte, D. Baron, and R. G. Baraniuk, “Recovery of jointly sparse signals from few random projections,” in
2005
Cited alongside, same era.
R. Wagner, V. Delouille, H. Choi, and R. G. Baraniuk, “Distributed wavelet transform for irregular sensor network grids,” in
2005
Cited alongside, same era.
A. Ciancio and A. Ortega, “A distributed wavelet compression algorithm for wireless multihop sensor networks using lifting,” in
2005
Cited alongside, same era.
E. Candès, J. Romberg, and T. Tao, “Stable signal recovery from incomplete and inaccurate measurements,”
2006
Later among the works it cites.
J. Tropp and A. C. Gilbert, “Signal recovery from partial information via orthogonal matching pursuit,”
2007
Later among the works it cites.
W. U. Bajwa, J. D. Haupt, A. M. Sayeed, and R. D. Nowak, “Joint source-channel communication for distributed estimation in sensor networks,”
2007
Later among the works it cites.
W. Wang, M. Garofalakis, and K. Ramchandran, “Distributed sparse random projections for refinable approximation,” in
2007
Later among the works it cites.
Preprint
S. Aeron, M. Zhao, and V. Saligrama, “On sensing capacity of sensor networks for the class of linear observation, fixed SNR models,” 2007 · 2007
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
E. Candès, M. Rudelson, T. Tao, and R. Vershynin, “Error correction via linear programming,” in
2005
Cited alongside, same era.
D. Donoho and J. Tanner, “Neighborliness of randomly projected simplices in high dimensions,”
2005
Cited alongside, same era.
J. Tropp, A. C. Gilbert, and M. J. Strauss, “Simulataneous sparse approximation via greedy pursuit,” in
2005
Cited alongside, same era.
S. F. Cotter, B. D. Rao, K. Engan, and K. Kreutz-Delgado, “Sparse solutions to linear inverse problems with multiple measurement vectors,”
2005
Cited alongside, same era.
Available at
S. Sarvotham, M. B. Wakin, D. Baron, M. F. Duarte, and R. G. Baraniuk, “Analysis of the DCS one-stage greedy algoritm for common sparse supports,” Tech. Rep. TREE0503, Rice University, Houston, TX, Oct. 2005 · 2005
Cited alongside, same era.
M. Gastpar, P. L. Dragotti, and M. Vetterli, “The distributed Karhunen-Loeve transform,”
2006
Cited alongside, same era.
E. Candès, J. Romberg, and T. Tao, “Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,”
2006
Cited alongside, same era.
2007
Later among the works it cites.
Preprint
A. Cohen, W. Dahmen, and R. A. DeVore, “Near optimal approximation of arbitrary vectors from highly incomplete measurements,” 2007 · 2007
Later among the works it cites.
Preprint
D. Needell and R. Vershynin, “Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit,” Dec. 2007 · 2007
Later among the works it cites.
Preprint
R. Gribonval, H. Rauhut, K. Schnass, and P. Vandergheynst, “Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms,” 2007 · 2007
Later among the works it cites.
P. T. Boufounos and R. G. Baraniuk, “Quantization of sparse representations,” Technical Report TREE0701, Rice University, Houston, TX, Mar. 2007
2007
Later among the works it cites.
A. K. Fletcher, S. Rangan, and V. K. Goyal, “On the rate-distortion performance of compressed sensing,” in
2007
Later among the works it cites.
M. F. Duarte, S. Sarvotham, D. Baron, M. B. Wakin, and R. G. Baraniuk, “Performance limits for jointly sparse signals via graphical models,” in
2008
Later among the works it cites.
R. G. Baraniuk, M. Davenport, R. A. DeVore, and M. B. Wakin, “A simple proof of the restricted isometry property for random matrices,”
2008
Later among the works it cites.
Preprint
S. Aeron, M. Zhao, and V. Saligrama, “Fundamental limits on sensing capacity for sensor networks and compressed sensing,” 2008 · 2008
Later among the works it cites.
To appear
D. Needell and J. Tropp, “CoSaMP: Iterative signal recovery from incomplete and inaccurate samples,” · 2008
Later among the works it cites.
Preprint
W. Dai and O. Milenkovic, “Subspace pursuit for compressive sensing: Closing the gap between performance and complexity,” Mar. 2008 · 2008
Later among the works it cites.
A. Hormati and M. Vetterli, “Distributed compressed sensing: Sparsity models and reconstruction algorithms using anihilating filter,” in
2008
Later among the works it cites.
Preprint
M. Mishali and Y. Eldar, “Reduce and boost: Recovering arbitrary sets of jointly sparse vectors,” Feb. 2008 · 2008
Later among the works it cites.
M. Fornassier and H. Rauhut, “Recovery algorithms for vector valued data with joint sparsity constrains,”
2008
Later among the works it cites.
Preprint
R. G. Baraniuk, V. Cevher, M. F. Duarte, and C. Hegde, “Model-based compressive sensing,” 2008 · 2008
Later among the works it cites.
P. T. Boufounos and R. G. Baraniuk, “1-bit compressive sensing,” in
2008
Later among the works it cites.
C. Chen, X. Ji, Q. Dai, and X. Liu, “Slepian-Wolf coding of binary finite memory sources using Burrows Wheeler transform,” in
2009
Closest in time.
D. L. Donoho and J. Tanner, “Counting faces of randomly projected polytopes when the projection radically lowers dimension,”
2009
Closest in time.