Full-Text Search:
Home|About CNKI|User Service|中文
Add to Favorite Get Latest Update

Efficient fractal image compression based on pixels distribution and triangular segmentation

ZHU Zhi-liang,ZHAO Yu-li,YU Hai(Software College,Northeastern University,Shenyang Liaoning 110004,China)  
The baseline fractal image compression algorithm requires a great deal of time to complete the encoding process.In order to solve this problem,an efficient fractal image compression based on pixels distribution and triangular segmentation was proposed in this paper.Exploiting the characteristics of centroid uniqueness and centriod position invariance in discrete particulate system,the matching between range blocks and domain blocks was implemented.In addition,dividing original image into isosceles right triangles segmentation could reduce the number of domain blocks,and raise the efficiency of fractal coding.Experimental results show that the proposed algorithm can produce reconstructed images with good quality and require one third time of the baseline encoding algorithm.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©CNKI All Rights Reserved