Performance Analysis of Block Matching Algorithms for Highly Scalable Video Compression

To enable wireless Internet and other data services using mobile appliances, there is a critical need to support content rich cellular data communication, including voice, text, image and video. However, mobile communication of multimedia content has several bottlenecks, including limited bandwidth of cellular networks, channel noise, and battery constraints of the appliances. This paper is a review of the block matching algorithms used for motion estimation in video compression. It implements and compares 7 different types of block matching algorithms such as, exhaustive search, three step search (TSS), new three step search (NTSS), simple and efficient search (SES), four step search (4SS), diamond search (DS), adaptive rood pattern search (ARPS) and conclude the better block estimation algorithm for video compression. The algorithms that are evaluated in this paper are widely accepted by the video compressing community and have been used in implementing various standards. Of the various algorithms studied and simulated ARPS turns out to be the better block matching algorithm for motion estimation.