An Efficient Diamond Search with Large Kite Search Patterns for Fast Block Motion Estimation

One of the well known block-matching motion estimation (BMME) algorithm is the diamond search (DS). Two improved versions of DS in terms of speed are known to be the cross-diamond search (CDS) and the cross-diamond-hexagonal search (CDHS). Based on these methods, our proposed algorithm employs a new scheme to find small motion vectors with the smallest checking points and proposes two novel search patterns designed to reduce checking points efficiently for large motion vectors. The speed improvement of the proposed algorithm can be up to 61% faster than the diamond search (DS) algorithm, 44% faster than the CDS, and 25% faster than the CDHS while providing similar prediction accuracies