Share Email Print

Proceedings Paper

Complexity scalable motion estimation
Author(s): Ralph A. C. Braspenning; Gerard de Haan; Christian Hentschel
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Complexity scalable algorithms are capable of trading resource usage for output quality in a near-optimal way. We present a complexity scalable motion estimation algorithm based on the 3-D recursive search block matcher. We introduce data prioritizing as a new approach to scalability. With this approach, we achieve a near-constant complexity and a continuous quality-resource distribution. While maintaining acceptable quality, it is possible to vary the resource usage from below 1 match-error calculation per block on the average to more than 5 match-error calculations per block on the average.

Paper Details

Date Published: 4 January 2002
PDF: 12 pages
Proc. SPIE 4671, Visual Communications and Image Processing 2002, (4 January 2002); doi: 10.1117/12.453085
Show Author Affiliations
Ralph A. C. Braspenning, Philips Research Labs. (Netherlands)
Gerard de Haan, Philips Research Labs. (Netherlands)
Christian Hentschel, Philips Research Labs. (Netherlands)

Published in SPIE Proceedings Vol. 4671:
Visual Communications and Image Processing 2002
C.-C. Jay Kuo, Editor(s)

© SPIE. Terms of Use
Back to Top