Accessibility navigation

Linear predicted hexagonal search algorithm with moments

Wu, Y. S. and Megson, G. (2005) Linear predicted hexagonal search algorithm with moments. Lecture Notes in Computer Science, 3644. pp. 136-145. ISSN 0302-9743 3-540-28226-2

Full text not archived in this repository.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.


A novel Linear Hashtable Method Predicted Hexagonal Search (LHMPHS) method for block based motion compensation is proposed. Fast block matching algorithms use the origin as the initial search center, which often does not track motion very well. To improve the accuracy of the fast BMA's, we employ a predicted starting search point, which reflects the motion trend of the current block. The predicted search centre is found closer to the global minimum. Thus the center-biased BMA's can be used to find the motion vector more efficiently. The performance of the algorithm is evaluated by using standard video sequences, considers the three important metrics: The results show that the proposed algorithm enhances the accuracy of current hexagonal algorithms and is better than Full Search, Logarithmic Search etc.

Item Type:Article
ID Code:15454
Additional Information:Proceedings Paper International Conference on Advances in Intelligent Computing, Pt 1 AUG 23-26, 2005 Hefei, PEOPLES R CHINA

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation