Open Access

Hybrid Video Coding Based on Bidimensional Matching Pursuit

  • Lorenzo Granai1Email author,
  • Emilio Maggio2,
  • Lorenzo Peotta1 and
  • Pierre Vandergheynst1
EURASIP Journal on Advances in Signal Processing20042004:408254

Received: 23 February 2004

Published: 27 December 2004


Hybrid video coding combines together two stages: first, motion estimation and compensation predict each frame from the neighboring frames, then the prediction error is coded, reducing the correlation in the spatial domain. In this work, we focus on the latter stage, presenting a scheme that profits from some of the features introduced by the standard H.264/AVC for motion estimation and replaces the transform in the spatial domain. The prediction error is so coded using the matching pursuit algorithm which decomposes the signal over an appositely designed bidimensional, anisotropic, redundant dictionary. Comparisons are made among the proposed technique, H.264, and a DCT-based coding scheme. Moreover, we introduce fast techniques for atom selection, which exploit the spatial localization of the atoms. An adaptive coding scheme aimed at optimizing the resource allocation is also presented, together with a rate-distortion study for the matching pursuit algorithm. Results show that the proposed scheme outperforms the standard DCT, especially at very low bit rates.

Keywords and phrases

image processing greedy algorithms matching pursuit redundant dictionaries video coding H.264/AVC

Authors’ Affiliations

Signal Processing Institute, Swiss Federal Institute of Technology (EPFL)
Department of Electronic Engineering, Queen Mary University of London


© Granai et al. 2004