Adaptive dual-cross search algorithm for block-matching motion estimation
In this paper, we present two new and efficient block-matching algorithm (BMAs) for fast motion estimation used in motion-compensated video compression. The proposed algorithms are improvement of existing BMAs and consist of three effective steps: 1) Initial search center prediction, 2) early search termination, and 3) dual-cross pattern search. Extensive simulation results and comparative analysis have shown that the proposed algorithms outperform conventional algorithms, like the three-step search, orthogonal search and diamond search, as well as the newly proposed algorithms, like the hexagonal search and adaptive rood pattern search, in terms of both video peak signal-to-noise ratio and the number of checking points are evaluated.