Abstract

Fractal image compression depends on representing an image using affine transformations. The main concern for researches in the discipline of fractal image compression (FIC) algorithm is to decrease encoding time needed to compress image data. The basic technique is that each portion of the image is similar to other portions of the same image. In this process, there are many models that were developed. The presence of fractals was initially noticed and handled using Iterated Function System (IFS); that is used for encoding images. In this paper, a review of fractal image compression is discussed with its variants along with other techniques. A summarized review of contributions is achieved to determine the fulfillment of fractal image compression, specifically for the block indexing methods based on the moment descriptor. Block indexing method depends on classifying the domain and range blocks using moments to generate an invariant descriptor that reduces the long encoding time. A comparison is performed between the blocked indexing technology and other fractal image techniques to determine the importance of block indexing in saving encoding time and achieving better compression ratio while maintaining image quality on Lena image.

Highlights

  • Introduction an introduction is provided to data compression and the essential concept behind fractal image compression in order to clarify the most important methods involved

  • The technique of fractal image compression is proper in the operation of image signature solutions [14, 15], texture segmentation process [16, 17], image retrieval [18, 19] and the distinct methods like MRI- and ECGbased image processing [20, 21]

  • Saad [33] described the range of images by extracting a few number of features to improve the basic fractal image compression

Read more

Summary

Introduction

An introduction is provided to data compression and the essential concept behind fractal image compression in order to clarify the most important methods involved. A new image compression technique, called fractal compression, has become rapidly popular Nowadays it is being utilized in many of implementations, including image compression, feature extraction, image signatures, texture segmentation, and image watermarking [4]. The technique of fractal image compression is proper in the operation of image signature solutions [14, 15], texture segmentation process [16, 17], image retrieval [18, 19] and the distinct methods like MRI- and ECGbased image processing [20, 21] It focuses on other types of image processing applications, image denoising [22, 23], and digital watermarking solutions [24, 25]. Table-1 presents a comparison between these works in terms of the technique used and results

Fractal image with features extraction
Fractal image with DCT
Fractal image with QuadTree and Huffman coding
Fractal image with genetic algorithm
Good PSNR at the cost of less CR provided when least
The matching process image becomes faster when utilizing
The variable partitioning scheme can reach better results than the fixed
Findings
Conclusions

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.