Abstract
The algorithm matches edges by minimizing a generalized distance between them. The matching is performed in a series of images depicting the same scene with different resolutions, i.e. in a resolution pyramid. Using this hierarchical structure reduces the computational load significantly. The algorithm is reasonably simple to implement and is insensitive to noise and other disturbances. The algorithm has been tested in several applications. Two of them are briefly presented. In the first application the outlines of common tools are matched to gray-level images of the same tools, with overlapping. In the second application lake edges from aerial photographs are matched to lake edges from a map, with translation, rotation, scale, and perspective changes. The hierarchical chamfer matching algorithm gives correct results using a reasonable amount of computational resources in all tested applications.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Keywords
Computer scienceArtificial intelligenceAlgorithmMatching (statistics)Parametric statisticsPattern recognition (psychology)Computational complexity theoryBlossom algorithmComputer visionMathematics
Affiliated Institutions
Related Publications
Symmetric phase-only matched filtering of Fourier-Mellin transforms for image registration and recognition
Presents a new method to match a 2D image to a translated, rotated and scaled reference image. The approach consists of two steps: the calculation of a Fourier-Mellin invariant ...
Principal warps: thin-plate splines and the decomposition of deformations
The decomposition of deformations by principal warps is demonstrated. The method is extended to deal with curving edges between landmarks. This formulation is related to other a...
Distortion invariant object recognition in the dynamic link architecture
An object recognition system based on the dynamic link architecture, an extension to classical artificial neural networks (ANNs), is presented. The dynamic link architecture exp...
Affine invariant model-based object recognition
New techniques are described for model-based recognition of the objects in 3-D space. The recognition is performed from single gray-scale images taken from unknown viewpoints. T...
Matching pursuits with time-frequency dictionaries
The authors introduce an algorithm, called matching pursuit, that decomposes any signal into a linear expansion of waveforms that are selected from a redundant dictionary of fun...
Publication Info
- Year
- 1988
- Type
- article
- Volume
- 10
- Issue
- 6
- Pages
- 849-865
- Citations
- 1044
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
1044
OpenAlex
Cite This
G. Borgefors
(1988).
Hierarchical chamfer matching: a parametric edge matching algorithm.
IEEE Transactions on Pattern Analysis and Machine Intelligence
, 10
(6)
, 849-865.
https://doi.org/10.1109/34.9107
Identifiers
- DOI
- 10.1109/34.9107