A new class of fast shape-adaptive orthogonal transforms and their application to region-based image compression

Region-based approaches to image and video compression have been very actively explored in the last few years. It is widely expected that they will result in rate/quality gains and expanded functionalities. In such approaches, one of the essential problems is the representation of luminance and color in arbitrarily shaped regions. For rectangular blocks extracted from natural images, the discrete cosine transform (DCT) has been found to perform close to the eigentransform. Although for arbitrarily shaped regions orthogonalization-based procedures have been shown to perform very well, their computational complexity and memory requirements are prohibitive for today's technology. Therefore, other approaches are presently investigated, and particular attention is paid to low implementation complexity. In this paper, we propose a new class of orthogonal transforms that self-adapt to arbitrary shapes. The new algorithms are derived from flow graphs of standard fast transform algorithms by a suitable modification of certain butterfly operators. First, we show how to derive a shape-adaptive transform from the discrete Walsh-Hadamard transform (DWHT) flow graph. Then, we discuss modifications needed to arrive at a DCT-based shape adaptive transform. We give implementation details of this transform, and compare its computational complexity with several well-known approaches. We also evaluate the energy compaction performance of the new transform for both synthetic and natural data. We conclude that the proposed DCT-based shape-adaptive transform gives a very beneficial compaction/complexity ratio compared to other well-known approaches. The complexity of the new method does not exceed the complexity of two nonadaptive DCT's on a circumscribing rectangle, and therefore, unlike other tested methods with comparable energy compaction, it is suitable for large regions. This property should prove very valuable in the future when true region-based image/video compression methods are developed.

[1]  K. R. Rao,et al.  Orthogonal Transforms for Digital Signal Processing , 1979, IEEE Transactions on Systems, Man and Cybernetics.

[2]  Jörn Ostermann,et al.  Object-oriented analysis-synthesis coding of moving images , 1989, Signal Process. Image Commun..

[3]  A. Kaup,et al.  On the Performance of the Shape Adaptive DCT in Object-Based Coding of Motion Compensated Difference Images , 1997 .

[4]  Arun N. Netravali,et al.  Digital Pictures: Representation and Compression , 1988 .

[5]  Thomas Sikora,et al.  Efficiency of shape-adaptive 2-D transforms for coding of arbitrarily shaped image segments , 1995, IEEE Trans. Circuits Syst. Video Technol..

[6]  F. Theilheimer A matrix version of the fast Fourier transform , 1969 .

[7]  Thomas Engelhardt,et al.  Coding of arbitrarily shaped image segments based on a generalized orthogonal transform , 1989, Signal Process. Image Commun..

[8]  Gene H. Golub,et al.  Matrix computations , 1983 .

[9]  Christoph Stiller,et al.  Object-oriented video coding employing dense motion fields , 1994, Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing.

[10]  Thomas Sikora,et al.  Shape-adaptive DCT for generic coding of video , 1995, IEEE Trans. Circuits Syst. Video Technol..

[11]  Peter Kauff An Extension of Shape–Adaptive DCT (SA–DCT) Towards DC Separation and DC Correction , 2000 .

[12]  Homer H. Chen,et al.  A block transform coder for arbitrarily shaped image segments , 1994, Proceedings of 1st International Conference on Image Processing.

[13]  Janusz Konrad,et al.  Coding-oriented video segmentation inspired by MRF models , 1996, Proceedings of 3rd IEEE International Conference on Image Processing.

[14]  Shih-Fu Chang,et al.  Transform coding of arbitrarily-shaped image segments , 1993, MULTIMEDIA '93.

[15]  Thomas Sikora,et al.  Low complexity shape-adaptive DCT for coding of arbitrarily shaped image segments , 1995, Signal Process. Image Commun..

[16]  Janusz Konrad,et al.  Eigentransforms for region-based image processing , 1995, Proceedings of International Conference on Consumer Electronics.

[17]  M. Vetterli,et al.  Simple FFT and DCT algorithms with reduced number of operations , 1984 .

[18]  Janusz Konrad,et al.  Region-adaptive transform based on a stochastic model , 1995, Proceedings., International Conference on Image Processing.

[19]  Jae S. Lim,et al.  Coding of arbitrarily shaped regions , 1995, Other Conferences.

[20]  Zhongde Wang Fast algorithms for the discrete W transform and for the discrete Fourier transform , 1984 .

[21]  Anil K. Jain Fundamentals of Digital Image Processing , 2018, Control of Color Imaging Systems.