This paper presents a subpixel contour matching algorithm using a novel dynamic programming scheme. Unlike classical dynamic programming methods, where a discrete path is searched for across a graph, our approach allows the optimal continuous path to be determined. The matching is obtained as a piecewise parametric function, and no discretization is involved, nor any parameterized deformation assumed. As a side result, a measure of the deformation of the matched contours is obtained, yielding information on the quality of the match. The algorithm has been tested with different types of images, demonstrating its ability to deal with chains of contour segments as well as chains of contour edges, since the discretization of the contours does not limit the precision of the matches anymore.<>
Subpixel contour matching using continuous dynamic programming
1994-01-01
475237 byte
Conference paper
Electronic Resource
English
Subpixel Contour Matching Using Continuous Dynamic Programming
British Library Conference Proceedings | 1994
|Optimal subpixel matching of contour chains and segments
IEEE | 1995
|Optimal Subpixel Matching of Contour Chains and Segments
British Library Conference Proceedings | 1995
|Empirical Filter Estimation for Subpixel Interpolation and Matching
British Library Conference Proceedings | 2001
|