Complexity reduction for overlapped block motion compensation (OBMC)

Tien-Ying Kuo; C.-C. Jay Kuo

doi:10.1117/12.263243

10 January 1997 Complexity reduction for overlapped block motion compensation (OBMC)

Tien-Ying Kuo, C.-C. Jay Kuo

Proceedings Volume 3024, Visual Communications and Image Processing '97; (1997) https://doi.org/10.1117/12.263243
Event: Electronic Imaging '97, 1997, San Jose, CA, United States

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.

Citation Download Citation

Tien-Ying Kuo and C.-C. Jay Kuo "Complexity reduction for overlapped block motion compensation (OBMC)", Proc. SPIE 3024, Visual Communications and Image Processing '97, (10 January 1997); https://doi.org/10.1117/12.263243

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