{"title":"Fast Fractal Coding Algorithm Based on Twice Pre-searching","authors":"Ming Zhao, Ling Bai, Hui Tang, Shaofa Zhou","doi":"10.1109/ICIC.2011.64","DOIUrl":null,"url":null,"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.","PeriodicalId":6397,"journal":{"name":"2011 Fourth International Conference on Information and Computing","volume":"39 1","pages":"98-101"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Fourth International Conference on Information and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIC.2011.64","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
