Papers › DPC: Unsupervised Deep Point Correspondence via Cross and Self Construction

DPC: Unsupervised Deep Point Correspondence via Cross and Self Construction

16 Oct 2021arXiv:2110.08636archive 2025-07-28

Itai Lang, Dvir Ginzburg, Shai Avidan, Dan Raviv

We present a new method for real-time non-rigid dense correspondence between point clouds based on structured shape construction. Our method, termed Deep Point Correspondence (DPC), requires a fraction of the training data compared to previous techniques and presents better generalization capabilities. Until now, two main approaches have been suggested for the dense correspondence problem. The first is a spectral-based approach that obtains great results on synthetic datasets but requires mesh connectivity of the shapes and long inference processing time while being unstable in real-world scenarios. The second is a spatial approach that uses an encoder-decoder framework to regress an ordered point cloud for the matching alignment from an irregular input. Unfortunately, the decoder brings considerable disadvantages, as it requires a large amount of training data and struggles to generalize well in cross-dataset evaluations. DPC's novelty lies in its lack of a decoder component. Instead, we use latent similarity and the input coordinates themselves to construct the point cloud and determine correspondence, replacing the coordinate regression done by the decoder. Extensive experiments show that our construction scheme leads to a performance boost in comparison to recent state-of-the-art correspondence methods. Our code is publicly available at https://github.com/dvirginz/DPC.

PaperPDFCode

Code

dvirginz/dpc officialmentioned in papermentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

3D Dense Shape CorrespondenceDecoder

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
3D Dense Shape Correspondence SHREC'19 DPC Accuracy at 1% 15.3 #5 of 11 Archive leaderboard report
3D Dense Shape Correspondence SHREC'19 DPC Euclidean Mean Error (EME) 5.6 #5 of 11 Archive leaderboard report
3D Dense Shape Correspondence SHREC'19 DPC (Trained on Surreal) Accuracy at 1% 17.7 #6 of 11 Archive leaderboard report
3D Dense Shape Correspondence SHREC'19 DPC (Trained on Surreal) Euclidean Mean Error (EME) 6.1 #6 of 11 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections