ML Anthology

Fast Fragment Assemblage Using Boundary Line and Surface Matching

Georgios Papaioannou, Theoharis Theoharis
CVPRW 2003 pp. 2
doi:10.1109/CVPRW.2003.10012 /cvprw/2003/papaioannou2003cvprw-fast/

Abstract

In the recent past, fragment matching has been treated in two different approaches, one using curve matching methods and one that compares whole surfaces or volumes, depending on the nature of the broken artefacts. Presented here is a fast, unified method that combines curve matching techniques with a surface matching algorithm to estimate the positioning and respective matching error for the joining of three-dimensional fragmented objects. Combining both aspects of fragment matching, essentially eliminates most of the ambiguities present in each one of the matching problem categories and helps provide more accurate results with low computational cost.

CVPRW Semantic Scholar

Cite

Text

Papaioannou and Theoharis. "Fast Fragment Assemblage Using Boundary Line and Surface Matching." IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, 2003. doi:10.1109/CVPRW.2003.10012

Markdown

[Papaioannou and Theoharis. "Fast Fragment Assemblage Using Boundary Line and Surface Matching." IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, 2003.](https://mlanthology.org/cvprw/2003/papaioannou2003cvprw-fast/) doi:10.1109/CVPRW.2003.10012

BibTeX

@inproceedings{papaioannou2003cvprw-fast,
  title     = {{Fast Fragment Assemblage Using Boundary Line and Surface Matching}},
  author    = {Papaioannou, Georgios and Theoharis, Theoharis},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops},
  year      = {2003},
  pages     = {2},
  doi       = {10.1109/CVPRW.2003.10012},
  url       = {https://mlanthology.org/cvprw/2003/papaioannou2003cvprw-fast/}
}