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
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Shape Matching | SHREC CUTS 2016 (test) | Average Geodesic Error0.018 | 18 | |
| Shape Matching | SHREC HOLES 2016 (test) | Average Geodesic Error0.119 | 18 | |
| Partial Shape Matching | SHREC Cuts 2016 | Mean Geodesic Error (x100)20.9 | 7 | |
| Partial Shape Matching | SHREC Holes 2016 | Mean Geodesic Error (x100)0.228 | 7 | |
| Partial Shape Matching | SCAPE (S-PV) | Mean Geodesic Error (x100)11.5 | 7 | |
| Partial Shape Matching | FAUST-PV | Mean Geodesic Error (x100)15.2 | 6 | |
| Partial Shape Correspondence | PFAUST medium (M) | Avg Geodesic Error (x100)3 | 5 | |
| Partial Shape Correspondence | PFAUST (hard (H)) | Avg Geodesic Error0.068 | 5 | |
| Partial-partial 3D shape matching | CP2P24 | IoU74.17 | 4 | |
| Partial-partial 3D shape matching | PSMAL | IoU73.63 | 4 |