Abstract
In this paper, we propose a method of regional search for fractal image compression and decompression in a PVM system. In this method, the search for the partitioned iterated function system (PIFS) is carried out in a region of the image instead of over the whole image. Because the area surrounding of a partitioned block in an image is similar to this block possibly, finding the fractal codes by regional search results in increased compression ratios and decreased compression times. When implemented on the PVM, the regional search method of fractal image compression has the minimum communication cost. We can compress a 1024 × 1024 Lenna’s image on a PVM with 4 Pentium II-300 PCs in 13.6 seconds, with a compression ratio 6.34; by comparison, the conventional fractal image compression requires 176 seconds and has a compression ratio 6.30. In the future, we can apply this method to fractal image compression using neural networks.
This is a preview of subscription content, log in via an institution to check access.
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
M. F. Barnsley, Fractal everywhere, New York, Academic Press, 1992.
M. F. Barnsley and A. D. Sloan, A better way to compress images, Byte, vol.13 (1988) 215–223.
M. F. Barnsley, A. Jacquin, L. Renter and A. D. Sloan, Harnessing chaos for image synthesis, Computer Graphics, vol.22, no.4 (1988) 131–141.
S. Demko, L. Hodges and B. Nayloy, Construction of fractal objects with iterated function systems, Computer Graphics, vol.19, no.3 (1985) 271–278.
Y. Fisher, Fractal image compression: Theorem and Application, New York, Spring-Verlag (1994)
A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek and V. Sunderam, PVM: Parallel Virtual Machine-A Users’ Guide and Tutorial for Networked Parallel Computing, The MIT Press, Cambridge, Massachusetts London, England, 1994.
A. E. Jacquin, Image coding based on a fractal theory of iterated constructive image transformations, IEEE Trans. on Image Processing, vol.1, no.1 (1992) 18–30.
A. E. Jacquin, Fractal image coding: a review, Proceeding of the IEEE, vol.81, no.10 (1993) 1451–1465.
S. L. Lee, P. Y. Wu and K. T. Sun, Fractal Image Compression Using Neural Networks, IEEE International Joint Conference on Neural Networks, Anchorage, Alaska, May 5–9 (1998) 613–618.
B. Mandelbort, The fractal geometry of nature, San Franciso CA: freeman, 1982.
M. Nelson, The data compression book. 2nded., M&T books, New York, 1996.
E. Shusterman and M. Feder, Image Compression via improved quadtree decomposition algorithm, IEEE Trans. on Image Processing, vol.4, no.6 (1994) 207–215.
L. Thomas and F. Derrai, Region-based fractal image compression using heuristic search, IEEE Trans. on Image Processing, vol.4, no.6 (1995)832–838.
P. Y. Wu, A Study of The Parallelization of Fractal Image Compression Using 8 × 8 Partition on a Hypercube, Journal of National Tainan Teachers College, vol.31 (1998) 283–296.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, PY. (1999). Minimum Communication Cost Fractal Image Compression on PVM. In: Dongarra, J., Luque, E., Margalef, T. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 1999. Lecture Notes in Computer Science, vol 1697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48158-3_54
Download citation
DOI: https://doi.org/10.1007/3-540-48158-3_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66549-6
Online ISBN: 978-3-540-48158-4
eBook Packages: Springer Book Archive