The Hausdorff Distance Template Matching Algorithm Based On Kalman Filter for Target Tracking

摘要

The Hausdorff distance template matching algorithm is one of the most popular algorithms recently for its robustness to the noise and the occlusion. But if the binary image that has lots of edge pixel points, this algorithm needs a long time to calculate the distance one by one, so we propose the small region filtration method to reduce the computing time. The experiment results show that the algorithm reduces the time greatly. In addition, because the size of template is very small in contrast to the size of the image, we use search windows in the tracking process, and the search windows are predicted by the Kalman filter.