This paper introduces a new general purpose algorithm that allows the optimal geometric match between contours to be determined, that is the transformation yielding a minimal deformation is obtained. The algorithm relies only on the geometric properties of the contours and does not call for any other constraint, so that it is particularly suitable when no parameterization of title deformation is available or desirable. Contour deformation is explicitly incorporated in the computation, allowing for a thorough use of all geometric information available. Moreover, no discretization is involved in the computation, resulting in two main advantages: first, the algorithm is robust to differences in the segmentation of contours and allows the matching of polygonal approximations of contours with very little loss of precision, second, subpixel precision matching can be achieved.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimal subpixel matching of contour chains and segments


    Contributors:
    Serra, B. (author) / Berthod, M. (author)


    Publication date :

    1995-01-01


    Size :

    537282 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Optimal Subpixel Matching of Contour Chains and Segments

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


    Subpixel Contour Matching Using Continuous Dynamic Programming

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




    Empirical Filter Estimation for Subpixel Interpolation and Matching

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