arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1203.3442cs.ITmath.IT
收藏

一种低乘法复杂度的快速递归DCT-2算法

A low multiplicative complexity fast recursive DCT-2 algorithm

Maxim Vashkevich, Alexander Petrovsky

摘要:

介绍了一种在图像处理中特别有用的快速离散余弦变换(DCT)算法。该算法的主要特点是图的规则性和很低的算法复杂度。该算法的16点版本只需要32次乘法和81次加法。该算法的计算核心仅由17个非平凡乘法组成,其余15个是可以在后处理中补偿的比例因子。该算法的推导基于代数信号处理理论(ASP)。该算法的MATLAB实现可以在公共存储库https://github.com/Mak-Sim/Fast_recursive_DCT中找到。

英文摘要:

A fast Discrete Cosine Transform (DCT) algorithm is introduced that can be of particular interest in image processing. The main features of the algorithm are regularity of the graph and very low arithmetic complexity. The 16-point version of the algorithm requires only 32 multiplications and 81 additions. The computational core of the algorithm consists of only 17 nontrivial multiplications, the rest 15 are scaling factors that can be compensated in the post-processing. The derivation of the algorithm is based on the algebraic signal processing theory (ASP). MATLAB implementation of the algorithm can be found in the public repository https://github.com/Mak-Sim/Fast_recursive_DCT.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑