Motion vector search window prediction in memory-constrained systems

Chung-Cheng Lou; Szu-Wei Lee; C.-C. Jay Kuo

doi:10.1117/12.829404

2 September 2009 Motion vector search window prediction in memory-constrained systems

Chung-Cheng Lou, Szu-Wei Lee, C.-C. Jay Kuo

Proceedings Volume 7443, Applications of Digital Image Processing XXXII; 74430E (2009) https://doi.org/10.1117/12.829404
Event: SPIE Optical Engineering + Applications, 2009, San Diego, California, United States

Abstract

The problem of accurate motion vector (MV) prediction with a small search window size for memory-constrained systems is studied in this work. The spatial and temporal correlations of MVs are first investigated. Then, two effective search window prediction algorithms are developed to determine the location, size, shape of a search window for each macroblock. The trade-off between the search window size/shape and distortion is analyzed. Finally, the efficiency of the proposed algorithms is demonstrated by experimental results.

Citation Download Citation

Chung-Cheng Lou, Szu-Wei Lee, and C.-C. Jay Kuo "Motion vector search window prediction in memory-constrained systems", Proc. SPIE 7443, Applications of Digital Image Processing XXXII, 74430E (2 September 2009); https://doi.org/10.1117/12.829404

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