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.

翻译：引入了一种对图像处理特别感兴趣的快速分解孔径变换算法(DCT),该算法的主要特征是图的规律性和极低的算术复杂性。16点算法版本只需要32个乘数和81个附加数。算法的计算核心只有17个非三角乘数,其余的15个是可在后处理中补偿的缩放因子。算法的衍生依据是代数信号处理理论(ASP)。MATLAB算法的实施可以在公共存库https://github.com/Mak-Sim/Fast_recursive_DCT中找到。