{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/alternating-direction-graph-matching","title":"Alternating Direction Graph Matching","arxiv_id":"1611.07583","date":"2016-11-22","proceeding":"CVPR 2017 7","authors":["D. Khuê Lê-Huu","Nikos Paragios"],"abstract":"In this paper, we introduce a graph matching method that can account for\nconstraints of arbitrary order, with arbitrary potential functions. Unlike\nprevious decomposition approaches that rely on the graph structures, we\nintroduce a decomposition of the matching constraints. Graph matching is then\nreformulated as a non-convex non-separable optimization problem that can be\nsplit into smaller and much-easier-to-solve subproblems, by means of the\nalternating direction method of multipliers. The proposed framework is modular,\nscalable, and can be instantiated into different variants. Two instantiations\nare studied exploring pairwise and higher-order constraints. Experimental\nresults on widely adopted benchmarks involving synthetic and real examples\ndemonstrate that the proposed solutions outperform existing pairwise graph\nmatching methods, and competitive with the state of the art in higher-order\nsettings.","url_abs":"http://arxiv.org/abs/1611.07583v4","url_pdf":"http://arxiv.org/pdf/1611.07583v4.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"alternating-direction-graph-matching","repo_url":"https://github.com/netw0rkf10w/adgm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"alternating-direction-graph-matching","repo_url":"https://github.com/netw0rkf10w/pyADGM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"graph-matching","task_name":"Graph Matching"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1611.07583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.07583"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/netw0rkf10w/adgm","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/netw0rkf10w/pyADGM","reach":null}],"summary":{"ran_fixture":2,"unverified":1},"by_repo_kind":{"listed":{"samples":3,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"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"},"n_pointer_only_for_licence":3,"samples":[{"code_sha256_prefix":"5d85e989f7a9bd27","entry":"ADGM","repo":"netw0rkf10w/pyADGM","repo_kind":"listed","path":"adgm/adgm.py","file_url":"https://github.com/netw0rkf10w/pyADGM/blob/HEAD/adgm/adgm.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"5d85e989f7a9bd27"}},{"code_sha256_prefix":"2b0178d68b839409","entry":"rounding","repo":"netw0rkf10w/pyADGM","repo_kind":"listed","path":"adgm/adgm.py","file_url":"https://github.com/netw0rkf10w/pyADGM/blob/HEAD/adgm/adgm.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"2b0178d68b839409"}},{"code_sha256_prefix":"f717c11ec09bbb19","entry":"ADGM_DenseMatches_Old","repo":"netw0rkf10w/pyADGM","repo_kind":"listed","path":"adgm/adgm.py","file_url":"https://github.com/netw0rkf10w/pyADGM/blob/HEAD/adgm/adgm.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"f717c11ec09bbb19"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}