Complexity scalable motion estimation

Ralph A. C. Braspenning; Gerard de Haan; Christian Hentschel

doi:10.1117/12.453085

4 January 2002 Complexity scalable motion estimation

Ralph A. C. Braspenning, Gerard de Haan, Christian Hentschel

Proceedings Volume 4671, Visual Communications and Image Processing 2002; (2002) https://doi.org/10.1117/12.453085
Event: Electronic Imaging, 2002, San Jose, California, United States

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.

Citation Download Citation

Ralph A. C. Braspenning, Gerard de Haan, and Christian Hentschel "Complexity scalable motion estimation", Proc. SPIE 4671, Visual Communications and Image Processing 2002, (4 January 2002); https://doi.org/10.1117/12.453085

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available