Symmetric line graph transforms for inter predictive video coding

In this paper, we study graph-based transforms for inter predictive video coding. We are motivated by the fact that symmetries in the transform basis are very beneficial for computational efficiency. Based on this, we describe the relationship between bisymmetric matrices and the butterfly structure in fast transform algorithms. We introduce a new class of transforms called Symmetric Line Graph Transforms (SLGTs), of which the discrete cosine transform (DCT) is one particular case. As is well known in the case of the DCT, the bisymmetry property allows us to reduce the number of multiplications by half. We show that, beyond the DCT, useful SLGTs can be defined that have efficient implementation. We propose a specific SLGT that is shown to outperform the DCT for classes of inter residual blocks. While the proposed SLGT approaches the performance of a Karhunen Loeve Transform (KLT) at certain distortion levels, it has lower computation cost.

[1]  William A. Pearlman,et al.  Low-complexity waveform coding via alphabet and sample-set partitioning , 1997, Proceedings of IEEE International Symposium on Information Theory.

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

[3]  Gilbert Strang,et al.  The Discrete Cosine Transform , 1999, SIAM Rev..

[4]  Gary J. Sullivan,et al.  Overview of the High Efficiency Video Coding (HEVC) Standard , 2012, IEEE Transactions on Circuits and Systems for Video Technology.

[5]  Yuriy A. Reznik,et al.  Fast computing of discrete cosine and sine transforms of types VI and VII , 2011, Optical Engineering + Applications.

[6]  Alan L. Andrew,et al.  Eigenvectors of certain matrices , 1973 .

[7]  Jaejoon Lee,et al.  Edge-adaptive transforms for efficient depth map coding , 2010, 28th Picture Coding Symposium.

[8]  Leonhard Held,et al.  Gaussian Markov Random Fields: Theory and Applications , 2005 .

[9]  R. Tibshirani,et al.  Sparse inverse covariance estimation with the graphical lasso. , 2008, Biostatistics.

[10]  Cha Zhang,et al.  Analyzing the Optimality of Predictive Transform Coding Using Graph-Based Models , 2013, IEEE Signal Processing Letters.

[11]  Wen-Hsiung Chen,et al.  A Fast Computational Algorithm for the Discrete Cosine Transform , 1977, IEEE Trans. Commun..

[12]  Philip A. Chou,et al.  Graph Signal Processing – A Probabilistic Framework , 2016 .

[13]  Antonio Ortega,et al.  Intra-Prediction and Generalized Graph Fourier Transform for Image Coding , 2015, IEEE Signal Processing Letters.

[14]  José M. F. Moura,et al.  The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms , 2003, SIAM J. Comput..

[15]  K. R. Rao,et al.  A Fast Computational Algorithm for the Discrete Sine Transform , 1980, IEEE Trans. Commun..

[16]  A. Cantoni,et al.  Eigenvalues and eigenvectors of symmetric centrosymmetric matrices , 1976 .

[17]  G. Bjontegaard,et al.  Calculation of Average PSNR Differences between RD-curves , 2001 .

[18]  Kenneth Rose,et al.  Jointly Optimized Spatial Prediction and Block Transform for Video and Image Coding , 2012, IEEE Transactions on Image Processing.

[19]  Pascal Frossard,et al.  The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains , 2012, IEEE Signal Processing Magazine.

[20]  Antonio Ortega,et al.  Generalized Laplacian precision matrix estimation for graph signal processing , 2016, 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[21]  Susanto Rahardja,et al.  Mode-dependent fast separable KLT for block-based intra coding , 2011, 2011 IEEE International Symposium of Circuits and Systems (ISCAS).