Improvement of Fractal Image Compression Coding Based on Quadtree
The goal of image compression is to represent an image with as few number of bits as possible while keeping the quality of the original image.With the characteristics of higher compression ratio,fractal image coding has received much attention recently.However,conventional fractal compression approach needs more time to code the original image.In order to overcome the time-consuming issue,a Quadtree-based partitioning and matching scheme is proposed.During the partitioning phase,an image frame is partitioned into tree-structural segments.And during a matching phase,a rang block only searches its corresponding domain block around previous matched domain block.Such local matching procedures will not stop until a predefined matching threshold is obtained.The preliminary experimental results show that such sub-matching rather than a global matching scheme dramatically decreases the matching complexity,while preserving the quality of an approximate image to the original after decoding process.In particular,the proposed scheme improves the coding process up to 2 times against the conventional fractal image coding approach.
Quadtree Fractal image compression coding Rang block Domain block
Hongtao Hu Qifei Liu
School of Computer Science, Xian ShiYou University, Xian, China
国际会议
西安
英文
1157-1161
2012-08-24（万方平台首次上网日期，不代表论文的发表时间）