CONFERENCE PROCEEDINGS
Advanced Search
Home > Proceedings > Volume 4067 > Article
Paper
30 May 2000 Fast calculation of IFS parameters for fractal image coding
Masaki Harada, Tadahiko Kimoto, Toshiaki Fujii, Masayuki Tanimoto
Author Affiliations +
Proceedings Volume 4067, Visual Communications and Image Processing 2000; (2000) https://doi.org/10.1117/12.386580
Event: Visual Communications and Image Processing 2000, 2000, Perth, Australia
Abstract
Fractal image coding based on Iterated Function System (IFS) has been attracting much interest because of possibilities of drastic data compression. It achieves compression by using the self-similarity in an image. It is one of the weak points on IFS that the calculation time is huge. Especially, the amount of calculation on scaling parameter and rmse is very huge. In this paper, we propose two schemes to reduce the calculation time while the quality of the image is kept. The first one reduces calculation time of parameters, affine transform and rmse by using the maximum amplitude ratio which is a ratio between the maximum amplitude range of range block and that of domain block. By using the maximum amplitude radio, domain block which does not seem to choose is excluded before calculating parameters. The second one reduces calculation time of scaling parameters by using the ratio between variance of range block and that of domain block. The variance ratio is used instead of the scaling parameter. We perform the fractal compression experiments based on the proposed scheme to verify the effectiveness of these schemes. Computational experiments show that about 50% of calculation time is reduced by using both of two schemes.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Citation Download Citation
Masaki Harada, Tadahiko Kimoto, Toshiaki Fujii, and Masayuki Tanimoto "Fast calculation of IFS parameters for fractal image coding", Proc. SPIE 4067, Visual Communications and Image Processing 2000, (30 May 2000); https://doi.org/10.1117/12.386580
ACCESS THE FULL ARTICLE
ORGANIZATIONAL
Sign in with credentials provided by your organization.
INSTITUTIONAL
Select your institution to access the SPIE Digital Library.
SELECT YOUR INSTITUTION
PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.
PERSONAL SIGN IN
No SPIE Account? Create one
PURCHASE THIS CONTENT
SUBSCRIBE TO DIGITAL LIBRARY
50 downloads per 1-year subscription
Members: $195
Non-members: $335 ADD TO CART
25 downloads per 1 - year subscription
Members: $145
Non-members: $250 ADD TO CART
PURCHASE SINGLE ARTICLE
Includes PDF, HTML & Video, when available
Members: $17.00
Non-members: $21.00 ADD TO CART
PROCEEDINGS
 8 PAGES
DOWNLOAD PAPER SAVE TO MY LIBRARY
GET CITATION
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image compression
Fractal analysis
Iterated function systems
Image processing
Computer programming
Image quality
Data compression
RELATED CONTENT
Adaptive sampling for atomic force microscopy
Proceedings of SPIE (February 02 2006)
Genetic algorithms for fast search in fractal image coding
Proceedings of SPIE (February 27 1996)
Fractal-based image coding with polyphase decomposition
Proceedings of SPIE (October 22 1993)
Image coding method based on fractal prediction
Proceedings of SPIE (July 22 1997)
Fractal image coding based on replaced domain pools
Proceedings of SPIE (January 09 1998)
Fractal image coding with high error tolerance
Proceedings of SPIE (May 15 2001)
Subscribe to Digital Library
Receive Erratum Email Alert
Back to Top