ML Anthology

Matching Elastic Contours

Davi Geiger, John A. Vlontzos
CVPR 1993 pp. 602-604
doi:10.1109/CVPR.1993.341065 /cvpr/1993/geiger1993cvpr-matching/

Abstract

An optimal method to match elastic contours is proposed. The method is based on dynamic programming and on some ideas borrowed from stereo matching, where occlusions correspond to contour regions that have no match after the deformation. The matching between two circles of different sizes and centers is shown. One may consider this experiment as the matching between two images of an inflating balloon. The algorithm produces uniform matches along the perimeter despite the large difference in size of the two contours. The matching of the inner and outer walls of the heart left ventricle is also shown. This matching can give diagnostic information for the heart wall. Because of the restricted search space, the DP matching algorithm is very fast, matching two contours of 500 points in a few milliseconds.< <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

Geiger and Vlontzos. "Matching Elastic Contours." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1993. doi:10.1109/CVPR.1993.341065

Markdown

[Geiger and Vlontzos. "Matching Elastic Contours." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1993.](https://mlanthology.org/cvpr/1993/geiger1993cvpr-matching/) doi:10.1109/CVPR.1993.341065

BibTeX

@inproceedings{geiger1993cvpr-matching,
  title     = {{Matching Elastic Contours}},
  author    = {Geiger, Davi and Vlontzos, John A.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1993},
  pages     = {602-604},
  doi       = {10.1109/CVPR.1993.341065},
  url       = {https://mlanthology.org/cvpr/1993/geiger1993cvpr-matching/}
}