skip to main content
10.1145/2093698.2093844acmotherconferencesArticle/Chapter ViewAbstractPublication PagesisabelConference Proceedingsconference-collections
research-article

On iterative compressed sensing reconstruction of sparse non-negative vectors

Authors Info & Claims
Published:26 October 2011Publication History

ABSTRACT

We consider the iterative reconstruction of the Compressed Sensing (CS) problem over reals. The iterative reconstruction allows interpretation as a channel-coding problem, and it guarantees perfect reconstruction for properly chosen measurement matrices and sufficiently sparse error vectors. In this paper, we give a summary on reconstruction algorithms for compressed sensing and examine how the iterative reconstruction performs on quasi-cyclic low-density parity check (QC-LDPC) measurement matrices.

References

  1. D. Donoho, "For most large underdetermined systems of linear equations, the minimal l1 norm solution is also the sparsest solution," Comm. on Pure and Applied Math., vol. 59, no. 6, pp. 797--829, June 2006.Google ScholarGoogle ScholarCross RefCross Ref
  2. B. K. Natarajan, "Sparse approximate solutions to linear systems," SIAM J. COmput., vol. 24, pp. 227--234, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM Journal on Scientific Computing, vol. 20, no. 1, pp. 33--61, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. E. J. Candes and T. Tao, "Decoding by linear programming," IEEE Trans. Inform. Theory, vol. 51, no. 12, pp. 4203--4215, Dec. 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. J. Pearl, Probablisitic Reasoning in Intelligent Systems. San Francisco, CA: Kaufmann, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: M. I. T. Press, 1963.Google ScholarGoogle Scholar
  7. S. Sarvotham, D. Baron, and R. G. Baraniuk, "Compressed sensing reconstruction via belief propagation," Tech. Rep., 2006.Google ScholarGoogle Scholar
  8. S. Sarvotham, D. Baron, and R. G. Baraniuk, "Sudo-codes fast measurement and reconstruction of sparse signals," Proc. IEEE Int. Symp. Inf. Theory, July 2006.Google ScholarGoogle Scholar
  9. D. L. Donoho, A. Maleki, and A. Montanari, "Message passing algorithms for compressed sensing," CoRR, vol. abs/0907.3574, 2009.Google ScholarGoogle Scholar
  10. H. V. Pham, W. Dai, and O. Milenkovic, "Sublinear compressive sensing reconstruction via belief propagation decoding," in Proc. IEEE Int. Symposium on Information Theory (ISIT '09), 2009, pp. 674--678. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. V. Chandar, D. Shah, and G. Wornell, "A simple message-passing algorithm for compressed sensing," in Proc. IEEE International Symposium on Information Theory (ISIT 2010), June 2010, pp. 1968--1972.Google ScholarGoogle ScholarCross RefCross Ref
  12. A. R. Krishnan, S. Sankararaman, and B. Vasic, "Graph-based iterative reconstruction of sparse signals for compressed sensing," Proc of TELSIKS Conference, Oct. 2011, Nis, Serbia.Google ScholarGoogle Scholar
  13. F. Zhang and H. Pfister, "Compressed sensing and linear codes over real numbers," in Inf. Theory and Applications. Workshop, Feb. 2008, pp. 558--561.Google ScholarGoogle Scholar
  14. M. Sipser and D. Spielman, "Expander codes," IEEE Trans. Inform. Theory, vol. 42, no. 6, pp. 1710--1722, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. F. Zhang and H. D. Pfister, "On the iterative decoding of high-rate ldpc codes with applications in compressed sensing," CoRR, vol. abs/0903.2232, 2009.Google ScholarGoogle Scholar
  16. J. Tropp and S. Wright, "Computational methods for sparse solution of linear inverse problems," Proceedings of the IEEE, vol. 98, no. 6, pp. 948--958, June 2010.Google ScholarGoogle ScholarCross RefCross Ref
  17. A. G. Dimakis and P. Vontobel, "Lp decoding meets lp decoding: a connection between channel coding and compressed sensing," in Proc. 47th Allerton Conference on Communications, Control, and Computing, Monticello, Illinois, USA, Sep. 30--Oct.2 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. J. Feldman, M. Wainwright, and D. Karger, "Using linear programming to decode binary linear codes," IEEE Trans. Inform. Theory, vol. 51, no. 3, pp. 954--972, March 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. A. G. Dimakis, R. Smarandache, and P. O. Vontobel, "Ldpc codes for compressed sensing," CoRR, vol. abs/1012.0602, 2010.Google ScholarGoogle Scholar

Index Terms

  1. On iterative compressed sensing reconstruction of sparse non-negative vectors

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Other conferences
            ISABEL '11: Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies
            October 2011
            949 pages
            ISBN:9781450309134
            DOI:10.1145/2093698

            Copyright © 2011 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 26 October 2011

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader