Motion vector estimation using line-square search block matching algorithm for video sequences

Authors:
Ding Gui-guang;Guo Bao-long
Affiliations:
Broadband Networks & digital Media Lab, Automation Department, Tsinghua University, Beijing, China;School of Electromechanical Engineering, Xidian University, Xi'an, China
Venue:
EURASIP Journal on Applied Signal Processing
Year:
2004

Citing 4
Cited 4

A new diamond search algorithm for fast block-matching motion estimation

IEEE Transactions on Image Processing
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
Simplex minimization for single- and multiple-reference motion estimation

IEEE Transactions on Circuits and Systems for Video Technology

Comparison of feature-list cross-correlation algorithms with common cross-correlation algorithms

EURASIP Journal on Applied Signal Processing
Backward channel aware Wyner-Ziv video coding: A study of complexity, rate, and distortion tradeoff

Image Communication
Compact FPGA-based systolic array architecture suitable for vision systems

International Journal of High Performance Systems Architecture
An efficient parallelization technique for x264 encoder on heterogeneous platforms consisting of CPUs and GPUs

Journal of Real-Time Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motion estimation and compensation techniques are widely used for video coding applications but the real-time motion estimation is not easily achieved due to its enormous computations. In this paper, a new fast motion estimation algorithm based on line search is presented, in which computation complexity is greatly reduced by using the line search strategy and a parallel search pattern. Moreover, the accurate search is achieved because the small square search pattern is used. It has a best-case scenario of only 9 search points, which is 4 search points less than the diamond search algorithm. Simulation results show that, compared with the previous techniques, the LSPS algorithm significantly reduces the computational requirements for finding motion vectors, and also produces close performance in terms of motion compensation errors.