.png){kind=icon}
返回
A novel and efficient 8-point DCT approximation for image compression
.png){kind=icon}
PRE
AI
DOI：10.1007/s11042-019-08325-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Discrete Cosine Transform is widely used in the field of still image compression. Many integer approximations are given in the literature whereas the most of these transforms requires bit shift operations. This paper presents an efficient and low complexity integer approximation of the DCT for image compression. Our new approach involves replacing the bit shift elements of a variant of the Signed DCT transform by zeros, in order to eliminate the bit shift operations. As a result, all elements of the proposed transform are zeros and +/- 1. Indeed, the proposed transform retains all the characteristics of its original transform, such as orthogonality and high energy compaction capabilities, while generating computing cost savings. Experiments show that the proposed transform has a good compromise performance-computational complexity as well as state-of the-art DCT approximations. Moreover, an efficient algorithm primarily involving a small amount of arithmetical computation is well developed as no multiplications and bit-shift operations are required, with only 16 additions being involved.
Keyword:
Image compression
DCT
Approximation
Fast algorithm
JPEG
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
2.0W
被引数:
3.2W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏On the error-free realization of a scaled DCT algorithm and its VLSI implementation关于缩放DCT算法的无差错实现及其VLSI实现
PREAI
分享收藏分享收藏
查看更多内容