Coding of video sequences using block matching motion estimation Three Step Search algorithms

Abstract: Video compression plays an important role in many digital video applications such as digital libraries, video on demand, and high definition television. Exploiting the temporal correlation between two successive sequence frames we can reduce enormously the memory space needed for compression. In this context, we have applied and compared different block matching motion estimation three step search algorithms. These algorithms include Three step search algorithm (TSS), New three steps search algorithm (NTSS), Improved TSS algorithm, Enhanced TSS algorithm, Fast TSS algorithm. The performance of an algorithm is a compromise between the peak signal to noise ratio and the computing search time of the algorithm. All the algorithms are compared on the basis of PSNR and number of searching points. Choosing an algorithm depends on what we require in application. Some applications need to be executed in a minimum of computing time(real time application) and others applications must give a good PSNR as it is in the medical image processing domain. Relative merits of all algorithms are given in conclusion.

Keywords: Motion estimation, three step search, New three step search, block matching.