A Two-Stage Fast Block Matching Algorithm Using Mean Absolute Error of Neighbor Search Point
Won‐Sik Cheong, Bub-Ki Lee, Seong-Geun Kwon, Chan-Ho Han, Yong-Dal Shin, Kyu‐Ik Sohng, Kuhn-Il Lee · Journal of the Institute of Electronics Engineers of Korea · 2000
In this paper, we propose a two-stage fast block matching algorithm using the mean absolute error (MAE) of neighbor search point that can reduce the computational complexity to estimate motion vector while the motion estimation error performance is nearly the same as full search algorithm (FSA) In the proposed method, the lower bound of MAE 6at current search point IS calculated using the MAE of neighbor search point And we reduce the computational complexity by performing the block matching process only at the search point that has to be block matched using the lower bound of MAE The proposed algorithm is composed of two stages The experimental results show that the proposed method drastically reduces the computational complexity while the motion compensated error performance is nearly kept same as that of FSA.