NCP: Neural Correspondence Prior for Effective Unsupervised Shape Matching

Souhaib Attaiki, Maks Ovsjanikov
1/14/2023
cs.CVcs.GR

Official code: pvnieo/NCP (7 stars, GPL-2.0, PyTorch, last commit 2024-04-27).

Abstract

We present Neural Correspondence Prior (NCP), a new paradigm for computing correspondences between 3D shapes. Our approach is fully unsupervised and can lead to high-quality correspondences even in challenging cases such as sparse point clouds or non-isometric meshes, where current methods fail. Our first key observation is that, in line with neural priors observed in other domains, recent network architectures on 3D data, even without training, tend to produce pointwise features that induce plausible maps between rigid or non-rigid shapes. Secondly, we show that given a noisy map as input, training a feature extraction network with the input map as supervision tends to remove artifacts from the input and can act as a powerful correspondence denoising mechanism, both between individual pairs and within a collection. With these observations in hand, we propose a two-stage unsupervised paradigm for shape matching by (i) performing unsupervised training by adapting an existing approach to obtain an initial set of noisy matches, and (ii) using these matches to train a network in a supervised manner. We demonstrate that this approach significantly improves the accuracy of the maps, especially when trained within a collection. We show that NCP is data-efficient, fast, and achieves state-of-the-art results on many tasks. Our code can be found online: https://github.com/pvnieo/NCP.

View on arXivView PDF

Code Implementations(1)

pvnieo/NCPOfficial100%
PyTorchGPL-2.0

Pytorch code for "NCP: Neural Correspondence Prior for Effective Unsupervised Shape Matching" - NeurIPS 2022

70Python, Jupyter NotebookOct 5, 20222 years agoGPL-2.0
pytorch

Similar Papers

Cite this paper

@article{attaiki2023ncp,
  title  = {NCP: Neural Correspondence Prior for Effective Unsupervised Shape Matching},
  author = {Souhaib Attaiki and Maks Ovsjanikov},
  year   = {2023},
  eprint = {2301.05839},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2301.05839v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2301.05839.svg)](https://codeofpaper.com/paper/2301.05839)

Discussion