The paper proposes three modifications to the 3-step hierarchical search block-matching algorithm for video coding: a multiple-winner search that improves the estimation accuracy, a method of subsampling that reduces computation and input data amount, and an overlapping strategy that improves the accuracy of large-area search. Experimental results show that combining these techniques provides high-speed and high-precision motion estimators with reduced on-chip buffers and lowered input bandwidth requirements.<>
Modifications and performance improvements of 3-step search block-matching algorithm for video coding
1994-01-01
264039 byte
Conference paper
Electronic Resource
English
British Library Conference Proceedings | 1994
|Rate constrained block matching algorithm for video coding
British Library Online Contents | 1998
|Block-matching algorithm based on dynamic adjustment of search window for low bit-rate video coding
British Library Online Contents | 1998
|Fast full search motion estimation algorithm using various matching scans in video coding
British Library Online Contents | 2002
|Performance of Different Still Picture Interpolative Coding Schemes on Block Matching Algorithm
British Library Conference Proceedings | 1999
|