Necessary and sufficient conditions for sparsity pattern recovery

IEEE Transactions on Information Theory

Volumn 55, Issue 12, 2009, Pages 5758-5772

  Fletcher, Alyson K ^a   Rangan, Sundeep ^b   Goyal, Vivek K ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Qualcomm Technologies   (United States)

^c USA   (United States)

Author keywords

Compressed sensing; Convex optimization; Lasso; Maximum likelihood (ML) estimation; Orthogonal matching pursuit (OMP); Random matrices; Random projections; Sparse approximation; Subset selection; Thresholding

Indexed keywords

COMPRESSED SENSING; LASSO; ORTHOGONAL MATCHING PURSUIT; RANDOM MATRICES; RANDOM PROJECTIONS; SPARSE APPROXIMATIONS; SUBSET SELECTION; THRESHOLDING;

CONVEX OPTIMIZATION; ESTIMATION; OPTIMIZATION; SIGNAL DETECTION; SIGNAL RECONSTRUCTION; SIGNAL TO NOISE RATIO;

MAXIMUM LIKELIHOOD ESTIMATION;

EID: 70449505052     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2009.2032726     Document Type: Article

References (41)

1. A. Miller, Subset Selection in Regression, ser. Monographs on Statistics and Applied Probability, 2nd ed. New York: Chapman amp Hall/CRC, 2002.
2. A. K. Fletcher, S. Rangan, and V. K. Goyal, "On-Off Random Access Channels: A Compressed Sensing Framework," 2009 [Online]. Available: arXiv:0903.1022v1 [cs.IT]
3. A. K. Fletcher, S. Rangan, and V. K. Goyal, "A sparsity detection framework for on-off random access channels," in Proc. IEEE Int. Symp. Information Th., Seoul, Korea, Jun./Jul. 2009, pp. 169-173.
4. S. G. Mallat and Z. Zhang, "Matching pursuits with time-frequency dictionaries," IEEE Trans. Signal Process., vol.41, no.12, pp. 339-3415, Dec. 1993.
5. B. K. Natarajan, "Sparse approximate solutions to linear systems," SIAM J. Comput., vol.24, no.2, pp. 22-234, Apr. 1995.
6. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comp., vol.20, no.1, pp. 33-61, 1999.
7. R. Tibshirani, "Regression shrinkage and selection via the Lasso," J. Roy. Statist. Soc., Ser. B, vol.58, no.1, pp. 26-288, 1996.
8. D. L. Donoho, M. Elad, and V. N. Temlyakov, "Stable recovery of sparse over complete representations in the presence of noise," IEEE Trans. Inf. Theory, vol.52, no.1, pp. 6-18, Jan. 2006.
9. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol.50, no.10, pp. 2231-2242, Oct. 2004.
10. J. A. Tropp, "Just relax: Convex programming methods for identifying sparse signals in noise," IEEE Trans. Inf. Theory, vol.52, no.3, pp. 1030-1051, Mar. 2006.
11. 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.
12. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol.52, no.4, pp. 1289-1306, Apr. 2006.
13. 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.
14. A. K. Fletcher, S. Rangan, and V. K. Goyal, "Sparse approximation, denoising, and large random frames," in Proc.Wavelets XI, Part of SPIE Optics amp Photonics, San Diego, CA, Jul./Aug. 2005, vol.5914, pp. 172-181.
15. A. K. Fletcher, S. Rangan, V. K. Goyal, and K. Ramchandran, "Denoising by sparse approximation: Error bounds based on rate-distortion theory," EURASIP J. Appl. Signal Process., vol.2006, pp. 1-19, Mar. 2006.
16. D. L. Donoho and J. Tanner, "Counting faces of randomly-projected polytopes when the projection radically lowers dimension," J. Amer. Math. Soc., vol.22, no.1, pp. 1-53, Jan. 2009.
17. M. J.Wainwright, "Sharp Thresholds for High-Dimensional and NoisyRecovery of Sparsity," Dept. Statistics, Univ. Calif., Berkeley, 2006 [Online]. Available: arXiv:math.ST/0605740 v1 30
18. 1-constrained quadratic programming (Lasso)," IEEE Trans. Inf. Theory, vol.55, no.5, pp. 2183-2202, May 2009.
19. E. J. Candès and T. Tao, " The Dantzig selector: Statistical estimation when p is much larger than n; " Ann. Statist., vol.35, no.6, pp. 2313-2351, Dec. 2007.
20. J. Haupt and R. Nowak, "Signal reconstruction from noisy random projections," IEEE Trans. Inf. Theory, vol.52, no.9, pp. 4036-4048, Sep. 2006.
21. S. Sarvotham, D. Baron, and R. G. Baraniuk, "Measurements vs. bits: Compressed sensing meets information theory," in Proc. 44th Ann. Allerton Conf. Communications, Control and Computing, Monticello, IL, Sep. 2006.
22. A. K. Fletcher, S. Rangan, and V. K. Goyal, "Rate-distortion bounds for sparse approximation," in Proc. IEEE Statistical Signal Processing Workshop, Madison, WI, Aug. 2007, pp. 254-258.
23. M. J.Wainwright, "Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting," IEEE Trans. Inf. Theory, vol.55, no.12, pp. 5728-5741, Dec. 2009.
24. V. K. Goyal, A. K. Fletcher, and S. Rangan, "Compressive sampling and lossy compression," IEEE Signal Process. Mag., vol.25, no.2, pp. 48-56, Mar. 2008.
25. G. Reeves, "Sparse Signal Sampling Using Noisy Linear Projections,"Univ. Calif., Berkeley, Dept. Elec. Eng. and Comp. Sci, Tech. Rep. UCB/EECS-2008-3, 2008.
26. M. Akçakaya and V. Tarokh, "Shannon Theoretic Limits on Noisy Compressive Sampling " 2007 [Online]. Available: arXiv:0711.0366v1 [cs.IT]
27. [27] M. Akçakaya and V. Tarokh, "Noisy compressive sampling limits in linear and sublinear regimes," in Proc. Conf. Information Sciences & Systems, Princeton, NJ, Mar. 2008, pp. 1-4.
28. H. Rauhut, K. Schnass, and P. Vandergheynst, "Compressed sensing and redundant dictionaries," IEEE Trans. Inf. Theory, vol.54, no.5, pp. 2210-2219, May 2008.
29. A. K. Fletcher and S. Rangan, "Orthogonal matching pursuit fromnoisy random measurements: A new analysis," in Proc. conf. Neural Information Processing Systems, Vancouver, BC, Canada, Dec. 2009.
30. S. Chen, S. A. Billings, and W. Luo, "Orthogonal least squares methods and their application to non-linear system identification," Int. J. Contr., vol.50, no.5, pp. 1873-1896, Nov. 1989.
31. Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition," in Conf. Rec. 27th Asilomar Conf. Signals, Systems, and Computing, Pacific Grove, CA, Nov. 1993, vol.1, pp. 40-44.
32. G. Davis, S. Mallat, and Z. Zhang, "Adaptive time-frequency decomposition,"Opt. Eng., vol.37, no.7, pp. 2183-2191, Jul. 1994.
33. J. A. Tropp and A. C. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit," IEEE Trans. Inf. Theory, vol.53, no.12, pp. 4655-4666, Dec. 2007.
34. S. Aeron, M. Zhao, and V. Saligrama, "Fundamental Limits on Sensing Capacity for Sensor Networks and Compressed Sensing," 2008 [Online]. Available: arXiv:0804.3439v3 [cs.IT]
35. A. K. Fletcher, S. Rangan, and V. K. Goyal, "Necessary and Sufficient Conditions on Sparsity Pattern Recovery," 2008 [Online]. Available: arXiv:0804.1839v1 [cs.IT]
36. W. Wang, M. J.Wainwright, and K. Ramchandran, "Information-Theoretic Limits on Sparse Signal Recovery: Dense Versus Sparse Measurement Matrices," 2008 [Online]. Available: arXiv:0806.0604v1 [math.ST]
37. M. F. Duarte, S. Sarvotham, D. Baron, W. B. Wakin, and R. G. Baraniuk, "Distributed compressed sensing of jointly sparse signals," in Conf. Rec. Asilomar Conf. Signals, Systems and Computers, Pacific Grove, CA, Oct./Nov. 2005, pp. 153-1541.
38. S. Aeron, M. Zhao, and V. Saligrama, "On Sensing Capacity of SensorNetworks for the Class of Linear Observation, Fixed SNR Models," 2007 [Online]. Available: arXiv:0704.3434v3 [cs.IT]
39. M. Evans, N. Hastings, and J. B. Peacock, Statistical Distributions, 3rd ed. New York: Wiley, 2000.
40. J. Spanier and K. B. Oldham, An Atlas of Functions. Washington: Hemisphere Publishing, 198.
41. A. K. Fletcher, S. Rangan, and V. K. Goyal, "Resolution limits of sparse coding in high dimensions," in Proc. Conf. Neural Information Processing and Systems, D. Koller, D. Schuurmans, Y. Bengio, and L. Bottou, Eds., Vancouver, BC, Canada, Dec. 2008, pp. 449-456.