Linear hashtable method predicted hexagonal search algorithm with spatial related criterion

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The paper presents a novel Linear Hashtable Method Predicted Hexagonal Search (LHMPHS) method for block base motion compensation. It bases on the edge motion estimation algorithm called hexagonal search (HEXBS). Most current variances of hexagonal search are investigated. On the basis of research of previous algorithms, we proposed a Linear Hashtable Motion Estimation Algorithm (LHMEA). The proposed algorithm introduces hashtable into motion estimation. It uses information from the current frame. The criterion uses spatially correlated macroblock (MB)'s information. Except for coarse search, the spatially correlated information is also used in inner search. The performance of the algorithm is evaluated by using standard video sequences and the results are compared to current algorithms such as Full Search, Logarithmic Search etc. The evaluation considers the three important metrics: time, compression rate and PSNR. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Wu, Y., Megson, G., Nie, Z., & Alavi, F. N. (2005). Linear hashtable method predicted hexagonal search algorithm with spatial related criterion. In Lecture Notes in Computer Science (Vol. 3540, pp. 1208–1217). Springer Verlag. https://doi.org/10.1007/11499145_122

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free