Skip to main content
SpringerLink
Log in
Book cover

International Conference on Intelligent Computing

ICIC 2010: Advanced Intelligent Computing Theories and Applications pp 246–249Cite as

A New Method Using Table to Sparse Representation in Pairs of Bases with Matching Pursuits

  • Conference paper

  • 1411 Accesses

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

Abstract

Sparse representation via combined transforms means that a signal is sparsely represented by overcomplete dictionary combined by several transforms (or orthogonal bases). In this paper, we propose a simple and quick MP algorithm by properties of orthogonal base. For illustration and computation, a kind of computation table is given. The effectiveness of this approach is verified by the theoretical analysis and computer simulation.

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

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Friedman, J.H., Stuetzle, W.: Projection Pursuit Rregression. Journal of the American Statistical Association 76, 817–823 (1981)

    Article  MathSciNet  Google Scholar 

  2. Huber, P.J.: Projection Pursuit. The Annals. of Statistics 13, 435–475 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  3. Temlyakov, V.: Weak Greedy Algorithms. Advances in Computational Mathematics 12, 213–227 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  4. Elad, M., Bruckstein, A.M.: A Generalized Uncertainty Principle and Sparse Representation in Pairs of Bases. IEEE Transactions on Information Theory 48, 2558–2567 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Science, Air Force Engineering University, Xi’an, Shaanxi, 710051, P.R. China

    Qinli An, Youqian Feng & Dahua Gao

  2. The Missile Institute, Air Force Engineering University, Sanyuan, Shaanxi, 713800, P.R. China

    Fuping Yu

Authors
  1. Qinli An
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Youqian Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dahua Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Fuping Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Intelligent Machines, Chinese Academy of Sciences, Hefei, Anhui,, China

    De-Shuang Huang

  2. School of Computing and Intelligent Systems, University of Ulster at Magee Campus, BT48 7JL, Derry, Northern Ireland, UK

    Martin McGinnity

  3. Laboratoire LITIS, Université de Rouen, 76800, Saint Etienne du Rouvray, France

    Laurent Heutte

  4. Department of Electrical and Computer Engineering, Ryerson University, Toronto, Ontario, Canada

    Xiao-Ping Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

An, Q., Feng, Y., Gao, D., Yu, F. (2010). A New Method Using Table to Sparse Representation in Pairs of Bases with Matching Pursuits. In: Huang, DS., McGinnity, M., Heutte, L., Zhang, XP. (eds) Advanced Intelligent Computing Theories and Applications. ICIC 2010. Communications in Computer and Information Science, vol 93. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14831-6_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14831-6_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14830-9

  • Online ISBN: 978-3-642-14831-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation