dc.contributor.author | Liu, Shengjun | en_US |
dc.contributor.author | Xu, Haojun | en_US |
dc.contributor.author | Yan, Dong-Ming | en_US |
dc.contributor.author | Hu, Ling | en_US |
dc.contributor.author | Liu, Xinru | en_US |
dc.contributor.author | Li, Qinsong | en_US |
dc.contributor.editor | Umetani, Nobuyuki | en_US |
dc.contributor.editor | Wojtan, Chris | en_US |
dc.contributor.editor | Vouga, Etienne | en_US |
dc.date.accessioned | 2022-10-04T06:39:28Z | |
dc.date.available | 2022-10-04T06:39:28Z | |
dc.date.issued | 2022 | |
dc.identifier.issn | 1467-8659 | |
dc.identifier.uri | https://doi.org/10.1111/cgf.14656 | |
dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf14656 | |
dc.description.abstract | We propose a novel unsupervised learning approach for computing correspondences between non-rigid 3D shapes. The core idea is that we integrate a novel structural constraint into the deep functional map pipeline, a recently dominant learning framework for shape correspondence, via a powerful spectral manifold wavelet transform (SMWT). As SMWT is isometrically invariant operator and can analyze features from multiple frequency bands, we use the multiscale SMWT results of the learned features as function preservation constraints to optimize the functional map by assuming each frequency-band information of the descriptors should be correspondingly preserved by the functional map. Such a strategy allows extracting significantly more deep feature information than existing approaches which only use the learned descriptors to estimate the functional map. And our formula strongly ensure the isometric properties of the underlying map. We also prove that our computation of the functional map amounts to filtering processes only referring to matrix multiplication. Then, we leverage the alignment errors of intrinsic embedding between shapes as a loss function and solve it in an unsupervised way using the Sinkhorn algorithm. Finally, we utilize DiffusionNet as a feature extractor to ensure that discretization-resistant and directional shape features are produced. Experiments on multiple challenging datasets prove that our method can achieve state-of-the-art correspondence quality. Furthermore, our method yields significant improvements in robustness to shape discretization and generalization across the different datasets. The source code and trained models will be available at https://github.com/HJ-Xu/ WTFM-Layer. | en_US |
dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
dc.subject | CCS Concepts: Computing methodologies → Shape analysis; Matching | |
dc.subject | Computing methodologies → Shape analysis | |
dc.subject | Matching | |
dc.title | WTFM Layer: An Effective Map Extractor for Unsupervised Shape Correspondence | en_US |
dc.description.seriesinformation | Computer Graphics Forum | |
dc.description.sectionheaders | Curves and Meshes | |
dc.description.volume | 41 | |
dc.description.number | 7 | |
dc.identifier.doi | 10.1111/cgf.14656 | |
dc.identifier.pages | 51-61 | |
dc.identifier.pages | 11 pages | |