Interactive optimization of near-isometric shape correspondence
Authors: 
Zizhao Wu, Long Zhang, Zixu Yan, Fang Lu, Yigang WangAuthors Info & Claims
Zizhao Wu, Long Zhang, Zixu Yan, Fang Lu, Yigang WangAuthors Info & ClaimsPages 43 - 46
Abstract
In this paper, we present an interactive approach for near-isometric shape correspondence. Our key motivation is that the intention of the users in the correspondence problem is valuable, which helps to not only reduce search space for finding the matching pairs but also increase the accuracy of matching results. In our implementation, a cost matrix is introduced, which is updated according to the constraints given by the users. We then combine the cost matrix with an initial similarity matrix to form a joint matrix, and based on which, we formulate a linear assignment objective function to solve the correspondence problem. The experiments show that our method is fast, intuitive and can produce pleasing results.
References
[1]
Anguelov, D., Srinivasan, P., Koller, D., Thrun, S., Rodgers, J., and Davis, J. 2005. Scape: shape completion and animation of people. ACM Trans. Graph. 24, 3, 408--416.
[2]
Bronstein, A. M., Bronstein, M. M., and Kimme, R. 2006. Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching. In Proceedings of the National Academy of Science, 1168--1172.
[3]
Bronstein, A., Bronstein, M., and Kimmel, R. 2008. Numerical geometry of non-rigid shapes. Springer-Verlag New York Inc.
[4]
Chen, X., Golovinskiy, A., and Funkhouser, T. 2009. A benchmark for 3D mesh segmentation. ACM Transactions on Graphics (Proc. SIGGRAPH) 28, 3 (august).
[5]
Duchenne, O., Bach, F., Kweon, I.-S., and Ponce, J. 2011. A tensor-based algorithm for high-order graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 33, 12, 2383--2395.
[6]
Elad, A., and Kimmel, R. 2001. Bending invariant representations for surfaces. In CVPR, 168--174.
[7]
Hilaga, M., Shinagawa, Y., Komura, T., and Kunii, T. L. 2001. Topology matching for fully automatic similarity estimation of 3d shapes. In SIGGRAPH, 203--212.
[8]
Jain, V., and Zhang, H. 2006. Robust 3d shape correspondence in the spectral domain. In Proc. of Shape Modeling International, 118--129.
[9]
Jiang, H., and Yu, S. X. 2009. Linear solution to scale and rotation invariant object matching. In CVPR, 2474--2481.
[10]
Kolmogorov, V. 2009. Blossom v: a new implementation of a minimum cost perfect matching algorithm. Mathematical Programming Compuatation, 43--67.
[11]
Lipman, Y., and Funkhouser, T. 2009. Möbius voting for surface correspondence. ACM Transactions on Graphics (Proc. SIGGRAPH 2009) 28, 3 (august).
[12]
lp_solve. http://sourceforge.net/projects/lpsolve.
[13]
Ovsjanikov, M., Bronstein, A. M., Bronstein, M. M., and Guibas, L. 2009. Shapegoogle: a computer vision approach for invariant shape retrieval. In Workshop on Non-Rigid Shape Analysis and Deformable Image Alignment (ICCV workshop, NORDIA'09).
[14]
Papadimitriou, C. H., and Steiglitz, K. 1982. Combinatorial optimization: algorithms and complexity. Prentice-Hall, Inc., Upper Saddle River, NJ, USA.
[15]
Sharma, A., and Horaud, R. P. 2010. Shape matching based on diffusion embedding and on mutual isometric consistency. In Proc. Workshop on Nonrigid Shape Analysis and Deformable Image Alignment (NORDIA), 29--36.
[16]
Sharma, A., Horaud, R. P., Cech, J., and Boyer, E. 2011. Topologically-robust 3d shape matching based on diffusion geometry and seed growing. In Proceeding of the IEEE Conference on Computer Vision and Pattern Recognition.
[17]
Sun, J., Ovsjanikov, M., and Guibas, L. 2009. A concise and provably informative multi-scale signature based on heat diffusion. In Eurographics Symposium on Geometry Processing (SGP).
[18]
Tam, G. K. L., Martin, R. R., Rosin, P. L., and Lai, Y.-K. 2014. Diffusion pruning for rapidly and robustly selecting global correspondences using local isometry. ACM Trans. Graph. 33, 1, 4.
[19]
van Kaick, O., Zhang, H., Hamarneh, G., and Cohen-Or, D. 2011. A survey on shape correspondence. Computer Graphics Forum 30, 6.
[20]
Wang, C., Bronstein, M. M., Bronstein, A. M., and Paragios, N. 2011. Discrete minimum distortion correspondence problems for non-rigid shape matching. In Proc. Conf. on Scale Space and Variational Methods in Computer Vision (SSVM).
[21]
Zass, R., and Shashua, A. 2008. Probabilistic graph and hypergraph matching. In CVPR.
Index Terms
- Interactive optimization of near-isometric shape correspondence
Recommendations
Deformation-driven shape correspondence via shape recognition
Many approaches to shape comparison and recognition start by establishing a shape correspondence. We "turn the table" and show that quality shape correspondences can be obtained by performing many shape recognition tasks. What is more, the method we ...
Hierarchical Spherical Deformation for Shape Correspondence
Medical Image Computing and Computer Assisted Intervention – MICCAI 2018AbstractWe present novel spherical deformation for a landmark-free shape correspondence in a group-wise manner. In this work, we aim at both addressing template selection bias and minimizing registration distortion in a single framework. The proposed ...
Deformation-driven topology-varying 3D shape correspondence
We present a deformation-driven approach to topology-varying 3D shape correspondence. In this paradigm, the best correspondence between two shapes is the one that results in a minimal-energy, possibly topology-varying, deformation that transforms one ...
Comments
Information & Contributors
Information
Published In
November 2014
246 pages
ISBN:9781450332545
DOI:10.1145/2670473
- General Chairs:
- Xiaogang Jin,
- Nadia Magnenat-Thalmann,
- Hyun Seung Yang,
- Program Chairs:
- Xubo Yang,
- Tomasz Bednarz,
- Issei Fujishiro
Copyright © 2014 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 30 November 2014
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
VRCAI 2014
Sponsor:
VRCAI 2014: 13th ACM International Conference on Virtual Reality Continuum and Its Applications in Industry
November 30 - December 2, 2014
Shenzhen, China
Acceptance Rates
Overall Acceptance Rate 51 of 107 submissions, 48%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 102Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 26 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in