Low complexity algorithm for spatially varying transforms

  • Authors:
  • Cixun Zhang;Kemal Ugur;Jani Lainema;Antti Hallapuro;Moncef Gabbouj

  • Affiliations:
  • Tampere University of Technology, Tampere, Finland;Nokia Research Center, Tampere, Finland;Nokia Research Center, Tampere, Finland;Nokia Research Center, Tampere, Finland;Tampere University of Technology, Tampere, Finland

  • Venue:
  • PCS'09 Proceedings of the 27th conference on Picture Coding Symposium
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In our previous work, we introduced Spatially Varying Transforms (SVT) for video coding, where the location of the transform block within the macroblock is not fixed but varying. SVT has lower decoding complexity compared to standard methods as only a portion of the prediction error needs to be decoded. However, the encoding complexity of SVT can be relatively high because of the need to perform Rate Distortion Optimization (RDO) for each candidate Location Parameter (LP). In this work, we propose a low complexity algorithm operating on macroblock and block level to reduce the encoding complexity of SVT. The proposed low complexity algorithm includes selection of available candidate LP based on motion difference and a hierarchical search algorithm. Experimental results show that the proposed low complexity algorithm can reduce around 80% of the candidate LP tested in RDO with only marginal penalty in coding efficiency.