Hierarchical Chamfer Matching Based on Propagation of Gradient Strengths
2006 (Swedish)In: Discrete Geometry for Computer Imagery: 13th International Conference, DGCI 2006, Szeged, Hungary, October 25-27, 2006. Proceedings / [ed] Attila Kuba, László G. Nyúl and Kálmán Palágyi, Berlin, Heidelberg: Springer , 2006, 308-319 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
Berlin, Heidelberg: Springer , 2006. 308-319 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 4245
Computer Vision and Robotics (Autonomous Systems)
IdentifiersURN: urn:nbn:se:uu:diva-21201DOI: 10.1007/11907350_26ISBN: 978-3-540-47652-8OAI: oai:DiVA.org:uu-21201DiVA: diva2:48974