Experiments on block-matching techniques for video coding

Eric Chan, Arturo A. Rodriguez, Rakeshkumar Gandhi, Sethuraman Panchanathan

Research output: Contribution to journalArticlepeer-review

24 Scopus citations


Video compression is becoming increasingly important with the advent of compression standards and broadband networks. Recently, several block-based motion-estimation algorithms to exploit the temporal redundancies in a video sequence have been reported in the literature. Some of these algorithms tend to be either computationally expensive or to converge to a local optimum. In this paper, we present results for various block-matching techniques and propose a low-complexity block-matching motion-estimation algorithm that is useful for hybrid video coding schemes, including MPEG video. This algorithm consists of a layered structure search, and, unlike other fast block-matching methods, it does not converge to a local optimum. The proposed method employs a novel matching criterion, namely, the modified pixeldifference classification (MPDC), that offers simplicity with other potential advantages.

Original languageEnglish (US)
Pages (from-to)228-241
Number of pages14
JournalMultimedia Systems
Issue number5
StatePublished - Dec 1 1994
Externally publishedYes


  • Block matching
  • MPEG video coder
  • Motion estimation
  • Video compression

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Media Technology
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'Experiments on block-matching techniques for video coding'. Together they form a unique fingerprint.

Cite this