Implicit Field Supervision for Robust Non-Rigid Shape Matching
Abstract
Establishing a correspondence between two non-rigidly deforming shapes is one of the most fundamental problems in visual computing. Existing methods often show weak resilience when presented with challenges innate to real-world data such as noise, outliers, self-occlusion etc. On the other hand, auto-decoders have demonstrated strong expressive power in learning geometrically meaningful latent embeddings. However, their use in shape analysis has been limited. In this paper, we introduce an approach based on an auto-decoder framework, that learns a continuous shape-wise deformation field over a fixed template. By supervising the deformation field for points on-surface and regularizing for points off-surface through a novel Signed Distance Regularization (SDR), we learn an alignment between the template and shape volumes. Trained on clean water-tight meshes, without any data-augmentation, we demonstrate compelling performance on compromised data and real-world scans.
Cite
Text
Sundararaman et al. "Implicit Field Supervision for Robust Non-Rigid Shape Matching." Proceedings of the European Conference on Computer Vision (ECCV), 2022. doi:10.1007/978-3-031-20062-5_20Markdown
[Sundararaman et al. "Implicit Field Supervision for Robust Non-Rigid Shape Matching." Proceedings of the European Conference on Computer Vision (ECCV), 2022.](https://mlanthology.org/eccv/2022/sundararaman2022eccv-implicit/) doi:10.1007/978-3-031-20062-5_20BibTeX
@inproceedings{sundararaman2022eccv-implicit,
title = {{Implicit Field Supervision for Robust Non-Rigid Shape Matching}},
author = {Sundararaman, Ramana and Pai, Gautam and Ovsjanikov, Maks},
booktitle = {Proceedings of the European Conference on Computer Vision (ECCV)},
year = {2022},
doi = {10.1007/978-3-031-20062-5_20},
url = {https://mlanthology.org/eccv/2022/sundararaman2022eccv-implicit/}
}