Papers › Unsupervised Deep Learning for Structured Shape Matching

Unsupervised Deep Learning for Structured Shape Matching

10 Dec 2018ICCV 2019 10arXiv:1812.03794archive 2025-07-28

Jean-Michel Roufosse, Abhishek Sharma, Maks Ovsjanikov

We present a novel method for computing correspondences across 3D shapes using unsupervised learning. Our method computes a non-linear transformation of given descriptor functions, while optimizing for global structural properties of the resulting maps, such as their bijectivity or approximate isometry. To this end, we use the functional maps framework, and build upon the recent FMNet architecture for descriptor learning. Unlike that approach, however, we show that learning can be done in a purely unsupervised setting, without having access to any ground truth correspondences. This results in a very general shape matching method that we call SURFMNet for Spectral Unsupervised FMNet, and which can be used to establish correspondences within 3D shape collections without any prior information. We demonstrate on a wide range of challenging benchmarks, that our approach leads to state-of-the-art results compared to the existing unsupervised methods and achieves results that are comparable even to the supervised learning techniques. Moreover, our framework is an order of magnitude faster, and does not rely on geodesic distance computation or expensive post-processing.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 15 code samples harvested from 3 repositories linked to this paper: 11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: named in the paper: 1 sample from 1 repository, 0 ran (0 with no instrument failure; 0 where Syntology's instrument failed); community (archive-listed): 14 samples from 2 repositories, 11 ran (11 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-24 and 2026-09-26 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

LIX-shape-analysis/SURFMNet mentioned in papertfSyntology: 1 sample, 0 ran · 1 unverified report
JM-data/Unsupervised_DeepFunctionalMaps mentioned on GitHubtfMITSyntology: 9 samples, 6 ran (0 instrument-failed) · 3 unverified report
JM-data/Unsupervised_FMnet mentioned on GitHubtfMITSyntology: not harvested report
pvnieo/SURFMNet-pytorch pytorchMITSyntology: 5 samples, 5 ran (0 instrument-failed) · 0 unverified 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

15 samples harvested: 11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

11ran
4unverified

Licence: 1 of the 15 samples is pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 3 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

LIX-shape-analysis/SURFMNet named in the paper 1 sample, 0 ran · 1 unverified
get_pair_from_ram train_DFMnet.py unverified no licence file found · pointer only · 338b9892d0ce403d · report
JM-data/Unsupervised_DeepFunctionalMaps community (archive-listed) 9 samples, 6 ran (0 instrument-failed) · 3 unverified
cotLaplacian Calculate_LB/laplace_beltrami.py ran MIT (permissive) · 51ad4af0cf54d9e8 · report fixture: signature S:dict/0/? · returned tuple · level recorded 2026-09-26
cotangent Calculate_LB/laplace_beltrami.py ran fingerprinted MIT (permissive) · e10efc113abf3b87 · report fixture: signature p:ndarray/1/float · returned ndarray · level recorded 2026-09-26
eigs_WA Calculate_LB/laplace_beltrami.py ran MIT (permissive) · 340df3d87662b40c · report fixture: signature W:csr_matrix/2/float, A:csr_matrix/2/float, numEig:int/0/int · returned tuple · level recorded 2026-09-26
penalty_bijectivity loss_DFMnet.py ran MIT (permissive) · 5a8ff1aa0da06581 · report fixture: signature C_est_AB:EagerTensor/2/float, C_est_BA:EagerTensor/2/float · returned SymbolicTensor · level recorded 2026-09-26
penalty_ortho loss_DFMnet.py ran MIT (permissive) · a563b9f31e1e30aa · report fixture: signature C_est:EagerTensor/3/float · returned SymbolicTensor · level recorded 2026-09-26
readOFF Calculate_LB/readOFF.py ran MIT (permissive) · 6757de5550e950dc · report fixture: signature file:str/0/str · returned dict · level recorded 2026-09-26
penalty_laplacian_commutativity loss_DFMnet.py unverified MIT (permissive) · 7adb92d793ad88cf · report
res_layer DFMnet.py unverified MIT (permissive) · e4f12f487c53f8f5 · report
solve_ls DFMnet.py unverified MIT (permissive) · a4b744832121dbb8 · report
pvnieo/SURFMNet-pytorch community (archive-listed) 5 samples, 5 ran (0 instrument-failed) · 0 unverified
cotangent_laplacian surfmnet/utils/laplace_decomposition.py ran MIT (permissive) · ed74e081622fecee · report fixture: signature verts:ndarray/2/float, faces:ndarray/2/int · returned tuple · level recorded 2026-09-26
laplace_decomposition surfmnet/utils/laplace_decomposition.py ran MIT (permissive) · dc6041ee340ec8bc · report fixture: signature verts:ndarray/2/float, faces:ndarray/2/int, neig:int/0/int · returned tuple · level recorded 2026-09-26
read_off in 6 papers surfmnet/utils/io.py ran MIT (permissive) · 8447cdc2929b54cc · report fixture: signature file:str/0/str · returned tuple · level recorded 2026-09-24
read_ply in 16 papers surfmnet/utils/io.py ran MIT (permissive) · 5afbd385bcee8a31 · report fixture: signature file:str/0/str · returned tuple · level recorded 2026-09-26
read_txt in 41 papers surfmnet/utils/io.py ran MIT (permissive) · 46dafa7e789c8ed9 · report fixture: signature file:str/0/str · returned tuple · level recorded 2026-09-25

Tasks

Deep Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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