A Genetic Isometric Shape Correspondence Algorithm with Adaptive Sampling
Author:
Open Access
- 23 October 2018
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 37 (5) , 1-14
Abstract
We exploit the permutation creation ability of genetic optimization to find the permutation of one point set that puts it into correspondence with another one. To this end, we provide a genetic algorithm for the 3D shape correspondence problem, which is the main contribution of this article. As another significant contribution, we present an adaptive sampling approach that relocates the matched points based on the currently available correspondence via an alternating optimization. The point sets to be matched are sampled from two isometric (or nearly isometric) shapes. The sparse one-to-one correspondence, i.e., bijection, that we produce is validated both in terms of running time and accuracy in a comprehensive test suite that includes four standard shape benchmarks and state-of-the-art techniques.Keywords
Funding Information
- TÜBİTAK (EEEAG-115E471)
This publication has 62 references indexed in Scilit:
- Bilateral Maps for Partial MatchingComputer Graphics Forum, 2013
- Blended intrinsic mapsACM Transactions on Graphics, 2011
- Parallel Poisson disk sampling with spectrum analysis on surfacesACM Transactions on Graphics, 2010
- Multimodal genetic algorithms-based algorithm for automatic point correspondencePattern Recognition, 2010
- SCAPEACM Transactions on Graphics, 2005
- Surface registration using a dynamic genetic algorithmPattern Recognition, 2004
- Structural pattern recognition using genetic algorithmsPattern Recognition, 2002
- Least-commitment graph matching with genetic algorithmsPattern Recognition, 2001
- A new genetic-based technique for matching 3-D curves and surfacesPattern Recognition, 1999
- Generation and Classification of Structural Topologies With Genetic Algorithm SpeciationJournal of Mechanical Design, 1997