DocumentCode
2304511
Title
Fast Fractal Coding Algorithm Based on Twice Pre-searching
Author
Zhao, Ming ; Bai, Ling ; Tang, Hui ; Zhou, Shaofa
Author_Institution
Math. Coll., Beihua Univ., Jilin, China
fYear
2011
fDate
25-27 April 2011
Firstpage
98
Lastpage
101
Abstract
A fast fractal coding algorithm is proposed in this paper. This algorithm is based on Jacquin´s full search algorithm. When matching range-domain blocks, by utilizing the variance of the image block and the relativity between the image blocks, this algorithm performs twice pre-searching, thus avoiding vast matching computation and reducing the coding time greatly. Experimental results show that the coding time can be reduced approximately by 80% while the PSNR of the most reconstructed images is increased by this algorithm.
Keywords
image coding; image reconstruction; statistical analysis; Jacquin full search algorithm; coding time; fast fractal coding algorithm; image block variance; image pre-searching; image reconstruction; Approximation algorithms; Correlation; Encoding; Fractals; Image coding; Image reconstruction; PSNR; correlation coefficient; fractal image coding; pre-searching; variance;
fLanguage
English
Publisher
ieee
Conference_Titel
Information and Computing (ICIC), 2011 Fourth International Conference on
Conference_Location
Phuket Island
Print_ISBN
978-1-61284-688-0
Type
conf
DOI
10.1109/ICIC.2011.64
Filename
5954513
Link To Document