Papers › A Comparative Study of Graph Matching Algorithms in Computer Vision
A Comparative Study of Graph Matching Algorithms in Computer Vision
Stefan Haller, Lorenz Feineis, Lisa Hutschenreiter, Florian Bernard, Carsten Rother, Dagmar Kainmüller, Paul Swoboda, Bogdan Savchynskyy
The graph matching optimization problem is an essential component for many tasks in computer vision, such as bringing two deformable objects in correspondence. Naturally, a wide range of applicable algorithms have been proposed in the last decades. Since a common standard benchmark has not been developed, their performance claims are often hard to verify as evaluation on differing problem instances and criteria make the results incomparable. To address these shortcomings, we present a comparative study of graph matching algorithms. We create a uniform benchmark where we collect and categorize a large set of existing and publicly available computer vision graph matching problems in a common format. At the same time we collect and categorize the most popular open-source implementations of graph matching algorithms. Their performance is evaluated in a way that is in line with the best practices for comparing optimization algorithms. The study is designed to be reproducible and extensible to serve as a valuable resource in the future. Our study provides three notable insights: 1.) popular problem instances are exactly solvable in substantially less than 1 second and, therefore, are insufficient for future empirical evaluations; 2.) the most popular baseline methods are highly inferior to the best available methods; 3.) despite the NP-hardness of the problem, instances coming from vision applications are often solvable in a few seconds even for graphs with more than 500 vertices.
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):
get_harvested_code_for_paper(arxiv_id="2207.00291")get_code(code_sha256="…")with a sample'scode_sha256from the list belowget_citation_path(paper_1="2207.00291", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="2207.00291")
Code
Syntology 22 code samples harvested from 1 repository linked to this paper: 22 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 0 violated, 21 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; failures of Syntology's instrument, not of the code.
By repository: official repository: 22 samples from 1 repository, 22 ran (21 with no instrument failure; 1 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.
No sample is linked to this paper from 1 of its repositories that Syntology harvested for other papers:
- vislearn/libmpopt, community (archive-listed): harvested for another paper, listed under the repository
Levels written between 2026-09-22 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.
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.
A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.
Code Syntology ran Syntology
22 samples harvested: 22 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 0 violated, 21 with no contract checked; 1 where Syntology's instrument failed) · 0 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.
Licence: 0 of the 22 samples are 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 vislearn/gmbench. “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.
a699801fd94d79f9 · report
fixture: signature assignment:list/1/int · returned list · level recorded 2026-09-25 a2e05f3e195e35e1 · report
fixture: signature value:NoneType/0/? · returned float · level recorded 2026-09-25 f89988646272041a · report
fixture: signature method_data:dict/0/?, max_perf_ratio:float/0/float · returned float · level recorded 2026-09-25 9e51883f9e53fa97 · report
fixture: signature method_data:dict/0/? · returned float · level recorded 2026-09-25 8afcb50b4993347c · report
fixture: signature db:callable/0/?, run_id:int/0/int, dataset_id:int/0/int, max_perf_ratio:float/0/float, min_runtime:float/0/float, optimality_tolerance:float/0/float · returned dict · level recorded 2026-09-25 f8ad7fbd8e8b0d80 · report
fixture: signature value:str/0/str · returned dict · level recorded 2026-09-25 8d957e3e9c68e6a6 · report
fixture: signature v:int/0/int · returned bool · level recorded 2026-09-25 b4436e9c7a69bc88 · report
fixture: signature db:callable/0/?, hardware:str/0/str · returned int · level recorded 2026-09-25 698c78a80ac5ab35 · report
fixture: signature db:callable/0/?, run_id:int/0/int, method:str/0/str, dataset:str/0/str, checkpoint:str/0/str · returned Result · level recorded 2026-09-25 422c465477a639b9 · report
fixture: signature subparsers:callable/0/? · returned ArgumentParser · level recorded 2026-09-25 25a24527466b0037 · report
fixture: signature subparsers:callable/0/? · returned ArgumentParser · level recorded 2026-09-25 dd55277f60012391 · report
fixture: signature subparsers:MockSubparsers/0/? · returned ArgumentParser · level recorded 2026-09-25 e4882065c0be13f4 · report
fixture: signature subparsers:MockSubparsers/0/? · returned ArgumentParser · level recorded 2026-09-25 f1b899fcdb5fb448 · report
fixture: signature subparsers:MockSubparsers/0/? · returned ArgumentParser · level recorded 2026-09-25 dd52eec8897ae8e1 · report
fixture: signature subparsers:callable/0/? · returned ArgumentParser · level recorded 2026-09-25 c37bbbd3f9f1a1c2 · report
fixture: signature subparsers:MockSubparsers/0/? · returned ArgumentParser · level recorded 2026-09-25 726cad3d8f3c2da3 · report
fixture: signature method_data:dict/0/? · returned tuple · level recorded 2026-09-25 848358a4327596b7 · report
fixture: signature db:callable/0/?, run_id:int/0/int · returned tuple · level recorded 2026-09-25 9c7771a3a2e3c00f · report
fixture: signature db:callable/0/?, run_id:int/0/int · returned tuple · level recorded 2026-09-25 2842a1369540b274 · report
fixture: signature db:callable/0/?, run_id:int/0/int · returned tuple · level recorded 2026-09-25 1677ad306233c7b7 · report
fixture: signature l:list/1/str · returned list · level recorded 2026-09-22 ea9cacb97f9a2f4b · report
fixture: signature filename:str/0/str · returned dict · level recorded 2026-09-25 Tasks
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