A 2-Stage Partial Distortion Search Algorithm for Block Motion Estimation

Authors:
R. Yu;K. P. Lim;D. Wu;F. Pan;Z. G. Li;G. Feng;S. Wu
Affiliations:
-;-;-;-;-;-;-
Venue:
PCM '02 Proceedings of the Third IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Year:
2002

Citing 6
Cited 0

Motion compensating field interpolation using a hierarchically structured displacement estimator

Signal Processing
A novel hexagon-based search algorithm for fast block motion estimation

ICASSP '01 Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03
New adaptive pixel decimation for block motion vector estimation

IEEE Transactions on Circuits and Systems for Video Technology
A novel four-step search algorithm for fast block motion estimation

IEEE Transactions on Circuits and Systems for Video Technology
A novel unrestricted center-biased diamond search algorithm for block motion estimation

IEEE Transactions on Circuits and Systems for Video Technology
Normalized partial distortion search algorithm for block motion estimation

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

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.