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.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Subpixel contour matching using continuous dynamic programming


    Contributors:
    Serra (author) / Berthod (author)


    Publication date :

    1994-01-01


    Size :

    475237 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Subpixel Contour Matching Using Continuous Dynamic Programming

    Serra, B. / Berthod, M. / Institute of Electrical and Electronics Engineers; Computer Society | British Library Conference Proceedings | 1994



    Optimal Subpixel Matching of Contour Chains and Segments

    Serra, B. / Berthod, M. / IEEE Computer Society et al. | British Library Conference Proceedings | 1995



    Empirical Filter Estimation for Subpixel Interpolation and Matching

    Triggs, B. / IEEE | British Library Conference Proceedings | 2001