An Overview of Block Matching Algorithms for Motion Vector Estimation
Citations Over Time
Abstract
In video compression technique, motion estimation is one of the key components because of its high computation complexity involves in finding the motion vectors (MV) between the frames. The purpose of motion estimation is to reduce the storage space, bandwidth and transmission cost for transmission of video in many multimedia service applications by reducing the temporal redundancies while maintaining a good quality of the video. There are many motion estimation algorithms, but there is a trade-off between algorithms accuracy and speed. Among all of these, block-based motion estimation algorithms are most robust and versatile. In motion estimation, a variety of fast block based matching algorithms has been proposed to address the issues such as reducing the number of search/checkpoints, computational cost, and complexities etc. Due to its simplicity, the block-based technique is most popular. Motion estimation is only known for video coding process but for solving real life applications many researchers from the different domain are attracted towards block matching algorithms for motion vector estimation.This paper is a review of various block matching algorithms based on shapes and patterns as well as block matching criteria used for motion estimation.
Related Papers
- → New fast-search algorithm for block matching motion estimation using temporal and spatial correlation of motion vector(2000)34 cited
- → Motion Estimation Using Cross Center-Biased Distribution and Spatio-Temporal Correlation of Motion Vector(2004)1 cited
- → Motion Estimation For High Performance Transcoding(1998)7 cited
- An efficient algorithm for motion estimation in H.264(2004)