Skip to main content

Orthogonal Matching Pursuit Based on Tree-Structure Redundant Dictionary

  • Conference paper
Advances in Computer Science, Environment, Ecoinformatics, and Education (CSEE 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 215))

  • 1827 Accesses

Abstract

Tree based Orthogonal matching pursuit is proposed to overcome the convergence of sparse decomposition. Sparse decomposition can be fast solved by tree based matching pursuit, however, the tree based pursuit is locally best in essence, so it convergences very slowly. We propose the orthogonal matching pursuit algorithm that maintains full backward orthogonality of the residual (error) at every step and thereby leads to improved convergence. Also, it guarantees the sparsity of results and exactly of reconstructed image. Speech signal and earthquake signal are tested via Tree based orthogonal matching pursuit separately, both of which have better convergence performance than tree based matching pursuit.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Iventura, R.F., Vandergheynst, P., Frossard, P.: Lowrate and flexible image coding with redundant representations. IEEE Trans. Image Process 15(3), 726–739 (2006)

    Article  Google Scholar 

  2. Neff, R., Zakhor, A.: Matching pursuit video coding, I. Dictionary approximation. IEEE Trans. Circuits Syst. Video Technol. 12(1), 13–26 (2002)

    Article  Google Scholar 

  3. Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM J. Scientific Comput. 20(1), 33–61 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Elad, M., Aharon, M.: Image denoising via sparse and redundant representations over learned dictionaries. IEEE Trans. on Image Processing 15(12), 3736–3745 (2006)

    Article  MathSciNet  Google Scholar 

  5. Zhang, C.: Redundant dictionary based overcomplete signal representation and sparse decomposition. Chinese Science Bulletin 51(6), 628–633 (2006)

    MathSciNet  Google Scholar 

  6. Olshausen, B.A., Field, D.J.: Sparse coding with an overcomplete basis set: A strategy employed by V1. Vision Research 37(23), 3311–3325 (1997)

    Article  Google Scholar 

  7. Mallat, S., Zhang, Z.: Matching pursuit with time-frequency dictionaries. IEEE Trans. Signal Process. 41(12), 3397–3415 (1993)

    Article  MATH  Google Scholar 

  8. Cheung, K.-P., Chan, Y.-H.: A fast two-stage algorithm for realizing matching pursuit. In: Proc. IEEE Int. Confe. Image Processing, vol. 2, pp. 431–434 (October 2001)

    Google Scholar 

  9. Bin, L.: Low Bit-Rate Video Coding Based on Undecimated Wavelet Dictionary. Journal of Software 15(2), 221–228 (2004)

    MathSciNet  Google Scholar 

  10. Chou, Y.-T., Huang, W.-L., Huang, C.-L.: Gain-shape optimized dictionary for matching pursuit video coding. Signal Processing 83(9), 1937–1943 (2003)

    Article  MATH  Google Scholar 

  11. Schmid-Saugeon, P., Zakhor, A.: Dictionary Design for Matching Pursuit and Application to Motion-Compensated Video Coding. IEEE Trans. Circuits Syst. for Video Technology 14(6), 880–886 (2004)

    Article  Google Scholar 

  12. Monaci, G., Jost, P., van der Gheynst, P.: Image Compression with learnt Tree-structured dictionaries. In: Proc of IEEE MMSP, Siena, Italy, pp. 35–38 (2004)

    Google Scholar 

  13. Jost, P., van der Gheynst, P., Frossard, P.: Tree-based Pursuit: Algorithm and Properties. IEEE Trans. on Signal Processing 12(54), 4685–4697 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhao, S., Zhang, Q., Yang, H. (2011). Orthogonal Matching Pursuit Based on Tree-Structure Redundant Dictionary. In: Lin, S., Huang, X. (eds) Advances in Computer Science, Environment, Ecoinformatics, and Education. CSEE 2011. Communications in Computer and Information Science, vol 215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23324-1_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23324-1_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23323-4

  • Online ISBN: 978-3-642-23324-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics