A Low Computational Complexity Algorithm For Block-Matching Motion Estimation

摘要

Motion estimation plays an important role in digital video compression. The three-step search algorithm (TSS) for block-matching motion estimation has been widely used in real-time video applications due to its good performance. In this paper, a new block-matching motion estimation algorithm is proposed for reduction of computational complexity for TSS. It has been proved by simulation that the proposed algorithm is requires about one third of the computation for TSS while keeping the similar good performance. Another technique is also proposed in this paper to reduce the computational complexity of full search Algorithm.