Compressive sampling with generalized polygons

IEEE Transactions on Signal Processing

Volumn 59, Issue 10, 2011, Pages 4759-4766

  Gao, Kanke ^a   Batalama, Stella N ^a   Pados, Dimitris A ^a   Suter, Bruce W ^b  

^a the State University of New York   (United States)

^b AIR FORCE RESEARCH LABORATORY   (United States)

Author keywords

Belief propagation; bipartite graphs; compressed sensing; compressive sampling; finite geometry; generalized polygons; low density parity check codes; Nyquist sampling; sparse signals

Indexed keywords

BELIEF PROPAGATION; BIPARTITE GRAPHS; COMPRESSED SENSING; COMPRESSIVE SAMPLING; FINITE GEOMETRY; GENERALIZED POLYGONS; LOW-DENSITY PARITY-CHECK CODES; NYQUIST SAMPLING; SPARSE SIGNALS;

ALGORITHMS; SIGNAL RECONSTRUCTION;

GEOMETRY;

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

References (30)

1. E. Candes and T. Tao, "Near optimal signal recovery from random projections: Universal encoding strategies?," IEEE Trans. Inf. Theory, vol. 52, pp. 5406-5425, Dec. 2006. (Pubitemid 46445381)
2. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
3. Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition," in Proc. 27th Annu. Asilomar Conf. Signals, Syst., Comput., Pacific Grove, CA, Nov. 1993, pp. 40-44.
4. J. A. Tropp and A. C. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit," IEEE Trans. Inf. Theory, vol. 53, pp. 4655-4666, Dec. 2007.
5. D. L. Donoho, Y. Tsaig, I. Drori, and J. C. Starck, "Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit," Statistics Dept., Stanford Univ., Stanford, CA, Tech. Rep. TR-2006-2, 2006.
6. D. Needell and J. A. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comput. Harmon. Anal., vol. 26, no. 3, pp. 301-321, May 2009.
7. W. Dai and O. Milenkovic, "Subspace pursuit for compressive sensing: Closing the gap between performance and complexity," IEEE Trans. Inf. Theory, vol. 55, pp. 2230-2249, May 2009.
8. T. Blumensath and M. E. Davies, "Iterative hard thresholding for compressed sensing," Appl. Comput. Harmon. Anal., vol. 27, no. 3, pp. 265-274, Nov. 2009.
9. R. A. DeVore, "Deterministic constructions of compressed sensing matrices," J. Complexity, vol. 23, pp. 918-925, Aug. 2007. (Pubitemid 350122965)
10. G. Cormode and S. Muthukrishnan, "Combinatorial algorithms for compressed sensing," Lecture Notes in Comput. Sci., vol. 4056, pp. 280-294, 2006. (Pubitemid 44113053)
11. W. Xu and B. Hassibi, "Efficient compressive sensing with deterministic guarantees using expander graphs," in Proc. IEEE Inf. Theory Workshop, Lake Tahoe, CA, Sep. 2007, pp. 414-419.
12. S. Jafarpour, W. Xu, B. Hassibi, and R. Calderbank, "Efficient and robust compressed sensing using optimized expander graphs," IEEE Trans. Inf. Theory, vol. 55, pp. 4299-4308, Sep. 2009.
13. M. Sipser and D. A. Spielman, "Expander codes," IEEE Trans. Inf. Theory, vol. 42, pp. 1710-1722, Nov. 1996. (Pubitemid 126769170)
14. R. Calderbank, S. Howard, and S. Jafarpour, "Construction of a large class of deterministic sensing matrices that satisfy a statistical isometry property," IEEE J. Sel. Topics Signal Process., vol. 4, pp. 358-374, Apr. 2010.
15. W. U. Bajwa, R. Calderbank, and S. Jafarpour, "Why Gabor frames? two fundamental measures of coherence and their role in model selection," J. Commun. Netw., vol. 12, pp. 289-307, Aug. 2010.
16. J. Tits, "Sur la trialite et certains groupes qui s'en deduisent," Inst. Hautes Etudes Sci. Publ. Math., vol. 2, pp. 14-60, 1959.
17. W. Feit and G. Higman, "The nonexistence of certain generalized polygons," J. Algebra, vol. 1, pp. 114-131, 1964.
18. H. van Maldeghem, Generalized Polygons. Basel, Switzerland: Birkhauser-Verlag, 1998.
19. Z. Liu and D. A. Pados, "LDPC codes from generalized polygons," IEEE Trans. Inf. Theory, vol. 51, pp. 3890-3898, Nov. 2005. (Pubitemid 41622587)
20. D. Baron, S. Sarvotham, and R. Baraniuk, "Bayesian compressive sensing via belief propagation," IEEE Trans. Signal Process., vol. 58, pp. 269-280, Jan. 2010.
21. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
22. F. R. Kschischang, B. J. Frey, and H. A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, pp. 498-519, Feb. 2001. (Pubitemid 32318087)
23. J. Mooij and H. Kappen, "Sufficient conditions for convergence of the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 53, pp. 4422-4437, Dec. 2007.
24. E. Candes, J. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Commun. Pure Appl. Math., vol. 59, pp. 1207-1223, Aug. 2006. (Pubitemid 43988295)
25. R. Tibshirani, "Regression shrinkage and selection via the lasso," J. R. Statist. Soc., vol. 58, pp. 267-288, 1996.
26. T Magic [Online]. Available: http://www.acm.caltech.edu/l1magic
27. LASSO Software [Online]. Available: http://www-stat.stanford. edu/~tibs/lasso.html
28. R. Berinde, P. Indyk, and M. Ruzic, "Practical near-optimal sparse recovery in the L1 norm," in Proc. 46th Allerton Conf. Commun., Control, Comput., Urbana-Champaign, IL, Sep. 2008, pp. 198-205.
29. Sparse Recovery Experiments With Sparse Matrices [Online]. Available: http://groups.csail.mit.edu/toc/sparse/wiki/index.php?title= Sparse-Recovery-Experiments-with-Sparse-Matrices
30. H. V. Maldeghem, "A finite generalized hexagon admitting a group acting transitively on ordered heptagons is classical," J. Combin. Theory, vol. 75, pp. 254-269, Aug. 1996.