A 2-Stage partial distortion search algorithm for block motion estimation

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

Abstract

In this paper, we propose a novel 2-Stage Partial Distortion Search (2S-PDS) algorithm to reduce the computational complexity in block motion estimation algorithms. In this algorithm, an early-rejection stage is introduced where the partial distortion of a decimated pixel block is calculated and compared with its local minimum. A block is rejected without calculating the full distortion of the entire block if the partial distortion is larger. In order to reduce the probability of false rejection, the local minimum is amplified by a pre-defined threshold before the comparison. Experimental results show that the proposed algorithm can reduce the complexity of block motion estimation algorithm significantly with only marginal performance penalty. The proposed algorithm can be used in combination with full-search or other fast search algorithms. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Yu, R., Lim, K. P., Wu, D., Pan, F., Li, Z. G., Feng, G., & Wu, S. (2002). A 2-Stage partial distortion search algorithm for block motion estimation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2532, 127–134. https://doi.org/10.1007/3-540-36228-2_17

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