多处理器系统并行图像序列编码

S. Rampal, D. Agrawal
{"title":"多处理器系统并行图像序列编码","authors":"S. Rampal, D. Agrawal","doi":"10.1109/SPDP.1992.242759","DOIUrl":null,"url":null,"abstract":"The authors introduce dictionary-based image sequence coding (DISC) as a new approach to the problem of compression of image sequence data. The DISC algorithm is an adaptation of textual data compression techniques for image sequence data. The algorithm is extremely well suited for parallel implementation on standard configurations such as the rectangular mesh and the hypercube. For N*N images, the authors present SIMD (single-instruction multiple-data) algorithms of time complexities approximately theta (DN) for the mesh and theta (D log N+log/sup 2/ N) for the hypercube (D is proportional to dictionary size). The DISC approach has the additional advantage of involving essentially only simple data movement and lookup operations. Simulation results indicate that moderate to high compression ratios can be achieved along with good visual fidelity and quality of reconstruction.<<ETX>>","PeriodicalId":265469,"journal":{"name":"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Parallel image sequence coding on multiprocessor systems\",\"authors\":\"S. Rampal, D. Agrawal\",\"doi\":\"10.1109/SPDP.1992.242759\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors introduce dictionary-based image sequence coding (DISC) as a new approach to the problem of compression of image sequence data. The DISC algorithm is an adaptation of textual data compression techniques for image sequence data. The algorithm is extremely well suited for parallel implementation on standard configurations such as the rectangular mesh and the hypercube. For N*N images, the authors present SIMD (single-instruction multiple-data) algorithms of time complexities approximately theta (DN) for the mesh and theta (D log N+log/sup 2/ N) for the hypercube (D is proportional to dictionary size). The DISC approach has the additional advantage of involving essentially only simple data movement and lookup operations. Simulation results indicate that moderate to high compression ratios can be achieved along with good visual fidelity and quality of reconstruction.<<ETX>>\",\"PeriodicalId\":265469,\"journal\":{\"name\":\"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPDP.1992.242759\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPDP.1992.242759","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

基于字典的图像序列编码(DISC)是解决图像序列数据压缩问题的一种新方法。DISC算法是对图像序列数据的文本数据压缩技术的一种改进。该算法非常适合在标准配置(如矩形网格和超立方体)上并行实现。对于N*N个图像,作者提出了SIMD(单指令多数据)算法,其时间复杂度对于网格近似为theta (DN),对于超立方体近似为theta (D log N+log/sup 2/ N) (D与字典大小成正比)。DISC方法还有一个额外的优点,即基本上只涉及简单的数据移动和查找操作。仿真结果表明,该方法可以获得中等到较高的压缩比,并具有良好的视觉保真度和重建质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Parallel image sequence coding on multiprocessor systems
The authors introduce dictionary-based image sequence coding (DISC) as a new approach to the problem of compression of image sequence data. The DISC algorithm is an adaptation of textual data compression techniques for image sequence data. The algorithm is extremely well suited for parallel implementation on standard configurations such as the rectangular mesh and the hypercube. For N*N images, the authors present SIMD (single-instruction multiple-data) algorithms of time complexities approximately theta (DN) for the mesh and theta (D log N+log/sup 2/ N) for the hypercube (D is proportional to dictionary size). The DISC approach has the additional advantage of involving essentially only simple data movement and lookup operations. Simulation results indicate that moderate to high compression ratios can be achieved along with good visual fidelity and quality of reconstruction.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On uniformization of affine dependence algorithms On embedding ternary trees into Boolean hypercubes A divide and conquer approach to shortest paths in planar layered digraphs Advanced software pipelining and the program dependence graph A fast sort using parallelism within memory
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1