Adaptive Variety-pattern Search Algorithm
BI Du-yan · Jisuanji gongcheng · 2008
This paper proposes a novel and simple fast Block-Matching Algorithm (BMA), called Adaptive Variety-Pattern Search (AVPS), which efficiently utilizes the high relation of adjacently block’s motion vectors. The algorithm adopts a series of skills, which are composed of prediction of initial search point, effective half-stop criteria, adaptive search pattern and auxiliary search points. Extensive experiments conducted based on the H.264 encoding platform show that the proposed AVPS can reduce the computational complexity by 16%~33% and 30%~50% compared with the UMHexagonS and EPZS, while maintaining similar PSNR and bit rate.