Share Email Print

Proceedings Paper

Motion vector search window prediction in memory-constrained systems
Author(s): Chung-Cheng Lou; Szu-Wei Lee; C.-C. Jay Kuo
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 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.

Paper Details

Date Published: 2 September 2009
PDF: 12 pages
Proc. SPIE 7443, Applications of Digital Image Processing XXXII, 74430E (2 September 2009); doi: 10.1117/12.829404
Show Author Affiliations
Chung-Cheng Lou, Univ. of Southern California (United States)
Szu-Wei Lee, Univ. of Southern California (United States)
C.-C. Jay Kuo, Univ. of Southern California (United States)

Published in SPIE Proceedings Vol. 7443:
Applications of Digital Image Processing XXXII
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top