%0 Conference Paper
%B Computer Vision and Pattern Recognition (CVPR), 2010 IEEE Conference on
%D 2010
%T Fast directional chamfer matching
%A Ming-Yu Liu
%A Tuzel, O.
%A Veeraraghavan,A.
%A Chellapa, Rama
%K 3D
%K algorithm;edge
%K algorithms;single
%K chamfer
%K cost
%K detection;image
%K directional
%K distance
%K distribution;cost
%K example;smooth
%K function;sublinear
%K hand-drawn
%K images;edge
%K information;fast
%K integral
%K localization
%K MATCHING
%K matching;gallery
%K matching;transforms;
%K model;piecewise
%K of
%K orientation
%K problem;object
%K score;directional
%K shapes;object
%K smooth;shape
%K TIME
%K time;cost
%K transforms;computational
%K variation;directional
%X We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been proposed for the problem over the decades, chamfer matching remains to be the preferred method when speed and robustness are considered. In this paper, we significantly improve the accuracy of chamfer matching while reducing the computational time from linear to sublinear (shown empirically). Specifically, we incorporate edge orientation information in the matching algorithm such that the resulting cost function is piecewise smooth and the cost variation is tightly bounded. Moreover, we present a sublinear time algorithm for exact computation of the directional chamfer matching score using techniques from 3D distance transforms and directional integral images. In addition, the smooth cost function allows to bound the cost distribution of large neighborhoods and skip the bad hypotheses within. Experiments show that the proposed approach improves the speed of the original chamfer matching upto an order of 45 #x00D7;, and it is much faster than many state of art techniques while the accuracy is comparable.
%B Computer Vision and Pattern Recognition (CVPR), 2010 IEEE Conference on
%P 1696 - 1703
%8 2010/06//
%G eng
%R 10.1109/CVPR.2010.5539837