• Login
    View Item 
    •   Eurographics DL Home
    • Eurographics Conferences
    • EG2011
    • Tutorials
    • View Item
    •   Eurographics DL Home
    • Eurographics Conferences
    • EG2011
    • Tutorials
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Computing Correspondences in Geometric Data Sets

    Thumbnail
    View/Open
    t1.pdf (33.25Mb)
    Date
    2011
    Author
    Chang, Will
    Li, Hao
    Mitra, Niloy ORCID
    Pauly, Mark
    Rusinkiewicz, Szymon ORCID
    Wand, Michael
    Pay-Per-View via TIB Hannover:

    Try if this item/paper is available.

    Metadata
    Show full item record
    Abstract
    Shape registration and, more generally speaking,computing correspondence across shapes are fundamental problems in computer graphics and vision. Problems from this area show up in many different variants such as scan registration, deformable shapematching, animation reconstruction, or finding partial symmetries of objects. Computing correspondences is a main prerequisite for higher level shape processing algorithms, such as building statistical models, non-local denoising, or inverse procedural modeling. Our tutorial addresses correspondence problems in geometric shapes. We will look at the problem from two different perspectives: In the first part of our tutorial, we will motivate the problem and explain the problem structure (formal models for shape matching), its variants (partial vs. complete matching, deformable vs. rigid, etc) and specific challenges (such as noise, incomplete data, and statistical descriptions thereof). In the second part, we will look at algorithms for solving these problems, and at applications of these. Again, we will focus on the main ideas and principles. Our overall goal is to give the attendee a "coordinate system" of the field, to convey the main problem structure and the main approaches to solve the problem, as well as open questions and research challenges. Topics covered will include rigid and deformable shape matching, local and global correspondence algorithms, as well as symmetry detection and applications.
    BibTeX
    @inproceedings {10.2312:EG2011:tutorials:t1,
    booktitle = {Eurographics 2011 - Tutorials},
    editor = {Ralph Martin and Juan Carlos Torres},
    title = {{Computing Correspondences in Geometric Data Sets}},
    author = {Chang, Will and Li, Hao and Mitra, Niloy and Pauly, Mark and Rusinkiewicz, Szymon and Wand, Michael},
    year = {2011},
    publisher = {The Eurographics Association},
    ISSN = {1017-4656},
    DOI = {10.2312/EG2011/tutorials/t1}
    }
    URI
    http://dx.doi.org/10.2312/EG2011/tutorials/t1
    Collections
    • Tutorials

    Eurographics Association copyright © 2013 - 2022 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA
     

     

    Browse

    All of Eurographics DLCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    BibTeX | TOC

    Create BibTeX Create Table of Contents

    Eurographics Association copyright © 2013 - 2022 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA