Fetching the paper…
Reading the bibliography…
Recovery of the sparsity pattern (or support) of an unknown sparse vector from a small number of noisy linear measurements is an important problem in compressed sensing.
A. J. Miller, Subset selection in regression . New York, NY: Chapman-Hall, 1990
1990
Earlier work this paper cites.
T. M. Cover and J. A. Thomas, Elements of Information Theory . New York: Wiley, 1991
1991
Earlier work this paper cites.
R. A. DeVore and G. G. Lorentz, Constructive Approximation . New York, NY: Springer Verlag, 1993
1993
Earlier work this paper cites.
R. Zamir and M. Feder, “A generalization of the entropy power inequality with applications,” IEEE Transactions on Information Theory , vol. 39, no. 5, pp. 1723–1728, September 1993
1993
Earlier work this paper cites.
S. S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic decomposition by basis pursuit,” SIAM J. of Sci. Comp. , vol. 20, no. 1, pp. 33–61, 1999
1999
Earlier work this paper cites.
S. Verdú and S. Shamai, “Spectral efficiency of CDMA with random spreading,” IEEE Trans. Inf. Theory , vol. 45, no. 2, pp. 622–640, Mar. 1999
1999
Earlier work this paper cites.
M. Gastpar and Y. Bresler, “On the necessary density for spectrum-blind nonuniform sampling subject to quantization,” in Proc. IEEE Int. Conf. Acoustics, Speech and Signal Processing , Istanbul, Turkey, Jun. 2000, pp. 248–351
2000
Earlier work this paper cites.
C. Weidmann, “Oligoquantization in low-rate lossy source coding,” Ph.D. dissertation, EPFL, Lausanne, Switzerland, Jul. 2000
2000
Earlier work this paper cites.
T. Tanaka, “A statistical-mechanics approach to large-system analysis of cdma multiuser detectors,” IEEE Trans. Inf. Theory , vol. 48, no. 11, pp. 2888–2910, Nov. 2002
2002
Earlier work this paper cites.
R. R. Muller, “Channel capacity and minimum probability of error in large dual antenna array systems with binary modulation,” IEEE Trans. Inf. Theory , vol. 51, no. 11, pp. 2821–2822, Nov. 2003
2003
Earlier work this paper cites.
D. Guo and S. Verdú, “Randomly spread CDMA: Asymptotics via statistical physics,” IEEE Trans. Inf. Theory , vol. 51, no. 6, pp. 1983–2010, Jun. 2005
2005
Earlier work this paper cites.
D. L. Donoho, “Compressed sensing,” IEEE Trans. Inf. Theory , vol. 52, no. 4, pp. 1289–1306, Apr. 2006
2006
Earlier work this paper cites.
E. J. Candès, J. Romberg, and T. Tao, “Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information,” IEEE Trans. Inf. Theory , vol. 52, no. 2, pp. 489–509, Feb. 2006
2006
Cited alongside, same era.
E. J. Candès and T. Tao, “Near optimal signal recovery from random projections: Universal encoding strategies?” IEEE Trans. Inf. Theory , vol. 52, no. 12, pp. 5406–5425, Dec. 2006
2006
Cited alongside, same era.
N. Meinshausen and P. Bühlmann, “High-dimensional graphs and variable selection with the lasso,” Annals of Stat. , vol. 34, pp. 1436–1462, 2006
2006
Cited alongside, same era.
P. Zhao and B. Yu, “On model selection consistency of lasso,” J. of Machine Learning Research , vol. 51, no. 10, pp. 2541–2563, Nov. 2006
2006
Cited alongside, same era.
M. J. Wainwright, “Sharp thresholds for noisy and high-dimensional recovery of sparsity using ℓ 1 \ell_{1} -constrained quadratic programming (lasso),” IEEE Trans. Inf. Theory , vol. 55, no. 5, pp. 2183–2202, May 2009
2009
Later among the works it cites.
——, “Information-theoretic limitations on sparsity recovery in the high-dimensional and noisy setting.” IEEE Trans. Inf. Theory , vol. 55, pp. 5728–5741, Dec. 2009
2009
Later among the works it cites.
A. K. Fletcher, S. Rangan, and V. K. Goyal, “Necessary and sufficient conditions for sparsity pattern recovery,” IEEE Trans. Inf. Theory , vol. 55, no. 12, pp. 5758–5772, Dec. 2009
2009
Later among the works it cites.
Y. Kabashima, T. Wadayama, and T. Tanaka, “A typical reconstruction limit of compressed sensing based on lp norm minimization,” J. Stat. Mech. , 2009
2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2006
Cited alongside, same era.
S. Sarvotham, D. Baron, and R. G. Baraniuk, “Measurements vs. bits: Compressed sensing meets information theory,” in Proc. Allerton Conf. on Comm., Control, and Computing , Monticello, IL, Sep. 2006
2006
Cited alongside, same era.
E. J. Candès, J. Romberg, and T. Tao, “Stable signal recovery from incomplete and inaccurate measurements,” Comm. on Pure and Applied Math. , vol. 59, pp. 1207–1223, Feb. 2006
2006
Cited alongside, same era.
A. K. Fletcher, S. Rangan, and V. K. Goyal, “Rate-distortion bounds for sparse approximation,” in Proc. IEEE Statist. Sig. Process. Workshop , Madison, WI, Aug. 2007, pp. 254–258
2007
Cited alongside, same era.
G. Reeves, “Sparse signal sampling using noisy linear projections,” Department of EECS, UC Berkeley, Tech. Rep. UCB/EECS-2008-3, Jan. 2008
2008
Cited alongside, same era.
G. Reeves and M. Gastpar, “Sampling bounds for sparse support recovery in the presence of noise,” in Proc. IEEE Int. Symp. on Inf. Theory , Toronto, Canada, Jul. 2008
2008
Cited alongside, same era.
——, “Compressive sampling and lossy compression,” IEEE Signal Processing Magazine , vol. 25, no. 2, pp. 48–56, Mar. 2008
2008
Cited alongside, same era.
C. Weidmann and M. Vetterli, “Rate distortion behavior of sparse sources,” Dec. 2008, submitted to IEEE Trans. Inf. Thoery
2008
Cited alongside, same era.
S. Rangan, A. K. Fletcher, and V. K. Goyal, “Asymptotic analysis of map estimation via the replica method and applications to compressed sensing,” in Proc. Neural Information Processing Systems Conf. , vol. 22, Vancouver, CA, Dec. 2009, pp. 1545–1553
2009
Later among the works it cites.
D. Guo, D. Baron, and S. Shamai, “A single-letter characterization of optimal noisy compressed sensing,” in Proc. Allerton Conf. on Comm., Control, and Computing , Monticello, IL, Sep. 2009
2009
Later among the works it cites.
W. Wang, M. J. Wainwright, and K. Ramchandran, “Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices,” IEEE Trans. Inf. Theory , vol. 56, no. 6, pp. 2967–2979, Jun. 2010
2010
Closest in time.
M. Akcakaya and V. Tarokh, “Shannon theoretic limits on noisy compressive sampling,” IEEE Trans. Inf. Theory , vol. 56, no. 1, pp. 492–504, Jan. 2010
2010
Closest in time.
S. Aeron, V. Saligrama, and M. Zhao, “Information theoretic bounds for compressed sensing,” IEEE Trans. Inf. Theory , vol. 56, no. 10, pp. 5111–5130, Oct. 2010
2010
Closest in time.
G. Reeves, “Sparsity pattern recovery in compressed sensing,” Ph.D. dissertation, University of California, Berkeley, 2011
2011
Closest in time.
2011
Closest in time.
——, “The sampling rate-distortion tradeoff for sparsity pattern recovery in compressed sensing,” IEEE Transactions on Information Theory , vol. 58, no. 5, pp. 3065–3092, May 2012
2012
Closest in time.