A Fast Algorithm for DCT Domain

A method is developed and proposed to eeciently implement spatial domain lter-ing directly on compressed digital video and images in the discrete cosine transform (DCT) domain. It is demonstrated that the computational complexity of this method is signiicantly smaller than that of the straightforward approach, of converting back to the uncompressed domain, convolving in the spatial domain, and retransforming to the DCT domain. It is assumed that the impulse response of the two dimensional lter is symmetric and separable. The method is applicable to any DCT based data compression standard, such as JPEG, MPEG, and H.261.

[1]  Joan L. Mitchell,et al.  JPEG: Still Image Data Compression Standard , 1992 .

[2]  Stephen A. Martucci,et al.  Symmetric convolution and the discrete sine and cosine transforms , 1993, IEEE Trans. Signal Process..

[3]  Y. Arai,et al.  A Fast DCT-SQ Scheme for Images , 1988 .

[4]  P. Yip,et al.  Discrete Cosine Transform: Algorithms, Advantages, Applications , 1990 .

[5]  Neri Merhav,et al.  A fast algorithm for DCT-domain inverse motion compensation , 1996, 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings.

[6]  Shih-Fu Chang,et al.  Manipulation and Compositing of MC-DCT Compressed Video , 1995, IEEE J. Sel. Areas Commun..

[7]  R. J. Clarke,et al.  Lowpass filtering in the cosine transform domain , 1980 .

[8]  Neri Merhav,et al.  A transform domain approach to spatial domain image scaling , 1996, 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings.

[9]  Alessandro Neri,et al.  Inter-block filtering and downsampling in DCT domain , 1994, Signal Process. Image Commun..

[10]  Byeong Gi Lee,et al.  Transform domain filtering based on pipelining structure , 1992, IEEE Trans. Signal Process..