This paper presents a survey of the Fractal image compression. Fractal encoding is a mathematical process
used to encode bitmaps containing a real-world image as a set of mathematical data that describes the fractal
properties of the image. A fractal is a structure that is made up of similar forms and patterns that occur in many
different sizes. The term fractal was first used by Benoit Mandelbrot to describe repeating patterns that he observed
occurring in many different structures. In this context, the survey summarizes the major fractal image compression
methods spanning across different fractal image compression techniques and compare different fractal image
compression techniques are distinct from each other. Further, the paper review that still research possibilities exist in
this field to explore efficient fractal image compression.
This paper presents a survey of the Fractal image compression. Fractal encoding is a mathematical process
used to encode bitmaps containing a real-world image as a set of mathematical data that describes the fractal
properties of the image. A fractal is a structure that is made up of similar forms and patterns that occur in many
different sizes. The term fractal was first used by Benoit Mandelbrot to describe repeating patterns that he observed
occurring in many different structures. In this context, the survey summarizes the major fractal image compression
methods spanning across different fractal image compression techniques and compare different fractal image
compression techniques are distinct from each other. Further, the paper review that still research possibilities exist in
this field to explore efficient fractal image compression.
This paper presents a survey of the Fractal image compression. Fractal encoding is a mathematical process
used to encode bitmaps containing a real-world image as a set of mathematical data that describes the fractal
properties of the image. A fractal is a structure that is made up of similar forms and patterns that occur in many
different sizes. The term fractal was first used by Benoit Mandelbrot to describe repeating patterns that he observed
occurring in many different structures. In this context, the survey summarizes the major fractal image compression
methods spanning across different fractal image compression techniques and compare different fractal image
compression techniques are distinct from each other. Further, the paper review that still research possibilities exist in
this field to explore efficient fractal image compression.
Associate Professor Dept of computer science & Engg Dept of computer science & Engg Alagappa university, karaikudi Alagappa university, karaikudi
Abstract This paper presents a survey of the Fractal image compression. Fractal encoding is a mathematical process used to encode bitmaps containing a real-world image as a set of mathematical data that describes the fractal properties of the image. A fractal is a structure that is made up of similar forms and patterns that occur in many different sizes. The term fractal was first used by Benoit Mandelbrot to describe repeating patterns that he observed occurring in many different structures. In this context, the survey summarizes the major fractal image compression methods spanning across different fractal image compression techniques and compare different fractal image compression techniques are distinct from each other. Further, the paper review that still research possibilities exist in this field to explore efficient fractal image compression.
Keywords Fractal, compression, bitmaps, Images.
I. INTRODUCTION The goal of image compression is to reduce the amount of data required to represent a digital image. Fractal compression is a lossy compression method for digital images, based on fractals. The method is best suited for textures and natural images, relying on the fact that parts of an image often resemble other parts of the same image. Generally image compression classified two types 1, Lossless algorithms remove only redundancy present in the data. The reconstructed image is identical to the original, i.e., all of the information present in the input image has been preserved by compression. 2, lossy algorithms to higher compression are possible which create redundancy (by discarding some information) and then remove it. In general, lossy techniques provide for greater compression ratios than lossless techniques i.e. Lossless compression gives good quality of compressed images, but yields only less compression where as the lossy compression techniques. Fractal algorithms convert images into mathematical data called "fractal codes" which are used to recreate the encoded image. Fractal encoding is a mathematical process used to encode bitmaps containing a real-world image as a set of mathematical data that describes the fractal properties of the image. Recent years, a variety of powerful and sophisticated Fractal image compression schemes for image compression have been developed and implemented. The iteration function system provides a better quality in the images.
II. FRACTAL IMAGE COMPRESSION GENERAL PROCEDURE Fractal encoding relies on the fact that all natural, and most artificial, objects contain redundant information in the form of similar, repeating patterns called fractals. Following are general procedure of fractal image compression Encoding: Step 1: Initially we get a image and divide it into small and non-overlapping, square blocks. This is called as a parent blocks. Step 2: Divide each parent block into 4 each blocks, or child blocks. Step 3: Compare each child block against a subset of all possible overlapping blocks of parent block size. Step 4: Need to reduce the size of the parent to allow the comparison to work. Step 5: Determine which larger block has the lowest difference, according to some measure, between it and the child block. Step 6: Calculate a grayscale transform to match intensity levels between large block and child block precisely. Typically an affine transform is used (w*x =a*x +b) to match grayscale levels. Decoding: Step 1: Read in child block and transform block position, transform, and size information. Step 2: Use any blank starting image of same size as original image Step 3: For each child block apply stored transforms against specified transform block Step 4: Overwrite child block pixel values with transform block pixel values Step 5: Repeat until acceptable image quality is reached.
III. SURVEY OF FRACTAL IMAGE COMPRESSION ALGORITHMS
As you can probably guess, fractal compression is a lossy compression method. It seeks to construct an approximation of the original image that is accurate enough to be acceptable. There are other more traditional methods of compressing images and these works very well. However, fractal compression claims a better performance in that it produces an approximation that is closer to the original at higher compression ratios.
(1) Chetan Dudhagara,Dr. Kishor Atkotiya has proposed a study on fractal-based image compression and fixed-size partitioning will be made, analyzed for performance And compared with a standard frequency domain based image International Journal of Computer Trends and Technology (IJCTT) - volume4 Issue5May 2013
compression standard, JPEG. It performs compression and decompression used for sample images. Performance metrics such as compression ratio, compression time and decompression time will be measured in JPEG cases. It also evaluates Fractal Image Compression to various panel sizes to identify compressed file size, compression ratio, compression time etc. In Fractal Image Compression, when we increase the panel size, it will decrease the original file size and increases the image compression ratio. It will also decrease the processing time.
(2) D. Venkatasekhar, P. Aruna has proposed Genetic algorithm is used to find the best block of replacement, so fractal image is done easily. Here Genetic algorithm with Huffman coding is used for fractal image compression..Intuitively, Huffman coding can offer better fast fractal compression than Arithmetic coding. When compare to Arithmetic coding, Huffman coding is best for compression, It increase the speed of compression and produces high PSNR. Totally genetic algorithm increases the speed of convergence for reaching the best block.
(3) Anupam Garg has proposed A New method for image compression has been developed which uses fractal image compression encoding algorithm with thresholding and then fractal decoding algorithm to get decompressed image. After taking fractal encoding algorithm, a new developed thresholding method is applied to the whole image and then revised threshold is applied to the obtained range blocks with hard thresholding function to get the new range blocks. Decompressed image is obtained after applying fractal decoding algorithm. The proposed method is tested against pure fractal encoding algorithm. The fractal based image compression has the disadvantage of having long encoding time with some compromise with PSNR. The proposed method improves the encoding time and provides higher compression ratio.
(4) Pardeep Singh,Sugandha Sharma,Bhupinder Singh has proposed The results of different image coding techniques are compared i.e. fractal Image compression and Wavelet based compression algorithm embedded zero tree (EZW). The effects of different number of decompositions, image contents and compression ratios are examined. EZW provide better visual quality and better compression ratio butit have lower value of PSNR as compare to fractal image compression. So we can conclude that objectively fractal provide better result as compare to EZW. But achieving high compression ratio and better visual quality is possible in EZW algorithm. So for better visual quality we have to choose EZW algorithm otherwise fractal image compression for better PSNR value. Fractal provides lower value of mean square error as compare to EZW. We can conclude that fractal provide better result objectively (i.e. better PSNR and lower MSE value) while EZW provide better result subjectively (i.e. better visual quality).
IV. REVIEW RESULT AND DISCUSSION
The above methodology reviewed based up on the fractal image based compression techniques. All the techniques objectively speed of compression ratio in rabidly increased and time of the compression ratio decreased. Compression time, PSNR measures are very flexible and effective for all methods. Above all the techniques, a variety of powerful and sophisticated Fractal image compression schemes for image compression have been developed and implemented. These systems also provide a better quality in the images. Fractal compression area is very strong and highly recommended for researchers. It should be possible to take advantage of the large compression ratios achieved from fractal compression and produce a trade-off of compression ratios for information loss to achieve a lossless result. This could be achieved through a post comparison of a fractally compressed file and its original data. By then using a traditional compression scheme, encoding of the differences could be implemented in such a way that a lossless representation of the original data can be reproduced. Another approach is to let the user select sections of the image to be compressed as lossless. V. CONCLUSIONS Here after reviewed & summarizing the techniques of fractal image compression with the help of their experimental outcomes given by respective authors, so for practical approach we conclude that (1) Increase the panel size, it will decrease the original file size and increases the image compression ratio. It will also decrease the processing time. (2) Genetic algorithm increases the speed of convergence for reaching the best block with the help of Huffman coding. Also It increase the speed of compression and produces high PSNR. (3) Improves the encoding time and provides higher compression ratio with help of thresholding function (4) We can conclude that fractal provide better PSNR and lower MSE value while EZW provide better result subjectively better visual quality. .
ACKNOWLEDGMENT Since the basis of this paper being published sources, the authors have acknowledged the sources from which the necessary material is obtained. During the course of this work, the authors have greatly benefited from discussions with subject experts. We acknowledge all those who have supported the development of this paper.
International Journal of Computer Trends and Technology (IJCTT) - volume4 Issue5May 2013
REFERENCES [1] V. Singh, Recent Patents on Image Compression A Survey, Recent Patents on Signal Processing, 2010, Volume 2 , 2, 47-62 [2] Rashmikant A Madaliya and Rajesh Kumar Rai,Fractal Image Compression Using Graphics Hardware, International Journal of Advanced Engineering Research and Studies E-ISSN22498974, IJAERS/Vol. I/ Issue IV/July-Sept., 2012/109-112. [3] J yoti Bhola and Simarpreet Kaur,Encoding Time Reduction method for the Wavelet based Fractal Image Compression , International Journal of Computer Engineering Science (IJCES),Volume 2 Issue 5 (May 2012) , ISSN : 2250:3439 [4] Huaqing Wang, Xiangjian He, Qiang Wu and Tom Hintz , A new approach for fractal image compression on a virtual Hexagonal structure, The 18th International Conference on Pattern Recognition (ICPR'06) 0-7695-2521-0/06 $20.00 2006 [5] Vijayshri Chaurasia and Ajay Somkuwar , Review of a novel technique: fractal image compression , International Journal on Emerging Technologies 1(1): 53-56(2010) ISSN : 0975-8364 [6] Anupam Garg, An Improved Algorithm of Fractal Image Compression , International Journal of Computer Applications (0975 8887) Volume 34 No.2, November 2011 [7] Jayavrinda Vrindavanam, Saravanan Chandran and Gautam K. Mahanti, A Survey of Image Compression Methods , International Conference & Workshop on Recent Trends in Technology, (TCET) 2012 Proceedings published in International Journal of Computer Applications(IJCA). [8] Chetan Dudhagara and Dr. Kishor Atkotiya, Experimental Study of Fractal Image Compression Algorithm, International Journal of Computer Applications & Information Technology Vol. I, Issue II, September 2012 (ISSN: 2278-7720) [9] D.Sophin Seeli and Dr.M.K.Jeyakumar, A Study on Fractal Image Compression using Soft Computing Techniques , IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 6, No 2, November 2012 . [10] Y. Chakrapani and K. Soundara Rajan, Genetic Algorithm Applied To Fractal Image Compression , VOL. 4, NO. 1, FEBRUARY 2009, ISSN 1819-6608, ARPN J ournal of Engineering and Applied Sciences. [11] Hitashi, Gaganpreet Kaur and Sugandha Sharma, Fractal image compression- a review , Volume 2, Issue 2, February 2012, ISSN: 2277 128X. [12] D. Venkatasekhar and P. Aruna, A Fast Fractal Image Compression Using Huffman Coding, Asian Journal of Computer Science And Information Technology 2: 9 (2012) 272 275.