A Fast 4 $\times$ 4 Forward Discrete Tchebichef Transform Algorithm
暂无分享,去创建一个
[1] Nam Ik Cho,et al. A fast 4×4 DCT algorithm for the recursive 2-D DCT , 1992, IEEE Trans. Signal Process..
[2] Wen-Hsiung Chen,et al. A Fast Computational Algorithm for the Discrete Cosine Transform , 1977, IEEE Trans. Commun..
[3] Ramakrishnan Mukundan,et al. A Comparison of Discrete Orthogonal Basis Functions for Image Compression , 2004 .
[4] Ephraim Feig,et al. Fast algorithms for the discrete cosine transform , 1992, IEEE Trans. Signal Process..
[5] Farhad Kamangar,et al. Fast Algorithms for the 2-D Discrete Cosine Transform , 1982, IEEE Transactions on Computers.
[6] Gregory K. Wallace,et al. The JPEG still picture compression standard , 1991, CACM.
[7] Zoran Cvetkovic,et al. New fast recursive algorithms for the computation of discrete cosine and sine transforms , 1992, IEEE Trans. Signal Process..
[8] Sim Heng Ong,et al. Image Analysis by Tchebichef Moments , 2001, IEEE Trans. Image Process..
[9] R. Mukundan. Improving Image Reconstruction Accuracy Using Discrete Orthonormal Moments , 2003, CISST.
[10] N. Ahmed,et al. Discrete Cosine Transform , 1996 .
[11] Sang Uk Lee,et al. A fast algorithm for 2-D DCT , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.
[12] Hsieh S. Hou. A fast recursive algorithm for computing the discrete cosine transform , 1987, IEEE Trans. Acoust. Speech Signal Process..