LITERATURE REVIEW

Several block matching algorithms and binary block matching algorithms have been proposed which finds motion vectors for blocks of the frames in a video. Exhaustive search algorithm, also known as Full Search, is the most computationally expensive block matching algorithm of all. This algorithm calculates the cost function at each possible location in the search window. As a result of which it finds the best possible match and gives the highest S!" amongst any block matching algorithm. Fast block matching algorithms try to achieve the same S!" doing as little computation as possible. The obvious disadvantage to ES is that the larger the search window the more computations it re#uires. Three step search is one of the earliest attempts at fast block matching algorithms. $t starts with the search location at the center and sets the %step si&e' S ( ), for a usual search parameter value of *. $t then searches at eight locations +,- S pixels around location ./,/0. From these nine locations searched so far it picks the one with least cost and makes it the new search origin. $t then sets the new step si&e S ( S,1, and repeats similar search for two more iterations until S ( 2. At that point it finds the location with the least cost function and the macro block at that location is the best match. The calculated motion vector is then saved for transmission. $t gives a flat reduction in computation compared to ES "enxiang 3i, 4ing 5eng, and 6ing 3. 3iou in 728 proposed a new algorithm !TSS which improves on TSS results by providing a center biased searching scheme and having provisions for half way stop to reduce computational cost. $t was one of the first widely accepted fast algorithms and fre#uently used for implementing earlier standards like 6 E9 2 and :.1;2. The TSS uses a uniformly allocated checking pattern for motion detection and is prone to missing small motions. $n the first step 2; points are checked in addition to the search origin for lowest weight using a cost function. <f these additional search locations, = are a distance of S ( ) away .similar to TSS0 and the other = are at S ( 2 away from the search origin. $f the lowest cost is at the origin then the search is stopped right there and the motion vector is set as ./, /0.