Correspondences of persistent feature points on near-isometric surfaces

Authors:
Ying Yang;David Günther;Stefanie Wuhrer;Alan Brunton;Ioannis Ivrissimtzis;Hans-Peter Seidel;Tino Weinkauf
Affiliations:
MPI Informatik, Saarbrücken, Germany,Durham University, Durham, UK;MPI Informatik, Saarbrücken, Germany,Saarland University, Saarbrücken, Germany;Saarland University, Saarbrücken, Germany,MPI Informatik, Saarbrücken, Germany;Saarland University, Saarbrücken, Germany,University of Ottawa, Ottawa, Canada;Durham University, Durham, UK;MPI Informatik, Saarbrücken, Germany;MPI Informatik, Saarbrücken, Germany
Venue:
ECCV'12 Proceedings of the 12th international conference on Computer Vision - Volume Part I
Year:
2012

Citing 11
Cited 0

Estimating differential quantities using polynomial fitting of osculating jets

Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Fast exact and approximate geodesics on meshes

ACM SIGGRAPH 2005 Papers
A Spectral Technique for Correspondence Problems Using Pairwise Constraints

ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
A 3D Facial Expression Database For Facial Behavior Research

FGR '06 Proceedings of the 7th International Conference on Automatic Face and Gesture Recognition
Numerical Geometry of Non-Rigid Shapes

Numerical Geometry of Non-Rigid Shapes
Möbius voting for surface correspondence

ACM SIGGRAPH 2009 papers
Deformation-driven shape correspondence

SGP '08 Proceedings of the Symposium on Geometry Processing
Non-rigid registration under isometric deformations

SGP '08 Proceedings of the Symposium on Geometry Processing
A concise and provably informative multi-scale signature based on heat diffusion

SGP '09 Proceedings of the Symposium on Geometry Processing
Blended intrinsic maps

ACM SIGGRAPH 2011 papers
Theory and Algorithms for Constructing Discrete Morse Complexes from Grayscale Digital Images

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a full pipeline for finding corresponding points between two surfaces based on conceptually simple and computationally efficient components. Our pipeline begins with robust and stable extraction of feature points from the surfaces. We then find a set of near isometric correspondences between the feature points by solving an optimization problem using established components. The performance is evaluated on a large number of 3D models from the following perspectives: robustness w.r.t. isometric deformation, robustness w.r.t. noise and incomplete surfaces, partial matching, and anisometric deformation.