Fast algorithms for multidimensional DCT-to-DCT computation between a block and its associated subblocks

In this paper, we first propose an efficient algorithm for computing one-dimensional (1-D) discrete cosine transform (DCT) for a signal block, given its two adjacent subblocks in the DCT domain and then introduce several algorithms for the fast computation of multidimensional (m-D) DCT with size N/sub 1//spl times/N/sub 2//spl times/.../spl times/N/sub m/ given 2/sup m/ subblocks of DCT coefficients with size N/sub 1//2/spl times/N/sub 2//2/spl times/.../spl times/N/sub m//2, where N/sub i/(i=1,2,...,m) are powers of 2. Obviously, the row-column method, which employs the most efficient algorithms along each dimension, reduces the computational complexity considerably, compared with the traditional method, which employs only the one-dimensional (1-D) fast DCT and inverse DCT (IDCT) algorithms. However, when m/spl ges/2, the traditional method, which employs the most efficient multidimensional DCT/IDCT algorithms, has lower computational complexity than the row-column method. Besides, we propose a direct method by dividing the data into 2/sup m/ parts for independent fast computation, in which only two steps of r-dimensional (r=1,2,...,m) IDCT and additional multiplications and additions are required. If all the dimensional sizes are the same, the number of multiplications required for the direct method is only (2/sup m/-1)/m2/sup m-1/ times of that required for the row-column method, and if N/spl ges/2/sup 2m-1/, the computational efficiency of the direct method is surely superior to that of the traditional method, which employs the most efficient multidimensional DCT/IDCT algorithms.

[1]  Marc Levoy,et al.  Light field rendering , 1996, SIGGRAPH.

[2]  R. Clarke,et al.  Relation between the Karhunen Loève and cosine transforms , 1981 .

[3]  Pierre Duhamel,et al.  Polynomial transform computation of the 2-D DCT , 1990, International Conference on Acoustics, Speech, and Signal Processing.

[4]  Shih-Fu Chang,et al.  Transform features for texture classification and discrimination in large image databases , 1994, Proceedings of 1st International Conference on Image Processing.

[5]  Chi-Wah Kok,et al.  Fast algorithm for computing discrete cosine transform , 1997, IEEE Trans. Signal Process..

[6]  N. Ahmed,et al.  Discrete Cosine Transform , 1996 .

[7]  Fernando Pérez-González,et al.  DCT-domain watermarking techniques for still images: detector performance analysis and a new structure , 2000, IEEE Trans. Image Process..

[8]  Guizhong Liu,et al.  An effective approach to edge classification from DCT domain , 2002, Proceedings. International Conference on Image Processing.

[9]  Choong-Woong Lee,et al.  Error concealment technique using projection data for block-based image coding , 1994, Other Conferences.

[10]  Xinjian Chen,et al.  A fast algorithm for computing multidimensional DCT on certain small sizes , 2003, IEEE Trans. Signal Process..

[11]  Bo Shen,et al.  Direct feature extraction from compressed images , 1996, Electronic Imaging.

[12]  B. Lee.  A new algorithm to compute the discrete cosine Transform , 1984 .

[13]  Tore Fjällbrant,et al.  A direct computation of DCT coefficients for a signal block taken from two adjacent blocks , 1991, IEEE Trans. Signal Process..

[14]  Robert M. Gray,et al.  Subband-coded image reconstruction for lossy packet networks , 1997, IEEE Trans. Image Process..

[15]  Jianmin Jiang,et al.  The spatial relationship of DCT coefficients between a block and its sub-blocks , 2002, IEEE Trans. Signal Process..

[16]  N. Cho,et al.  Fast algorithm and implementation of 2-D discrete cosine transform , 1991 .

[17]  Hsieh S. Hou.  A fast recursive algorithm for computing the discrete cosine transform , 1987, IEEE Trans. Acoust. Speech Signal Process..

[18]  Richard Szeliski,et al.  The lumigraph , 1996, SIGGRAPH.

[19]  Yonghong Zeng,et al.  New polynomial transform algorithm for multidimensional DCT , 2000, IEEE Trans. Signal Process..

[20]  Hussein M. Alnuweiri,et al.  A new multidimensional recursive architecture for computing the discrete cosine transform , 2000, IEEE Trans. Circuits Syst. Video Technol..

[21]  Ephraim Feig,et al.  Fast algorithms for the discrete cosine transform , 1992, IEEE Trans. Signal Process..

[22]  Athanassios N. Skodras.  Direct transform to transform computation , 1999, IEEE Signal Processing Letters.

[23]  John E. Hershey,et al.  Feature cueing in the discrete cosine transform domain , 1994, J. Electronic Imaging.

[24]  Yonghong Zeng,et al.  New algorithm for multidimensional type-III DCT , 2000 .