Abstract
Image sparse decomposition is an efficient and key step for image compression, but hard problem. For sparse decomposition based on matching pursuit, this paper introduces a new anisotropy to construct over-complete dictionary, and makes use of an atom energy support to estimate the inner between atom and image. The results of image decomposition and construction show that image decomposition by the new atom has better performance and the computing speed is improved by 2 times.
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
Mallat, S., Zhang, Z.: Matching pursuits with time-frequency dictionaries. IEEE Trans. Signal Processing 41(12), 3397–3415 (1993)
Ventura, R., Vanderheynst, P., Frossard, P.: Low-Rate and Flexible Image Coding With Redundant Representations. IEEE Trans. on Image Processing 15(3), 726–739 (2006)
Ebrahimi, A., Shirani, S.H.: Matching Pursuit-Based Region-of-Interest Image Coding. IEEE Trans. on Image Processing 16(2), 406–415 (2007)
Zhao, s.: Image denoising combined with blocks based on redundant Bandelet. Computer Engineering And Applications 44(15) (2008)
Vandergheynst, P., Frossard, P.: Efficient image representation by anisotropic refinement in matching pursuit. In: Proceedings of IEEE on ICASSP, Salt Lake City, UT, USA, vol. (3), pp. 1757–1760 (2001)
Yin, Z.K., Wang, J.Y., Vandergheynst, P.: New fast algorithm to sparsely decompose images. Journal Of Computer Applications 24(10), 92–96 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhao, S., Zhang, H., Wang, X. (2011). Image Decomposition and Construction Based on Anisotropic Atom. 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_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-23324-1_35
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)