用于图像压缩的快速改进签名离散余弦变换

Reem T. Haweel, W. S. El-Kilani, Hassan H. Ramadan
{"title":"用于图像压缩的快速改进签名离散余弦变换","authors":"Reem T. Haweel, W. S. El-Kilani, Hassan H. Ramadan","doi":"10.1109/ICCES.2014.7030928","DOIUrl":null,"url":null,"abstract":"The Discrete Cosine Transform (DCT) is widely used in image compression for its high power compaction property. The Signed DCT (SDCT) and its modifications approximate the DCT and proceed faster. This paper introduces an efficient and low complexity 8 point transform. The proposed algorithm is derived by applying the signum function operator to an existing SDCT modification transform with good power compaction capabilities. Consequently, the elements of the proposed transform are only zeroes and ones. No multiplications or shift operations are required. The introduced transform keeps the high power compaction capabilities of its originating transform and, in the same time, provides a saving in computational complexity. A flow diagram is provided for the fast implementation of the transform. Only 17 additions are required for both forward and backward transformations. Simulation experiments are provided to justify the efficiency and improved performance of the proposed transform in image compression compared to other transforms.","PeriodicalId":339697,"journal":{"name":"2014 9th International Conference on Computer Engineering & Systems (ICCES)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A fast modified signed Discrete Cosine Transform for image compression\",\"authors\":\"Reem T. Haweel, W. S. El-Kilani, Hassan H. Ramadan\",\"doi\":\"10.1109/ICCES.2014.7030928\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Discrete Cosine Transform (DCT) is widely used in image compression for its high power compaction property. The Signed DCT (SDCT) and its modifications approximate the DCT and proceed faster. This paper introduces an efficient and low complexity 8 point transform. The proposed algorithm is derived by applying the signum function operator to an existing SDCT modification transform with good power compaction capabilities. Consequently, the elements of the proposed transform are only zeroes and ones. No multiplications or shift operations are required. The introduced transform keeps the high power compaction capabilities of its originating transform and, in the same time, provides a saving in computational complexity. A flow diagram is provided for the fast implementation of the transform. Only 17 additions are required for both forward and backward transformations. Simulation experiments are provided to justify the efficiency and improved performance of the proposed transform in image compression compared to other transforms.\",\"PeriodicalId\":339697,\"journal\":{\"name\":\"2014 9th International Conference on Computer Engineering & Systems (ICCES)\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 9th International Conference on Computer Engineering & Systems (ICCES)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCES.2014.7030928\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 9th International Conference on Computer Engineering & Systems (ICCES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCES.2014.7030928","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

离散余弦变换(DCT)以其高功率压缩特性在图像压缩中得到了广泛的应用。签名DCT (Signed DCT, SDCT)及其修改近似于DCT,并且速度更快。本文介绍了一种高效、低复杂度的8点变换。该算法通过将sgn函数算子应用于现有的具有良好功率压缩能力的SDCT修改变换而得到。因此,所建议的变换的元素只有0和1。不需要乘法或移位操作。引入的变换保留了其原始变换的高功率压缩能力,同时节省了计算复杂度。为转换的快速实现提供了流程图。向前和向后转换只需要17个加法。通过仿真实验验证了该变换在图像压缩方面的效率和性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A fast modified signed Discrete Cosine Transform for image compression
The Discrete Cosine Transform (DCT) is widely used in image compression for its high power compaction property. The Signed DCT (SDCT) and its modifications approximate the DCT and proceed faster. This paper introduces an efficient and low complexity 8 point transform. The proposed algorithm is derived by applying the signum function operator to an existing SDCT modification transform with good power compaction capabilities. Consequently, the elements of the proposed transform are only zeroes and ones. No multiplications or shift operations are required. The introduced transform keeps the high power compaction capabilities of its originating transform and, in the same time, provides a saving in computational complexity. A flow diagram is provided for the fast implementation of the transform. Only 17 additions are required for both forward and backward transformations. Simulation experiments are provided to justify the efficiency and improved performance of the proposed transform in image compression compared to other transforms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信