分形图像压缩的改进四叉树分解/重组算法

W. Mahmoud, D. J. Jackson
{"title":"分形图像压缩的改进四叉树分解/重组算法","authors":"W. Mahmoud, D. J. Jackson","doi":"10.1109/SECON.1999.766136","DOIUrl":null,"url":null,"abstract":"We present a fractal image compression algorithm that combine aspects of the classical quadtree decomposition (QD) scheme and the quadtree recomposition scheme (QR) proposed by the authors in earlier papers. For all types of images, the new approach exhibits a superior runtime performance when compared to both the QD and QR schemes, while maintaining high fidelity for compressed images. Quantitative results that include the attained compression ratio, signal-to-noise ratio (SNR), and runtime performance are presented.","PeriodicalId":126922,"journal":{"name":"Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300)","volume":"626 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Improved quadtree decomposition/recomposition algorithm for fractal image compression\",\"authors\":\"W. Mahmoud, D. J. Jackson\",\"doi\":\"10.1109/SECON.1999.766136\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a fractal image compression algorithm that combine aspects of the classical quadtree decomposition (QD) scheme and the quadtree recomposition scheme (QR) proposed by the authors in earlier papers. For all types of images, the new approach exhibits a superior runtime performance when compared to both the QD and QR schemes, while maintaining high fidelity for compressed images. Quantitative results that include the attained compression ratio, signal-to-noise ratio (SNR), and runtime performance are presented.\",\"PeriodicalId\":126922,\"journal\":{\"name\":\"Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300)\",\"volume\":\"626 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SECON.1999.766136\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE Southeastcon'99. Technology on the Brink of 2000 (Cat. No.99CH36300)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECON.1999.766136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本文提出了一种分形图像压缩算法,该算法结合了经典四叉树分解(QD)方案和作者在早期论文中提出的四叉树重组方案(QR)。对于所有类型的图像,与QD和QR方案相比,新方法表现出优越的运行时性能,同时保持压缩图像的高保真度。定量结果包括获得的压缩比,信噪比(SNR)和运行时性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improved quadtree decomposition/recomposition algorithm for fractal image compression
We present a fractal image compression algorithm that combine aspects of the classical quadtree decomposition (QD) scheme and the quadtree recomposition scheme (QR) proposed by the authors in earlier papers. For all types of images, the new approach exhibits a superior runtime performance when compared to both the QD and QR schemes, while maintaining high fidelity for compressed images. Quantitative results that include the attained compression ratio, signal-to-noise ratio (SNR), and runtime performance are presented.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信