A FAST FRACTAL IMAGE COMPRESSION USING HUFFMAN CODING
Abstract
One of the methods used for compressing images especially natural images is by benefiting from fractal features of images. Natural images have properties like Self-Similarity that can be used in image compressing. The basic approach in compressing methods is based on the fractal features and searching the best replacement block for the original image. In this approach the best blocks are the neighborhood blocks, this approach tries to find the best neighbor blocks; Huffman coding can offer better fast fractal compression than Arithmetic coding When compare to Arithmetic coding ,Huffman coding is best for compression, It increases the speed of compression and produces high PSNR. This work saves lot of bits in the image transmission and it also decrease the time for producing a compressed image and also increase the quality of decompressed image. Totally genetic algorithm increases the speed of convergence for reaching the best block.Article Metrics Graph
Downloads
Published
Issue
Section
License
COPYRIGHT AGREEMENT AND AUTHORSHIP RESPONSIBILITY
 All paper submissions must carry the following duly signed by all the authors:
“I certify that I have participated sufficiently in the conception and design of this work and the analysis of the data (wherever applicable), as well as the writing of the manuscript, to take public responsibility for it. I believe the manuscript represents valid work. I have reviewed the final version of the manuscript and approve it for publication. Neither has the manuscript nor one with substantially similar content under my authorship been published nor is being considered for publication elsewhere, except as described in an attachment. Furthermore I attest that I shall produce the data upon which the manuscript is based for examination by the editors or their assignees, if requested.â€
