ML Anthology

Matching 3-D Arcs

Behrooz Kamgar-Parsi, Behzad Kamgar-Parsi
CVPR 1997 pp. 28-33
doi:10.1109/CVPR.1997.609293 /cvpr/1997/kamgarparsi1997cvpr-matching/

Abstract

We present a new algorithm for efficient matching of 3-D polygonal arcs. The algorithm is based on the decomposition of the arcs into sets of corresponding line segments with equal lengths. We derive a closed-form solution for the transformation that gives the best match between two sets of corresponding line segments (best in the sense of an L/sub 2/ norm distance measure), which enables the development of efficient arc matching algorithm. We apply this algorithm to the problem of finding a match between a short are and a piece of a long arc in real and synthetic images, and compare the results with alternative techniques in the literature.

CVPR Semantic Scholar

Cite

Text

Kamgar-Parsi and Kamgar-Parsi. "Matching 3-D Arcs." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1997. doi:10.1109/CVPR.1997.609293

Markdown

[Kamgar-Parsi and Kamgar-Parsi. "Matching 3-D Arcs." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1997.](https://mlanthology.org/cvpr/1997/kamgarparsi1997cvpr-matching/) doi:10.1109/CVPR.1997.609293

BibTeX

@inproceedings{kamgarparsi1997cvpr-matching,
  title     = {{Matching 3-D Arcs}},
  author    = {Kamgar-Parsi, Behrooz and Kamgar-Parsi, Behzad},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1997},
  pages     = {28-33},
  doi       = {10.1109/CVPR.1997.609293},
  url       = {https://mlanthology.org/cvpr/1997/kamgarparsi1997cvpr-matching/}
}