The spatial relationship of DCT coefficients between a block and its sub-blocks

At present, almost all digital images are stored and transferred in their compressed format in which discrete cosine transform (DCT)-based compression remains one of the most important data compression techniques due to the efforts from JPEG. In order to save the computation and memory cost, it is desirable to have image processing operations such as feature extraction, image indexing, and pattern classifications implemented directly in the DCT domain. To this end, we present in this paper a generalized analysis of spatial relationships between the DCTs of any block and its sub-blocks. The results reveal that DCT coefficients of any block can be directly obtained from the DCT coefficients of its sub-blocks and that the interblock relationship remains linear. It is useful in extracting global features in the compressed domain for general image processing tasks such as those widely used in pyramid algorithms and image indexing. In addition, due to the fact that the corresponding coefficient matrix of the linear combination is sparse, the computational complexity of the proposed algorithms is significantly lower than that of the existing methods.

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

[2]  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..

[3]  Alexandros Eleftheriadis,et al.  2-D transform-domain resolution translation , 2000, IEEE Trans. Circuits Syst. Video Technol..

[4]  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..

[5]  Nam Ik Cho,et al.  A fast 4×4 DCT algorithm for the recursive 2-D DCT , 1992, IEEE Trans. Signal Process..

[6]  이병기,et al.  파이프라인 구조를 이용한 변환 영역 필터링 ( Transform Domain Filtering Based on Pipeline Structure ) , 1990 .

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

[8]  Robert Reeves,et al.  Texture characterization of compressed aerial images using DCT coefficients , 1997, Electronic Imaging.

[9]  Konstantinos Konstantinides,et al.  Image and Video Compression Standards: Algorithms and Architectures , 1997 .

[10]  J. Jiang.  A Generalised 1-D Approach for Parallel Computation of N × N DCT , 1998 .

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

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

[13]  Josef Kittler,et al.  On local linear transform and Gabor filter representation of texture , 1992, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. III. Conference C: Image, Speech and Signal Analysis,.

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

[15]  Wen-Hsien Fang,et al.  Recursive fast computation of the two-dimensional discrete cosine transform , 1999 .

[16]  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.