Potential heuristic-based block matching algorithms for motion estimation in video compression

Motion estimation (me) is one of the element keys in video compression that takes up to 60% in processing time. block matching algorithm (bma) is a technique that is used to reduce the computational complexity of me algorithm due to its efficiency and good performance. strategy of searching is one of the factors in developing motion estimation algorithm that has the potential to provide good performance. this study aims to implement several selected bmas for achieving the least number of computations and to give better peak signal to noise ratio (psnr) values using different video sequences. the proposed algorithms are modified based on the search strategy adapted from the standard algorithms approach. the results have proved that both modification algorithms (mds and marps) have the potential in reducing the number of computations and achieved good psnr values in all motion types as compared to ds and arps respectively. this work could be improved by using meta-heuristic algorithms approach such as particle swarm optimization (pso),artificial bee colony (abc),tabu search (ts) and etc to provide the better result of psnr values without increasing the number of computations.