Fast motion estimation based on search range adjustment using neighboring MVDs

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose a new adaptive search range motion estimation method for H.264/AVC where search ranges are adjusted by the probabilities of motion vector differences (MVDs). The MVDs are modeled as a discrete Laplace distribution and then its parameter is estimated by the maximum likelihood estimator. The MVDs of neighboring blocks are employed as the samples for the estimation. With the estimated distribution, the search ranges which include the correct MVDs for a prefixed probability are analytically determined. Since the proposed method handles the search ranges instead of search point sampling patterns, it provides very flexible and hardware-friendly approach in motion estimation. Experimental results show that it is very similar to the optimal method (full search algorithm) in PSNR but gives significant reduction in the computational complexity. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Kang, H. S., & Park, J. H. (2010). Fast motion estimation based on search range adjustment using neighboring MVDs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6455 LNCS, pp. 239–248). https://doi.org/10.1007/978-3-642-17277-9_25

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