基于归一化分块灰度值矩特征的加速分形图像编码

Gao-ping Li
{"title":"基于归一化分块灰度值矩特征的加速分形图像编码","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":"{\"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}","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

摘要

完全搜索的分形图像编码通常需要很长的运行时间,这基本上是花费在搜索与大型域池中的输入范围块最匹配的块上。本文提出了一种有效的改进方法,该方法主要基于归一化块的灰度值矩特征和相关不等式。在搜索过程中,首先利用灰度值矩特征将搜索空间有效地限制在初始匹配块(即灰度值矩特征与被编码的输入范围块最接近的域块)附近,旨在减小相似性匹配的搜索范围,加快编码过程。仿真结果表明,该方案不仅缩小了最优匹配的搜索范围,加快了编码过程,而且与全搜索的基线算法相比,重构图像的质量更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Accelerating Fractal Image Encoding Based on Gray Value Moment Features of Normalized Block
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信