Fetching the paper…
Reading the bibliography…
We investigate the sparse recovery problem of reconstructing a high-dimensional non-negative sparse vector from lower dimensional linear measurements.
“Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics”, Linear Algebra Appl. 18 (1977), pp. 95138
J.B. Kruskal · 1977
Earlier work this paper cites.
“Perturbation Theory for the Singular Value Decomposition ”, Appeared in SVD and Signal Processing, II, R. J. Vacarro ed., Elsevier, Amsterdam, 1991
G. W. Stewart · 1991
Earlier work this paper cites.
“Expander Codes”, IEEE Transactions on Information Theory, 1996
M. Sipser and D.A. Spielman, · 1996
Earlier work this paper cites.
“On sparse representation in pairs of bases”
A. Feuer and A. Nemirovski · 2003
Earlier work this paper cites.
“Neighborlyness of randomly-projected simplices in high dimensions,”
David Donoho and Jared Tanner · 2005
Earlier work this paper cites.
“Sparse Nonnegative Solution of Underdetermined Linear Equations by Linear Programming”,
David L.Donoho and Jared Tanner · 2005
Earlier work this paper cites.
“Probability and Computing: Randomized Algorithms and Probabilistic Analysis”. Cambridge University Press, 2005
Michael Mitzenmacher, Eli Upfal · 2005
Earlier work this paper cites.
“When is missing data recoverabl”. Rice CAAM Department Technical Report TR05-15, 2005, available online at http://www.dsp.ece.rice.edu/cs/
Y. Zhang · 2005
Earlier work this paper cites.
“High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension,”
David Donoho, · 2006
Earlier work this paper cites.
“Robust Uncertainty Principles: Exact Signal Reconstruction from Highly Incomplete Frequency Information,”
E.Candés, I.Romberg and T.Tao · 2006
Cited alongside, same era.
“How neighborly can a centrally symmetric polytope be?”
N. Linial and I. Novik · 2006
Cited alongside, same era.
“Signal recovery from random measurements via orthogonal matching pursuit”. IEEE Trans. on Information Theory, 53(12) pp. 4655-4666, December 2007
J. Tropp and A. Gilbert, · 2007
Cited alongside, same era.
“A non-negative and sparse enough solution of an underdetermined linear system of equations is unique”, Preprint, 2007
Alfred M. Bruckstein, Michael Elad, and Michael Zibulevsky, · 2007
Cited alongside, same era.
“Efficient compressive sensing with determinstic guarantees using expander graphs”,
Weiyu Xu and Babak Hassibi · 2007
Cited alongside, same era.
“Efficient compressed sensing using high-quality expander graphs”. Preprint, 2008)
Sina Jafarpour, Weiyu Xu, Babak Hassibi, and Robert Calderbank · 2008
Later among the works it cites.
“Compressed sensing over the Grassmann manifold: A unified analytical framework”. Preprint, 2008
Weiyu Xu and Babak Hassibi · 2008
Later among the works it cites.
Explicit constructions for compressed sensing of sparse signals, SODA, 2008
P. Indyk · 2008
Later among the works it cites.
“Recovering sparse signals using sparse measurement matrices in compressed DNA microarrays”
Farzad Parvaresh, Haris Vikalo, Sidhant Misra, and Babak Hassibi · 2008
Later among the works it cites.
“Compressed sensing - probabilistic analysis of a null-space characterization”
Mihailo Stojnic, Weiyu Xu, and Babak Hassibi · 2008
Later among the works it cites.
“Euclidean sections of
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Further Results on Performance Analysis for Compressive Sensing Using Expander Graphs”, Signals, Systems and Computers, 2007. ACSSC 2007. Conference Record of the Forty-First Asilomar Conference on 4-7 Nov. 2007 Page(s):621 - 625
Weiyu Xu and Babak Hassibi · 2007
Cited alongside, same era.
“Combining geometry and combinatorics: a unified approach to sparse signal recovery”, Forty-Sixth Annual Allerton Conference, September 23-26, 2008, University of Illinois at Urbana-Champaign, IL, USA
R. Berinde, A. Gilbert, P. Indyk, H. Karloff, M. Strauss · 2008
Cited alongside, same era.
“Near-Optimal Sparse Recovery in the
P. Indyk and M. Ruzic · 2008
Cited alongside, same era.
“Sparse recovery using sparse matrices”,
R. Berinde and P. Indyk · 2008
Cited alongside, same era.
“The restricted isometry property and its implications for compressed sensing”, Compte Rendus de l’Academie des Sciences, Paris, Serie I, 346 589-592
E. J. Candés
Cited in the paper.
Michael R. Garey and David S. Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness”, W.H. Freeman. ISBN 0-7167-1045-5
Cited in the paper.
V. Guruswami, J.R. Lee, A. Wigderson · 2008
Later among the works it cites.
“Almost Euclidean subspaces of
V. Guruswami, J.R. Lee, A. Razborov · 2008
Later among the works it cites.
“Compressive Sensing DNA Microarrays”, submitted, July 2008, avaialble online at http://www-ece.rice.edu
W. Dai, M. Sheikh, O. Milenkovic, and R. Baraniuk, · 2008
Later among the works it cites.
W. Dai and O. Milenkovic, · 2008
Later among the works it cites.