Abstract
We introduce a novel approach for computing high quality point-to-point maps among a collection of related shapes. The proposed approach takes as input a sparse set of imperfect initial maps between pairs of shapes and builds a compact data structure which implicitly encodes an improved set of maps between all pairs of shapes. These maps align well with point correspondences selected from initial maps; they map neighboring points to neighboring points; and they provide cycle-consistency, so that map compositions along cycles approximate the identity map.
The proposed approach is motivated by the fact that a complete set of maps between all pairs of shapes that admits nearly perfect cycle-consistency are highly redundant and can be represented by compositions of maps through a single base shape. In general, multiple base shapes are needed to adequately cover a diverse collection. Our algorithm sequentially extracts such a small collection of base shapes and creates correspondences from each of these base shapes to all other shapes. These correspondences are found by global optimization on candidate correspondences obtained by diffusing initial maps. These are then used to create a compact graphical data structure from which globally optimal cycle-consistent maps can be extracted using simple graph algorithms.
Experimental results on benchmark datasets show that the proposed approach yields significantly better results than state-of-the-art data-driven shape matching methods.
Funder
National Science Foundation
Office of Naval Research
Ministry of Science and Technology of the People's Republic of China
National Natural Science Foundation of China
Division of Computing and Communication Foundations
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design
Cited by
51 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Pose Synchronization under Multiple Pair-wise Relative Poses;2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR);2023-06
2. Kernel embedding transformation learning for graph matching;Pattern Recognition Letters;2022-11
3. Category-level Part-based 3D Object Non-rigid Registration;Proceedings of the 17th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications;2022
4. Scalable Cluster-Consistency Statistics for Robust Multi-Object Matching;2021 International Conference on 3D Vision (3DV);2021-12
5. Dual Calibration Mechanism Based L2, p-Norm for Graph Matching;IEEE Transactions on Circuits and Systems for Video Technology;2021-06