About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
MMSP 1997
Conference paper
Dynamic search range motion estimation for video coding
Abstract
A fast algorithm for motion estimation in interframe video coding is proposed in this paper. In contrast to previously proposed fast algorithms which use limited number of check points in a constant search range, the proposed algorithm performs search in a dynamic search range. It provides better estimation accuracy than that of previously proposed fast algorithms which use limited search points. Experimental results show that the proposed algorithm provides a comparable performance with that of full search but with reduced computational complexity.