A Fully Hierarchical Approach for Finding Correspondences in Non-rigid Shapes

Sipiran, Ivan; Bustos, Benjamin

A Fully Hierarchical Approach for Finding Correspondences in Non-rigid Shapes

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2013

Autor:innen

Sipiran, Ivan

Bustos, Benjamin

DOI (zitierfähiger Link)

https://doi.org/10.1109/ICCV.2013.106

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

2013 IEEE International Conference on Computer Vision. Piscataway, NJ: IEEE, 2013, pp. 817-824. ISBN 978-1-4799-2840-8. Available under: doi: 10.1109/ICCV.2013.106

Zusammenfassung

This paper presents a hierarchical method for finding correspondences in non-rigid shapes. We propose a new representation for 3D meshes: the decomposition tree. This structure characterizes the recursive decomposition process of a mesh into regions of interest and key points. The internal nodes contain regions of interest (which may be recursively decomposed) and the leaf nodes contain the key points to be matched. We also propose a hierarchical matching algorithm that performs in a level-wise manner. The matching process is guided by the similarity between regions in high levels of the tree, until reaching the key points stored in the leaves. This allows us to reduce the search space of correspondences, making also the matching process efficient. We evaluate the effectiveness of our approach using the SHREC'2010 robust correspondence benchmark. In addition, we show that our results outperform the state of the art.

Fachgebiet (DDC)

004 Informatik

Konferenz

2013 IEEE International Conference on Computer Vision (ICCV), 1. Dez. 2013 - 8. Dez. 2013, Sydney, Australia

Zitieren

ISO 690

SIPIRAN, Ivan, Benjamin BUSTOS, 2013. A Fully Hierarchical Approach for Finding Correspondences in Non-rigid Shapes. 2013 IEEE International Conference on Computer Vision (ICCV). Sydney, Australia, 1. Dez. 2013 - 8. Dez. 2013. In: 2013 IEEE International Conference on Computer Vision. Piscataway, NJ: IEEE, 2013, pp. 817-824. ISBN 978-1-4799-2840-8. Available under: doi: 10.1109/ICCV.2013.106

BibTex

@inproceedings{Sipiran2013Fully-42784,
  year={2013},
  doi={10.1109/ICCV.2013.106},
  title={A Fully Hierarchical Approach for Finding Correspondences in Non-rigid Shapes},
  isbn={978-1-4799-2840-8},
  publisher={IEEE},
  address={Piscataway, NJ},
  booktitle={2013 IEEE International Conference on Computer Vision},
  pages={817--824},
  author={Sipiran, Ivan and Bustos, Benjamin}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/42784">
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:issued>2013</dcterms:issued>
    <dc:creator>Sipiran, Ivan</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-07-04T16:54:16Z</dcterms:available>
    <dc:contributor>Sipiran, Ivan</dc:contributor>
    <dc:language>eng</dc:language>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/42784"/>
    <dc:creator>Bustos, Benjamin</dc:creator>
    <dc:contributor>Bustos, Benjamin</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-07-04T16:54:16Z</dc:date>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:abstract xml:lang="eng">This paper presents a hierarchical method for finding correspondences in non-rigid shapes. We propose a new representation for 3D meshes: the decomposition tree. This structure characterizes the recursive decomposition process of a mesh into regions of interest and key points. The internal nodes contain regions of interest (which may be recursively decomposed) and the leaf nodes contain the key points to be matched. We also propose a hierarchical matching algorithm that performs in a level-wise manner. The matching process is guided by the similarity between regions in high levels of the tree, until reaching the key points stored in the leaves. This allows us to reduce the search space of correspondences, making also the matching process efficient. We evaluate the effectiveness of our approach using the SHREC'2010 robust correspondence benchmark. In addition, we show that our results outperform the state of the art.</dcterms:abstract>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:title>A Fully Hierarchical Approach for Finding Correspondences in Non-rigid Shapes</dcterms:title>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja