On the reconstruction of block-sparse signals with an optimal number of measurements

IEEE Transactions on Signal Processing

Volumn 57, Issue 8, 2009, Pages 3075-3085

  Stojnic, Mihailo ^a   Parvaresh, Farzad ^b   Hassibi, Babak ^c  

^a SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c California Institute of Technology   (United States)

Author keywords

Block sparse signals; Compressed sensing; Semi definite programming

Indexed keywords

BLOCK-SPARSE SIGNALS; COMPRESSED SENSING; EXHAUSTIVE SEARCH; EXPONENTIAL TIME COMPLEXITY; GAUSSIANS; OPTIMAL NUMBER; POLYNOMIAL-TIME; SEMI-DEFINITE PROGRAMMING; SPARSE SIGNALS; SYSTEM OF EQUATIONS; ZERO VECTORS;

POLYNOMIAL APPROXIMATION; SIGNAL RECONSTRUCTION; VECTORS;

OPTIMIZATION;

EID: 68249141421     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2009.2020754     Document Type: Article

References (53)

1. M. Akçakaya and V. Tarokh, "A frame construction and a universal distortion bound for sparse representations," IEEE Trans. Signal Process., vol. 56, no. 6, pp. 2443-2450, Jun. 2008.
2. F. Alizadeh and D. Goldfarb, "Second-order cone programming," Math. Program., no. 95, pp. 3-51, 2003.
3. R. Baraniuk, V. Cevher,M. Duarte, and C. Hegde, Model-Based Compressive Sensing [Online]. Available: http://www.dsp.ece.rice.edu/cs/
4. R. Baraniuk, M. Davenport, R. DeVore, and M.Wakin, "A simple proof of the restricted isometry property for random matrices," Construct. Approx. [Online].Available: http://www.dsp.ece.rice.edu/cs, to be published
5. I. Barany and N. Simanyi, "A note on the size of the largest ball inside a convex polytope," Periodica Mathematica Hungarica, vol. 51, no. 2, pp. 15-18, 2005.
6. K. Boroczky, Jr. and G. Wintsche, S. Basu, Ed., "Covering the sphere by equal spherical balls," Discrete and Computational Geometry: The Goodman-Pollach Festschrift, pp. 237-253, 2003.
7. E. Candes, "Compressive sampling," in Proc. Int. Congr. Mathematics Madrid, Spain, 2006, vol. 3, pp. 1433-1452.
8. 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.
9. E. J. Candés, M. Rudelson, T. Tao, and R. Vershynin, "Error correction via linear programming," in Proc. 46th Annu. IEEE Symp. Foundations Computer Science (FOCS), pp. 295-308.
10. E. Candes and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005.
11. J. Chen and X. Huo, "Theoretical results on sparse representations of multiple-measurement vectors," IEEE Trans. Signal Process., vol. 54, no. 12, pp. 4634-4643, Dec. 2006.
12. G. Cormode and S. Muthukrishnan, "Combinatorial algorithms for compressed sensing," in Proc. 13th Colloquium on Structural Information and Communication Complexity (SIROCCO), Chester, U.K., Jul. 3-5, 2006, pp. 280-294.
13. S. Cotter and B. Rao, "Sparse channel estimation via matching pursuit with application to equalization," IEEE Trans. Comm., vol. 50, no. 3, pp. 374-377, Mar. 2002.
14. S. Cotter, B. Rao, K. Engan, and K. Kreutz-Delgado, "Sparse solutions to linear inverse problems with multiple measurement vectors," IEEE Trans. Signal Process., vol. 53, no. 7, pp. 2477-2488, Jul. 2005.
15. R. A. DeVore, "Optimal computation," in Proc. Int. Congr. Mathematics, Madrid, Spain, 2006, vol. I.
16. D. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, 2006.
17. D. L. Donoho, "High-dimensional centrally-symmetric polytopes with neighborliness proportional to dimension," Disc. Comput. Geometry Dec. 2005 [Online]. Available: http://www.springerlink. com/content/7253x6471m380t02/
18. D. Donoho and X. Huo, "Uncertainty principles and ideal atomic decompositions," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2845-2862, Nov. 2001.
19. D. Donoho and J. Tanner, "Neighborliness of randomly-projected simplices in high dimensions," Proc. Nat. Acad. Sci., vol. 102, no. 27, pp. 9452-9457, 2005.
20. D. Donoho and J. Tanner, "Sparse nonnegative solutions of underdetermined linear equations by linear programming," Proc. Nat. Acad. Sci., vol. 102, no. 27, pp. 9446-9451, 2005.
21. D. Donoho and J. Tanner, "Thresholds for the recovery of sparse solutions via L1 minimization," in Proc. Conf. Information Sciences Systems, Mar. 2006.
22. I. Dumer,M. S. Pinsker, and V. V. Prelov, "On the thinest coverings of the spheres and ellipsoids," in General Theory of Information Transfer and Combinatorics, ser. Lecture Notes in Computer Science. Berlin, Germany: Springer, 2006, vol. 4123, pp. 883-910.
23. C. Dwork, F. McSherry, and K. Talwar, "The price of privacy and the limits of LP decoding," in Proc. 39th Annu. ACM Symp. Theory Computing (STOC), New York, 2007.
24. Y. C. Eldar and H. Bolcskei, "Block-sparsity: Coherence and efficient recovery," [Online]. Available: Arxiv:0812.0329
25. S. Erickson and C. Sabatti, "Empirical Bayes estimation of a sparse vector of gene expression," Statistical Applications in Genetics and Molecular Biology 2005 [Online]. Available: http:// repositories.cdlib.org/uclastat/papers/2005020102/
26. A. Feuer and A. Nemirovski, "On sparse representation in pairs of bases," IEEE Trans. Inf. Theory, vol. 49, no. 6, pp. 1579-1581, 2003.
27. A. Gilbert, M. Strauss, J. Tropp, and R. Vershynin, "Algorithmic linear dimension reduction in the l1 norm for sparse vectors," in Proc. 44th Annu. Allerton Conf. Communication, Control, Computing, 2006.
28. A. Gilbert, M. Strauss, J. Tropp, and R. Vershynin, "One sketch for all: Fast algorithms for compressed sensing," in Proc. Symp. Theory Computing, 2007.
29. I. F. Gorodnitsky, J. S. George, and B. Rao, "Neuromagnetic source imaging with FOCUSS: A recursive weighted minimum norm algorithm," J. Electroencephalogr. Clin. Neurophysiol., Oct. 1995.
30. I. Gorodnitsky and B. Rao, "Sparse signal reconstruction from limited data using FOCUSS: A re-weighted minimum norm algorithm," IEEE Trans. Signal Process., vol., no. 3, pp. 600-616, Mar. 1997.
31. R. Gribonval and M. Nielsen, "Highly sparse representations from dictionaries are unique and independent of the sparseness measure," Appl. Comput. Harmon. Anal., May 2007.
32. R. Gribonval and M. Nielsen, "On the strong uniqueness of highly sparse expansions from redundant dictionaries," in Proc. Int Conf. Independent Component Analysis (ICA), Sep. 2004.
33. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases," IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3320-3325, Dec. 2003.
34. B. Hassibi and H. Vikalo, "On the sphere decoding algorithm I. Expected complexity," IEEE Trans. Signal Process., vol. 53, no. 8, pp. 2806-2818, Aug. 2005.
35. J. Haupt and R. Nowak, "Signal reconstruction from noisy random projections," IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 4036-4048, Sep. 2006.
36. P. Indyk, "Explicit constructions for compressed sensing of sparse signals," Jul. 2007, manuscript.
37. N. Linial and I. Novik, "How neighborly can a centrally symmetric polytope be?," Discrete Comput. Geom., vol. 36, pp. 273-281, 2006.
38. D. M. Malioutov, M. Cetin, and A. S. Willsky, "Source localization by enforcing sparsity through a Laplacian prior: An SVD-based approach," in Proc. IEEE Workshop on Statistical Signal Processing, Sep. 28-Oct. 1, 2003, pp. 573-576.
39. O. Milenkovic, R. Baraniuk, and T. Simunic-Rosing, "Compressed sensing meets bionformatics: A new DNA microarray architecture," presented at the Information Theory and Applications Workshop, San Diego, CA, 2007.
40. M. Mishali and Y. Eldar, "Reduce and boost: Recovering arbitrary sets of jointly sparse vectors," [Online].Available: http:// www.dsp.ece.rice.edu/cs
41. Compressed Sensing Resources, Rice DSP Group, Rice University, Houston, TX [Online]. Available: http://www.dsp.ece.rice.edu/cs
42. M. Rudelson and R. Vershynin, "Geometric approach to error correcting codes and reconstruction of signals," Int. Math. Res. Notices, vol. 64, pp. 4019-4041, 2005.
43. M. Stojnic, W. Xu, and B. Hassibi, "Compressed sensing - Probabilistic analysis of a null space characterization," in Proc. Int. Conf. Acoustics, Speech, Signal Processing (ICASSP), 2008.
44. N. M. Temme, "Numerical and asymptotic aspects of parabolic cylinder functions," J. Comput. Appl. Math., vol. 121, no. 1-2, pp. 221-246, Sep. 1, 2000.
45. J. Tropp, "Algorithms for simultaneous sparse approximation. Part II: Convex relaxation," Signal Process., Aug. 2005.
46. J. Tropp, A. C. Gilbert, and M. Strauss, "Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit," Signal Process., Aug. 2005.
47. J. Tropp, M. Wakin, M. Duarte, D. Baron, and R. Baraniuk, "Random filters for compressive sampling and reconstruction," presented at the IEEE Int. Conf. Acoustics, Speech, Signal Processing (ICASSP), Toulouse, France, May 2006.
48. A. M. Vershik and P. V. Sporyshev, "Asymptotic behavior of the number of faces of random polyhedra and the neighborliness problem," Selecta Math. Sovietica, vol. 11, no. 2, 1992.
49. H. Vikalo, F. Parvaresh, S. Misra, and B. Hassibi, "Recovering sparse signals using sparse measurement matrices in compressed DNA microarrays," in Proc. Asilomar Conf., Nov. 2007.
50. W. Xu and B. Hassibi, "Efficient compressive sensing with deterministic guarantees using expander graphs," presented at the IEEE Information Theory Workshop, Lake Tahoe, Sep. 2007.
51. M. J. Wainwright, "Sharp thresholds for high-dimensional and noisy recovery of sparsity," presented at the Allerton Conf. Communication, Control, Computing, Monticello, IL, Sep. 2006.
52. A. D. Wyner, "Random packings and coverings of the unit N-sphere," Bell Syst. Tech. J., vol. 46, pp. 2111-2118, 1967.
53. Y. Zhang, When Is Missing Data Recoverable [Online]. Available: http:// www.dsp.ece.rice.edu/cs