Share Email Print
cover

Proceedings Paper

Complexity reduction for overlapped block motion compensation (OBMC)
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

A novel idea to reduce OBMC search complexity based on checkerboard block grouping is proposed in this work. We call the proposed new scheme GOBMC. No iteration is required in the proposed scheme for encoding, since the obtained OBMC motion vector set nearly reaches a local optimal solution in one iteration step and, therefore, the complexity is significantly reduced. The distortion measures, both in terms of PSNR and visual quality, remain about the same as those obtained from iterative OBMC motion search. In decoding, we propose an OBMC reconstruction which reduces the complexity of multiplication by a factor of 38 percent while preserving the visual quality as obtained from BMC search with OBMC reconstruction.

Paper Details

Date Published: 10 January 1997
PDF: 12 pages
Proc. SPIE 3024, Visual Communications and Image Processing '97, (10 January 1997); doi: 10.1117/12.263243
Show Author Affiliations
Tien-Ying Kuo, Univ. of Southern California (United States)
C.-C. Jay Kuo, Univ. of Southern California (United States)


Published in SPIE Proceedings Vol. 3024:
Visual Communications and Image Processing '97
Jan Biemond; Edward J. Delp, Editor(s)

© SPIE. Terms of Use
Back to Top