arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.04106math.NAcs.NA
收藏

基于稳定 radix-2 DCT 算法的信号处理(具有正交因子)

Signal Processing based on Stable radix-2 DCT Algorithms having Orthogonal Factors

Sirani M. Perera

AI总结:

本文提出基于 DCT-I、DCT-II、DCT-III 和 DCT-IV 的稳定 radix-2 完全递归 DCT 算法,探讨了具有稀疏和正交因子的误差界,并展示了基于递归 2D DCT-II 和 DCT-IV 算法的图像压缩结果。

摘要:

本文提出了基于 DCT-I、DCT-II、DCT-III 和 DCT-IV 的稳定、radix-2、完全递归的离散余弦变换(DCT)算法。这些算法仅使用稀疏和正交因子进行计算。针对具有稀疏和正交因子的完全递归 DCT-I、DCT-II、DCT-III 和 DCT-IV 算法的计算误差界进行了探讨。基于递归 2D DCT-II 和 DCT-IV 算法,展示了 512×512 像素图像在 8×8、16×16 和 32×32 转移块大小下的压缩结果,每个转移块中系数缺失率高达 93.75%。最后展示了基于具有正交因子的完全递归 DCT-I、DCT-II、DCT-III 和 DCT-IV 算法的信号流图。

英文摘要:

This paper presents stable, radix-2, completely recursive discrete cosine transformation algorithms DCT-I and DCT-III solely based on DCT-I, DCT-II, DCT-III, and DCT-IV having sparse and orthogonal factors. Error bounds for computing the completely recursive DCT-I, DCT-II, DCT-III, and DCT-IV algorithms having sparse and orthogonal factors are addressed. Image compression results are presented based on the recursive 2D DCT-II and DCT-IV algorithms for image size $512 \times 512$ pixels with transfer block sizes $8 \times 8$, $16 \times 16$, and $32 \times 32$ with $93.75\%$ absence of coefficients in each transfer block. Finally signal flow graphs are demonstrated based on the completely recursive DCT-I, DCT-II, DCT-III, and DCT-IV algorithms having orthogonal factors.

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

↑