ML Anthology

Optimal Subpixel Matching of Contour Chains and Segments

Bruno Serra, Marc Berthod
ICCV 1995 pp. 402-407
doi:10.1109/ICCV.1995.466911 /iccv/1995/serra1995iccv-optimal/

Abstract

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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

ICCV Semantic Scholar

Cite

Text

Serra and Berthod. "Optimal Subpixel Matching of Contour Chains and Segments." IEEE/CVF International Conference on Computer Vision, 1995. doi:10.1109/ICCV.1995.466911

Markdown

[Serra and Berthod. "Optimal Subpixel Matching of Contour Chains and Segments." IEEE/CVF International Conference on Computer Vision, 1995.](https://mlanthology.org/iccv/1995/serra1995iccv-optimal/) doi:10.1109/ICCV.1995.466911

BibTeX

@inproceedings{serra1995iccv-optimal,
  title     = {{Optimal Subpixel Matching of Contour Chains and Segments}},
  author    = {Serra, Bruno and Berthod, Marc},
  booktitle = {IEEE/CVF International Conference on Computer Vision},
  year      = {1995},
  pages     = {402-407},
  doi       = {10.1109/ICCV.1995.466911},
  url       = {https://mlanthology.org/iccv/1995/serra1995iccv-optimal/}
}