Abstract
The image partitioning scheme in fractal image compression is one of the important aspect for enhancement of performance. In this paper, an adaptive quardtree partitioning scheme is proposed where the entire image is sub-divided recursively into four sub-images. The partitioning points are selected adaptively in a image context-dependent way instead of middle points of the image sides as in quardtree partitioning scheme. Biased successive differences of sum of pixel values of rows of the image are calculated to divide the image row-wise into two sub-images. Then, each sub-image is farther divided column-wise into two parts using biased successive differences of sum of pixel values of columns of the subimage. Then, a fractal image compression technique is proposed based on the proposed partitioning scheme. The comparison of the compression ratio and PSNR are done between fractal image compression with quardtree and proposed adaptive quardtree partitioning schemes. The comparison of the compression time between the same is also done. The fractal image compression with proposed partitioning scheme offers better compression rates most of the times with comparatively improved PSNR. But, the compression time of the fractal image compression with proposed partitioning scheme is much more than its counterpart.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
