{"title":"Accelerating Fractal Image Encoding Based on Gray Value Moment Features of Normalized Block","authors":"Gao-ping Li","doi":"10.1109/ISCSCT.2008.344","DOIUrl":null,"url":null,"abstract":"Fractal image encoding with full search typically requires a very long runtime, which is essentially spent on searching for the best-matched block to an input range block in a large domain pool. This paper thus proposed an effective method to improve the drawback, which is mainly based on gray value moment features of normalized block and related inequality is presented by the authors. During the search process, the gray value moment features is first utilized to confine efficiently the search space to the vicinity of the initial-matched block (i.e., the domain block having the closest gray value moment features to the input range block being encoded), aiming at reducing the searching scope of similarity matching to accelerate the encoding process. Simulation results show that the proposed scheme not only reduce the searching scope of best-matched to accelerate the encoding process, but also can obtain good quality of the reconstructed images as compared to the baseline algorithm with full search.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Computer Science and Computational Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCSCT.2008.344","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Fractal image encoding with full search typically requires a very long runtime, which is essentially spent on searching for the best-matched block to an input range block in a large domain pool. This paper thus proposed an effective method to improve the drawback, which is mainly based on gray value moment features of normalized block and related inequality is presented by the authors. During the search process, the gray value moment features is first utilized to confine efficiently the search space to the vicinity of the initial-matched block (i.e., the domain block having the closest gray value moment features to the input range block being encoded), aiming at reducing the searching scope of similarity matching to accelerate the encoding process. Simulation results show that the proposed scheme not only reduce the searching scope of best-matched to accelerate the encoding process, but also can obtain good quality of the reconstructed images as compared to the baseline algorithm with full search.