Wu, Yunsong and Megson, Graham M. (2005) Linear predicted hexagonal search algorithm with moments. In: Huang, De-Shuang and Zhang, Xiao-Ping and Huang, Guang-Bin, (eds.) Advances in Intelligent Computing: International Conference on Intelligent Computing, ICIC 2005, Hefei, China, August 23-26, 2005, proceedings, Part I. Lecture notes in computer science (3644). Springer-Verlag, Berlin, pp. 136-145. ISBN 9783540282266
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/11538059_15
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:||Book Section|
|Research Community:||University of Westminster > Electronics and Computer Science, School of|
|Deposited On:||03 Feb 2009 15:22|
|Last Modified:||20 Oct 2009 14:32|
Repository Staff Only: item control page