Fast Motion Estimation Algorithms for Overlapped Block Motion Compression

Copyright 1996 Society of Photo-Optical Instrumentation Engineers. This paper was (will be) published in SPIE Proceedings and is made available as an electronic reprint [preprint] with permission of SPIE. Single print or electronic copies for personal use only are allowed. Systematic or multiple reproduction, distribution to multiple locations through an electronic listserver or other electronic means, duplication of any material in this paper for a fee or for commericial purposes, or modification of the content of the pater are all prohibited. By choosing to view or print this document, you agree to all the provisions of the copyright law protecting it.

While block motion compensation has been the preferred method for reducing inter-frame dependencies in most standards for video coding (H.261, MPEG), a new proposal for very low bit rate video coding (H.263) has included overlapped block motion compensation (OBMC) as an optional mode of operation. In this paper, we present fast algorithms for motion estimation when compensating with OBMC. Standard block matching motion vectors are not optimal for OBMC. Our algorithms estimate which block motion vectors yield the most improvements upon optimizing motion, orders the blocks and optimizes motion vectors based on the ordering. The estimation is based on readily available information from block matching, viz., prediction errors over blocks. As simulation results will demonstrate, the algorithms result in near optimal performances at low computational costs. An additional advantage of the algorithms is that they may be terminated after a few motion vectors have been optimized and still result in high performance gains. This is an advantage in situations where the available computational power at the encoder varies (as in a videophony situation where the frame rate adapts depending on scene activity or available band-width) and it becomes desirable that the motion bectors chosen for optimization result in the highest gain possible.

By: Rajesh Rajagopalan, Lurng-Kuo Liu, Wei Ding and Ephraim Feig

Published in: SPIE Proceedings, volume 2668, (no ), pages 315-23 in 1996

Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.

Questions about this service can be mailed to .