ML Anthology

Subpixel Contour Matching Using Continuous Dynamic Programming

Bruno Serra, Marc Berthod
CVPR 1994 pp. 202-207
doi:10.1109/CVPR.1994.323830 /cvpr/1994/serra1994cvpr-subpixel/

Abstract

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

CVPR Semantic Scholar

Cite

Text

Serra and Berthod. "Subpixel Contour Matching Using Continuous Dynamic Programming." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1994. doi:10.1109/CVPR.1994.323830

Markdown

[Serra and Berthod. "Subpixel Contour Matching Using Continuous Dynamic Programming." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1994.](https://mlanthology.org/cvpr/1994/serra1994cvpr-subpixel/) doi:10.1109/CVPR.1994.323830

BibTeX

@inproceedings{serra1994cvpr-subpixel,
  title     = {{Subpixel Contour Matching Using Continuous Dynamic Programming}},
  author    = {Serra, Bruno and Berthod, Marc},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1994},
  pages     = {202-207},
  doi       = {10.1109/CVPR.1994.323830},
  url       = {https://mlanthology.org/cvpr/1994/serra1994cvpr-subpixel/}
}