Modifications and performance improvements of 3-step search block-matching algorithm for video coding
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.<<ETX>>