[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Compressed Sensing for Sparse Error Correcting Model

  • Published:
Circuits, Systems, and Signal Processing Aims and scope Submit manuscript

Abstract

Compressed sensing (CS)-based cross-and-bouquet (CAB) model was proposed by J. Wright et al. to reduce the complexity of sparse error correcting. For the sake of leading to better performance of CS-based decoding for the CAB model, an algorithm is proposed in this paper for constructing a well-designed projection matrix to minimize the average measures of mutual coherence. One was proposed by M. Elad. Another is defined in this paper for higher dimensional cases. Using the equivalent dictionary, the dimensionality is reduced. Also high-dimensional singular value decomposition (SVD) is avoided in the procedure of constructing a well-designed projection matrix. The high-dimensional CAB model of sparse error correcting can be solved by the proposed algorithm without computational difficulty. The validity of the proposed method is illustrated by decoding experiments in high-dimensional cases.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. S. Boyd, L. Vandenberghe, Convex Optimization (Cambridge Univ. Press, Cambridge, 2004)

    Book  MATH  Google Scholar 

  2. A.M. Bruckstein, D.L. Donoho, M. Elad, From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev. 51(1), 34–81 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. E.J. Candès, T. Tao, Decoding by linear programming. IEEE Trans. Inf. Theory 51(12), 4203–4215 (2005)

    Article  MATH  Google Scholar 

  4. E.J. Candès, M.B. Wakin, An introduction to compressive sampling. IEEE Signal Process. Mag. 25(2), 21–30 (2008)

    Article  Google Scholar 

  5. E.J. Candès, J. Romberg, T. Tao, Robust uncertainty principle: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489–509 (2006)

    Article  MATH  Google Scholar 

  6. S.S. Chen, D.L. Donoho, M.A. Saunders, Atomic decomposition by basis pursuit. SIAM Rev. 43(1), 129–159 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  7. D.L. Donoho, M. Elad, Optimally sparse representation in general (non-orthogonal) dictionaries via L1 minimization. Proc. Natl. Acad. Sci. 100(5), 2197–2202 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  8. D.L. Donoho, Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289–1306 (2006)

    Article  MathSciNet  Google Scholar 

  9. J.M. Duarte-Carvajalino, G. Sapiro, Learning to sense sparse signals: simultaneous sensing matrix and sparsifying dictionary optimization. IEEE Trans. Image Process. 18(7), 1395–1408 (2009)

    Article  MathSciNet  Google Scholar 

  10. M. Elad, Optimized projections for compressed sensing. IEEE Trans. Signal Process. 55(12), 5695–5702 (2007)

    Article  MathSciNet  Google Scholar 

  11. M.A.T. Figueiredo, R.D. Nowak, S.J. Wright, Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems. IEEE J. Sel. Top. Signal Process. 1(4), 586–597 (2007)

    Article  Google Scholar 

  12. J. Kennedy, R. Eberhart, Particle swarm optimization, in Proc. IEEE Int. Conf. Neural Networks, Perth, Australia (1995), pp. 1942–1948

    Chapter  Google Scholar 

  13. S. Naka, T. Genji, T. Yura, Y. Fukuyama, A hybrid particle swarm optimization for distribution state estimation. IEEE Trans. Power Syst. 18(1), 60–68 (2003)

    Article  Google Scholar 

  14. Y. Shi, R. Eberhart, A modified particle swarm optimizer, in Proc.IEEE Int. Conf. Evolutionary Computation, Anchorage, AK (1998), pp. 69–73

    Google Scholar 

  15. J. Wright, Error correction for high-dimensional data via convex optimization. Thesis (2009)

  16. J. Wright, A.Y. Yang, A. Ganesh, S.S. Sastry, Y. Ma, Robust face recognition via sparse representation. IEEE Trans. Pattern Anal. Mach. Intell. 31(2), 210–227 (2009)

    Article  Google Scholar 

  17. SparseLab 2.1-Core [Online]. Available: http://sparselab.stanford.edu/

Download references

Acknowledgements

This work is supported partially by Guangdong Province and National ministry of education IAR projection (Grant No. 2012B091100331) and NSFC-Guangdong union project (Grant: U0835003).

Author information

Authors and Affiliations

  1. School of Electronic and Information Engineering, South China University of Technology, Guangzhou, 510640, China

    Yuli Fu & Qiheng Zhang

  2. School of Automation, Guangdong University of Technology, Guangzhou, 510006, China

    Shengli Xie

Authors
  1. Yuli Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qiheng Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shengli Xie
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuli Fu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fu, Y., Zhang, Q. & Xie, S. Compressed Sensing for Sparse Error Correcting Model. Circuits Syst Signal Process 32, 2371–2383 (2013). https://doi.org/10.1007/s00034-013-9574-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00034-013-9574-7

Keywords

Search

Navigation