Paper
10 January 1997 Complexity reduction for overlapped block motion compensation (OBMC)
Author Affiliations +
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.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
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
Lens.org Logo
CITATIONS
Cited by 10 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Computer programming

Motion estimation

Visualization

Algorithm development

Reconstruction algorithms

Video

Detection and tracking algorithms

Back to Top