Analysis of Block Matching Algorithms for Motion Estimation in Video Data

Abstract

Demand for video data is increasing exponentially, and to cope with the growing demand of video data, various block matching techniques are designed. Video compression has been in the demand among research community. Various methods have been studied for video compression but block matching algorithms are very popular and have been very useful for video compression. This article is to review various block matching motion estimation techniques for video compression. This paper evaluates the performance of different block matching motion estimation algorithms using MAD in terms of PSNR and execution time. These block matching algorithms use different search patterns and are different from one another in search pattern and approach, and hence these algorithms have different number of points to search matching blocks. Motion estimation of blocks and objects has been very important and significant in any of the video standard. All standards for storage and compression of the video, as per the international standards, are using one of the block matching algorithms for the reduction of temporal redundancy. All the video standards from H.261 to H.264-Advanced video coding or latest H.265-High efficiency video coding are based on motion estimation techniques to reduce temporal redundancy.