Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

DPFM: Deep Partial Functional Maps

About

We consider the problem of computing dense correspondences between non-rigid shapes with potentially significant partiality. Existing formulations tackle this problem through heavy manifold optimization in the spectral domain, given hand-crafted shape descriptors. In this paper, we propose the first learning method aimed directly at partial non-rigid shape correspondence. Our approach uses the functional map framework, can be trained in a supervised or unsupervised manner, and learns descriptors directly from the data, thus both improving robustness and accuracy in challenging cases. Furthermore, unlike existing techniques, our method is also applicable to partial-to-partial non-rigid matching, in which the common regions on both shapes are unknown a priori. We demonstrate that the resulting method is data-efficient, and achieves state-of-the-art results on several benchmark datasets. Our code and data can be found online: https://github.com/pvnieo/DPFM

Souhaib Attaiki, Gautam Pai, Maks Ovsjanikov• 2021

Related benchmarks

TaskDatasetResultRank
Shape MatchingSHREC HOLES 2016 (test)
Average Geodesic Error0.119
26
Shape MatchingSHREC CUTS 2016 (test)
Average Geodesic Error0.018
22
Overlapping Region PredictionPARTIALSMAL
mIoU73.67
7
Partial Shape MatchingSHREC Cuts 2016
Mean Geodesic Error (x100)20.9
7
Partial Shape MatchingSHREC Holes 2016
Mean Geodesic Error (x100)0.228
7
Partial Shape MatchingSCAPE (S-PV)
Mean Geodesic Error (x100)11.5
7
Partial Shape MatchingFAUST-PV
Mean Geodesic Error (x100)15.2
6
Partial Shape CorrespondencePFAUST medium (M)
Avg Geodesic Error (x100)3
5
Partial Shape CorrespondencePFAUST (hard (H))
Avg Geodesic Error0.068
5
Partial-to-partial overlap predictionBeCoS
Balanced Accuracy65.1
4
Showing 10 of 14 rows

Other info

Follow for update