Abstract
Images sparse representation is very suitable for image processing, but the computational burden in images sparse decomposition process is very huge. A fast algorithm is presented based on Matching Pursuit (MP) images sparse decomposition. Simulated Annealing (SA) is applied to effectively search in the dictionary of atoms (i.e. overcomplete dictionary) for the best atom at each step of MP. Experiment results show that the performance of the proposed algorithm is very good.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Mallat, S., Zhang, Z.: Matching pursuit with time-frequency dictionaries. J. IEEE Transactions on Signal Processing 41(12), 3397–3415 (1993)
Bergeau, F., Mallat, S.: Matching pursuit of images. In: A. Proceedings of IEEE-sp. Philadelphia, PA, USA, pp. 330–333 (1994)
Neff, R., Zakhor, A.: Very low bit-rate video coding based on matching pursuit. J. IEEE Transactions Circuits and Systems for Video Technology 7(1), 158–171 (1997)
Phillips, P.: Matching pursuit filter design. In: A. Proceedings of the 12th IAPR international conference on SP. C. Jerusalem Israel, vol. 3, pp. 57–61 (1994)
Wen, X.B., Zhang, H., Zhang, Y., Quan, J.J.: Soft computing and application, pp. 14–34. Science Press, Beijing (2009)
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
Gao, XX., Wen, XB., Liu, LL. (2010). MP-Based Images Sparse Decomposition by Simulated Annealing. In: Huang, DS., Zhang, X., Reyes GarcÃa, C.A., Zhang, L. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2010. Lecture Notes in Computer Science(), vol 6216. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14932-0_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-14932-0_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14931-3
Online ISBN: 978-3-642-14932-0
eBook Packages: Computer ScienceComputer Science (R0)