Design of Faster Fractal Image Compression using Intensity Mismatch Threshold
Hasanujjaman1, Arnab Banerjee2, U. Biswas3, M K Naskar4

1Hasanujjaman*, Assistant Professor Dept. of ECE, Kalyani Govt. Engineering College , Kalyani , West Bengal.
2Arnab Banerjee , Dept. of ECE, Kalyani Govt. Engineering College , Kalyani , West Bengal.
3Prof. U Biswas, University of Kalyani , West Bengal.
4Prof. M K Naskar , Jadavpur University , Kolkata.
Manuscript received on September 22, 2019. | Revised Manuscript received on October 20, 2019. | Manuscript published on October 30, 2019. | PP: 2097-2100 | Volume-9 Issue-1, October 2019 | Retrieval Number: A9653109119/2019©BEIESP | DOI: 10.35940/ijeat.A9653.109119
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (

Abstract: Within the domain of image processing the applications of the fractal image compression through the affine transform is rarely implemented. The major drawback it consists is its time consumptions in simulations as well as in hardware implementation. The reason behind this is its comparatively matching the range blocks with the varied number of domain blocks. Additionally, the compression ration obtained from this sets of techniques are much more that the other similar working techniques. In order to overcome, this drawback, here a concept of intensity mismatch searching techniques is intruded within this particular paper. While in the mean time, it only concluded in much reduce in time of searching for similar domain block form a pool. And also this technique does not affect within the compression ratio and PSNR measurement form the retrieved image. Further benefitted in hardware applications where the matters for time consumptions is a major factor.
Keywords: Fractal image compression, time consumption, intensity mismatch, range block and domain block.