Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Intrinsic Shape Matching by Planned Landmark Sampling

Tevs, A., Berner, A., Wand, M., Ihrke, I., & Seidel, H.-P. (2011). Intrinsic Shape Matching by Planned Landmark Sampling. Computer Graphics Forum, 30(2), 543-552. doi:10.1111/j.1467-8659.2011.01879.x.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-0010-13C7-0 Versions-Permalink: https://hdl.handle.net/21.11116/0000-000E-304F-4
Genre: Zeitschriftenartikel

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Tevs, Art1, Autor           
Berner, Alexander1, Autor           
Wand, Michael1, Autor           
Ihrke, Ivo1, 2, Autor           
Seidel, Hans-Peter1, Autor                 
Affiliations:
1Computer Graphics, MPI for Informatics, Max Planck Society, ou_40047              
2Graphics - Optics - Vision, MPI for Informatics, Max Planck Society, ou_1116549              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have been particularly successful due to their generality and efficiency. We introduce a new sampling-based shape matching algorithm that uses a planning step to find optimized "landmark" points. These points are matched first in order to maximize the information gained and thus minimize the sampling costs. Our approach makes three main contributions: First, the new technique leads to a significant improvement in performance, which we demonstrate on a number of benchmark scenarios. Second, our technique does not require any keypoint detection. This is often a significant limitation for models that do not show sufficient surface features. Third, we examine the actual numerical degrees of freedom of the matching problem for a given piece of geometry. In contrast to previous results, our estimates take into account unprecise geodesics and potentially numerically unfavorable geometry of general topology, giving a more realistic complexity estimate.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2012-03-062011
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: Expertenbegutachtung
 Identifikatoren: eDoc: 618855
DOI: 10.1111/j.1467-8659.2011.01879.x
BibTex Citekey: TevsEG2011
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Computer Graphics Forum
Genre der Quelle: Zeitschrift
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: Oxford, UK : Blackwell
Seiten: - Band / Heft: 30 (2) Artikelnummer: - Start- / Endseite: 543 - 552 Identifikator: -

Quelle 2

einblenden:
ausblenden:
Titel: EUROGRAPHICS 2011
  Kurztitel : EUROGRAPHICS 2011
  Untertitel : The European Association for Computer Graphics 32nd Annual Conference ; Llandudno in Wales, UK, April 11th - 15th, 2011
  Andere : EG 2011
Genre der Quelle: Konferenzband
 Urheber:
Chen, Min1, Herausgeber
Deussen, Oliver1, Herausgeber
Affiliations:
1 External Organizations, ou_persistent22            
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: - Identifikator: -