An Novel Orthogonal Search Algorithm
Ang S · 2006
The paper presents a novel fast search algorithm for block base motion compensation called the Orthogonal Search, which consists of two sequential search stages: 1) adaptive orthogonal initial search and 2) refined local search. The performance of the al- gorithm is evaluated by using MPEG test sequences and the results are compared to the traditional well- known full search algorithm, diamond search algorithm and the three step search algorithm. The results show that the strength of the algorithm lies in it drop down the number computations required per macro block by more than one time of magnitude to the three step search algorithm.Fur- thermore, the accuracy of the orthogonal diamond search algorithm is comparable to that of the three step search or diamond search.