MPI-INF D4 Publications: Journal Article: Intrinsic Shape Matching by Planned Landmark Sampling

Journal Article
@Article
Artikel in Fachzeitschrift

Show entries of:

this year (2013) | last year (2012) | two years ago (2011) | Notes URL

Action:

Options:

Goto entry point

Author, Editor(s)

Author(s):

Tevs, Art
Berner, Alexander
Wand, Michael
Ihrke, Ivo
Seidel, Hans-Peter

dblp
dblp
dblp
dblp
dblp

BibTeX cite key*:

TevsEG2011

Title

Title*:

Intrinsic Shape Matching by Planned Landmark Sampling

Journal

Journal Title*:	Computer Graphics Forum (Proc. EUROGRAPHICS 2011)	Journal's URL:
Download URL for the article:	http://dx.doi.org/10.1111/j.1467-8659.2011.01879.x	Language:	English

Publisher

Publisher's Name:	Blackwell	Publisher's URL:
Publisher's Address:	Oxford, UK	ISSN:

Vol, No, pp, Date

Volume*:	30	Number:	2
Publishing Date:	2011
Pages*:	543-552	Number of VG Pages:	10
Page Start:	543	Page End:	552
Sequence Number:		DOI:	10.1111/j.1467-8659.2011.01879.x

Note:
(LaTeX) Abstract:	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.
URL for the Abstract:
Categories, Keywords:	shape matching, registration, landmarks, ransac, entropy, plansac
HyperLinks / References / URLs:
Copyright Message:
Personal Comments:
Download Access Level:	Public

Correlation

MPG Unit:	Max-Planck-Institut für Informatik

MPG Subunit:	Computer Graphics Group
Audience:	popular
Appearance:	MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort

BibTeX Entry:

@ARTICLE{TevsEG2011,
AUTHOR = {Tevs, Art and Berner, Alexander and Wand, Michael and Ihrke, Ivo and Seidel, Hans-Peter},
EDITOR = {Chen, M. and Deussen, O.},
TITLE = {Intrinsic Shape Matching by Planned Landmark Sampling},
BOOKTITLE = {Computer Graphics Forum, Proceedings Eurographics 2011},
JOURNAL = {Computer Graphics Forum (Proc. EUROGRAPHICS 2011)},
PUBLISHER = {Blackwell},
YEAR = {2011},
NUMBER = {2},
VOLUME = {30},
PAGES = {543--552},
ADDRESS = {Wales, England},
DOI = {10.1111/j.1467-8659.2011.01879.x},
}

Entry last modified by Michael Wand, 02/04/2013

Edit History (please click the blue arrow to see the details)

Attachment Section