Anew method for speeding up FractalCompression using different value of affine transformation and highest gray value of pixel
Keywords:fractal image compression, HVpartition, number of pixels in each block, range ,domain
In this paperÂ new algorithm forÂ speeding up fractal image compression Â is presented. A new adapted method based on computing the highest value of the pixel of the image to reduce the computational complexity in the encoder stage and which are led to decreasing the encoding time while the reconstructed image from the work as good as we want. For increasing the effectiveness of search stage we used another type of partitioning method that led to increase the flexibility of range partition, this method is HV-partition. We applied this method on images and also present a comparison of this method against other method which used to speed the fractal compression.
HAN Jin-shu, 2007,'Fast fractal image
compression by pixel peaks and valleys
Fisher , Yuval, 1995, 'Fractal Image
Compression theory and application' .
New York , Inc.
Bhabatosh Chanda, 2009, 'Digital
Image Processing and Analysis' 12th , New
Jamila Harbi Saoud Al-A'mri, January
,'Fractal Image Compression', thesis,
Hanaa Mehsen Ali, May 2005,'speeding
up fractal image coding by using indexing
block', thesis, Technology University.
[ 6] La Torre, F. Mendivil and E.R. Vrscay,
Iterated function systems on
Madhuri A.Joshi, 2009,'digital Image
Processing An Algorithmic Approach', 4th
ed. New Delhi.
How to Cite
Copyright (c) 2014 Hind Rostom Mohammed, Hanaa Muhsen Ali
This work is licensed under a Creative Commons Attribution 4.0 International License.
which allows users to copy, create extracts, abstracts, and new works from the Article, alter and revise the Article, and make commercial use of the Article (including reuse and/or resale of the Article by commercial entities), provided the user gives appropriate credit (with a link to the formal publication through the relevant DOI), provides a link to the license, indicates if changes were made and the licensor is not represented as endorsing the use made of the work.