Cart (Loading....) | Create Account
Close category search window

A fast fractal decoding algorithm based on the selection of an initial image

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yong Ho Moon ; Digital Media Syst. Lab., Samsung Electron. Co Ltd, Kyungki, South Korea ; Hyung Soon Kim ; Jae Ho Kim

In this correspondence, we show that the number of iterations required for the convergence of the fractal image decoding algorithm can be reduced by selecting a suitable initial image. We consider fractal decoding to have two components, namely, “DC” and “AC”. Our initial image is an approximation of the attractor of DC decoding, which is a good estimation of the “range-averaged” image, i.e., the image obtained by replacing all pixel intensities in a given block by the mean value of the block. From the simulation, it is demonstrated that the decoding speed is greatly improved

Published in:

Image Processing, IEEE Transactions on  (Volume:9 ,  Issue: 5 )

Date of Publication:

May 2000

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.