Hierarchical Chamfer Matching: A Parametric Edge Matching Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graphical Models and Image Processing
On digital distance transforms in three dimensions
Computer Vision and Image Understanding
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
Digital Image Processing
Pedestrian Detection from a Moving Vehicle
ECCV '00 Proceedings of the 6th European Conference on Computer Vision-Part II
Parametric correspondence and chamfer matching: two new techniques for image matching
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
Shape context and chamfer matching in cluttered scenes
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Shape based identification of proteins in volume images
SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
Automatic target recognition by matching oriented edge pixels
IEEE Transactions on Image Processing
| Hi-index | 0.00 |
A modification of the hierarchical chamfer matching algorithm (HCMA) with the effect that no binarisation of the edge information is performed is investigated HCMA is a template matching algorithm used in many applications A distance transform (DT) from binarised edges in the search image is used to guide the template to good positions Local minima of a function using the distance values hit by the template correspond to potential matches We propose to use distance weighted propagation of gradient magnitude information as a cost image instead of a DT from the edges By this we keep as much information as possible until later in the matching process and, hence, do not risk to discard good matches in the edge detection and binarisation process.