Share Email Print

Proceedings Paper

Temporal prediction of block motion vectors with local ambiguity-based adaptivity
Author(s): Stephen O'Halek; Ken D. Sauer
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The computational burden of full search block matching algorithms for motion estimation in video coding can be reduced through exploitation of spatial and temporal correlation of the motion vectors. This paper describes a simple adaptive temporal prediction scheme for block motion vectors. The first-order temporal predictor determines the center of the search area for a conventional block match, but with substantially reduced search radius. The abbreviated search reduces computation by about 75% for blocks whose motion is successfully predicted. Adaptivity is introduced through the notion of ambiguity in the predicted block match. Those blocks whose matching cost function shows too great an ambiguity in the neighborhood of the best match are instead estimated by the conventional full search. While performance of the algorithm is dependent on sequence content, it offers an attractive choice in the computational cost/performance tradeoff for simple motion compensation.

Paper Details

Date Published: 16 September 1994
PDF: 8 pages
Proc. SPIE 2308, Visual Communications and Image Processing '94, (16 September 1994); doi: 10.1117/12.185938
Show Author Affiliations
Stephen O'Halek, Univ. of Notre Dame (United States)
Ken D. Sauer, Univ. of Notre Dame (United States)

Published in SPIE Proceedings Vol. 2308:
Visual Communications and Image Processing '94
Aggelos K. Katsaggelos, Editor(s)

© SPIE. Terms of Use
Back to Top