Classification and feature vector techniques to improve fractal image coding

D. Loganathan, J. Amudha, K. Mehata
{"title":"Classification and feature vector techniques to improve fractal image coding","authors":"D. Loganathan, J. Amudha, K. Mehata","doi":"10.1109/TENCON.2003.1273170","DOIUrl":null,"url":null,"abstract":"Fractal image compression receives much attention because of its desirable properties like resolution independence, fast decoding and very competitive rate-distortion curves. Despite the advances made in fractal image compression the long computing time in encoding phase still remain as main drawback of this technique as encoding step is computationally expensive. A large number of sequential searches through portions of the image are carried out to identify best matches for other image portions. So far, several methods have been proposed in order to speed-up fractal image coding. Here an attempt is made to analyze the speed-up techniques like classification and feature vector, which demonstrates the search through larger portions of the domain pool without increasing computation time. In this way both the image quality and compression ratio are improved at reduced computation time. Experimental results and analysis show that proposed method can speed up fractal image encoding process over conventional methods.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"166 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TENCON.2003.1273170","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

Fractal image compression receives much attention because of its desirable properties like resolution independence, fast decoding and very competitive rate-distortion curves. Despite the advances made in fractal image compression the long computing time in encoding phase still remain as main drawback of this technique as encoding step is computationally expensive. A large number of sequential searches through portions of the image are carried out to identify best matches for other image portions. So far, several methods have been proposed in order to speed-up fractal image coding. Here an attempt is made to analyze the speed-up techniques like classification and feature vector, which demonstrates the search through larger portions of the domain pool without increasing computation time. In this way both the image quality and compression ratio are improved at reduced computation time. Experimental results and analysis show that proposed method can speed up fractal image encoding process over conventional methods.
改进分形图像编码的分类和特征向量技术
分形图像压缩因其具有分辨率无关性、快速解码和极具竞争力的率失真曲线等特性而备受关注。尽管分形图像压缩技术取得了很大的进步,但编码阶段的计算时间长仍然是该技术的主要缺点,编码步骤的计算成本很高。对图像的各个部分进行大量的顺序搜索,以确定其他图像部分的最佳匹配。目前,为了加快分形图像的编码速度,已经提出了几种方法。本文尝试分析了分类和特征向量等加速技术,证明了在不增加计算时间的情况下,可以在更大的域池中进行搜索。这种方法在减少计算时间的同时提高了图像质量和压缩比。实验结果和分析表明,与传统的分形图像编码方法相比,该方法可以加快分形图像的编码速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信