Abstract
The convergence of fractal operator F used in image compression is investigated. A sufficient condition for eventual contractivity is derived by using the adjacency matrix of an influence graph which is determined by the fractal encoder.
The work was sponsored in part by ECU grant CRIT2.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Banach, “Sur les operations dans les ensembles abstraits et leur applications aux equations integrales”, Fundamenta Mathematica, vol.3, pp. 133–181, 1922.
M. F. Barnsley and L. P. Hurd, Fractal image compression, AK Peters. Ltd, Wellesley, MA, 1993.
J. Dugundi and A. Granas, Fixed point theory, Polish Scientific Publishers, Warszawa, 1982.
Y. Fisher ed., Fractal image compression, Theory and Application, Springer Verlag, New York, 1995.
A. E. Jacquin, “Image coding based on a fractal theory of iterated contractive image transformations”, IEEE Trans. on Image Processing, vol. 1, no. 1, pp. 18–30, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Skarbek, W. (1998). Fractal Operator Convergence by Analysis of Influence Graph. In: Polkowski, L., Skowron, A. (eds) Rough Sets and Current Trends in Computing. RSCTC 1998. Lecture Notes in Computer Science(), vol 1424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69115-4_43
Download citation
DOI: https://doi.org/10.1007/3-540-69115-4_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64655-6
Online ISBN: 978-3-540-69115-0
eBook Packages: Springer Book Archive