Comparison of block-based and mesh-based motion estimation algorithms

Yao Wang, Jorn Ostermann

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, two mesh-based motion estimation algorithms are presented. Both algorithms compute the nodal motions in a hierarchical manner. Within each hierarchy level, the first algorithm (HMMA) minimizes the prediction error in the four elements surrounding each node, where the prediction is accomplished by a bilinear mapping. The optimal solution is obtained by a full search within a range defined by the topology of the mesh. The second algorithm (HBMA) minimizes the error in a block surrounding each node, assuming the motion in the block is constant. The two algorithms are compared with an exhaustive block matching algorithm (EBMA) by evaluating their performances in temporal prediction and in an H.263/TMN4 coder. In terms of the PSNR measure, the three algorithms achieve quite similar performances. However, HMMA and HBMA avoid blocking artifacts introduced by EBMA. HMMA outperforms HBMA slightly for certain sequences at the expense of higher computational complexity.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
Editors Anon
PublisherIEEE
Pages1157-1160
Number of pages4
Volume2
StatePublished - 1997
EventProceedings of the 1997 IEEE International Symposium on Circuits and Systems, ISCAS'97. Part 4 (of 4) - Hong Kong, Hong Kong
Duration: Jun 9 1997Jun 12 1997

Other

OtherProceedings of the 1997 IEEE International Symposium on Circuits and Systems, ISCAS'97. Part 4 (of 4)
CityHong Kong, Hong Kong
Period6/9/976/12/97

Fingerprint

Motion estimation
Computational complexity
Topology
atrolactic acid

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Cite this

Wang, Y., & Ostermann, J. (1997). Comparison of block-based and mesh-based motion estimation algorithms. In Anon (Ed.), Proceedings - IEEE International Symposium on Circuits and Systems (Vol. 2, pp. 1157-1160). IEEE.

Comparison of block-based and mesh-based motion estimation algorithms. / Wang, Yao; Ostermann, Jorn.

Proceedings - IEEE International Symposium on Circuits and Systems. ed. / Anon. Vol. 2 IEEE, 1997. p. 1157-1160.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Wang, Y & Ostermann, J 1997, Comparison of block-based and mesh-based motion estimation algorithms. in Anon (ed.), Proceedings - IEEE International Symposium on Circuits and Systems. vol. 2, IEEE, pp. 1157-1160, Proceedings of the 1997 IEEE International Symposium on Circuits and Systems, ISCAS'97. Part 4 (of 4), Hong Kong, Hong Kong, 6/9/97.
Wang Y, Ostermann J. Comparison of block-based and mesh-based motion estimation algorithms. In Anon, editor, Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 2. IEEE. 1997. p. 1157-1160
Wang, Yao ; Ostermann, Jorn. / Comparison of block-based and mesh-based motion estimation algorithms. Proceedings - IEEE International Symposium on Circuits and Systems. editor / Anon. Vol. 2 IEEE, 1997. pp. 1157-1160
@inproceedings{1593612297534fffb4aaaac391e803aa,
title = "Comparison of block-based and mesh-based motion estimation algorithms",
abstract = "In this paper, two mesh-based motion estimation algorithms are presented. Both algorithms compute the nodal motions in a hierarchical manner. Within each hierarchy level, the first algorithm (HMMA) minimizes the prediction error in the four elements surrounding each node, where the prediction is accomplished by a bilinear mapping. The optimal solution is obtained by a full search within a range defined by the topology of the mesh. The second algorithm (HBMA) minimizes the error in a block surrounding each node, assuming the motion in the block is constant. The two algorithms are compared with an exhaustive block matching algorithm (EBMA) by evaluating their performances in temporal prediction and in an H.263/TMN4 coder. In terms of the PSNR measure, the three algorithms achieve quite similar performances. However, HMMA and HBMA avoid blocking artifacts introduced by EBMA. HMMA outperforms HBMA slightly for certain sequences at the expense of higher computational complexity.",
author = "Yao Wang and Jorn Ostermann",
year = "1997",
language = "English (US)",
volume = "2",
pages = "1157--1160",
editor = "Anon",
booktitle = "Proceedings - IEEE International Symposium on Circuits and Systems",
publisher = "IEEE",

}

TY - GEN

T1 - Comparison of block-based and mesh-based motion estimation algorithms

AU - Wang, Yao

AU - Ostermann, Jorn

PY - 1997

Y1 - 1997

N2 - In this paper, two mesh-based motion estimation algorithms are presented. Both algorithms compute the nodal motions in a hierarchical manner. Within each hierarchy level, the first algorithm (HMMA) minimizes the prediction error in the four elements surrounding each node, where the prediction is accomplished by a bilinear mapping. The optimal solution is obtained by a full search within a range defined by the topology of the mesh. The second algorithm (HBMA) minimizes the error in a block surrounding each node, assuming the motion in the block is constant. The two algorithms are compared with an exhaustive block matching algorithm (EBMA) by evaluating their performances in temporal prediction and in an H.263/TMN4 coder. In terms of the PSNR measure, the three algorithms achieve quite similar performances. However, HMMA and HBMA avoid blocking artifacts introduced by EBMA. HMMA outperforms HBMA slightly for certain sequences at the expense of higher computational complexity.

AB - In this paper, two mesh-based motion estimation algorithms are presented. Both algorithms compute the nodal motions in a hierarchical manner. Within each hierarchy level, the first algorithm (HMMA) minimizes the prediction error in the four elements surrounding each node, where the prediction is accomplished by a bilinear mapping. The optimal solution is obtained by a full search within a range defined by the topology of the mesh. The second algorithm (HBMA) minimizes the error in a block surrounding each node, assuming the motion in the block is constant. The two algorithms are compared with an exhaustive block matching algorithm (EBMA) by evaluating their performances in temporal prediction and in an H.263/TMN4 coder. In terms of the PSNR measure, the three algorithms achieve quite similar performances. However, HMMA and HBMA avoid blocking artifacts introduced by EBMA. HMMA outperforms HBMA slightly for certain sequences at the expense of higher computational complexity.

UR - http://www.scopus.com/inward/record.url?scp=0030656042&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030656042&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0030656042

VL - 2

SP - 1157

EP - 1160

BT - Proceedings - IEEE International Symposium on Circuits and Systems

A2 - Anon, null

PB - IEEE

ER -