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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Friedman, J.H., Stuetzle, W.: Projection Pursuit Rregression. Journal of the American Statistical Association 76, 817–823 (1981)
Huber, P.J.: Projection Pursuit. The Annals. of Statistics 13, 435–475 (1985)
Temlyakov, V.: Weak Greedy Algorithms. Advances in Computational Mathematics 12, 213–227 (2000)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)