{"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/partial-to-partial-shape-matching-with","title":"Partial-to-Partial Shape Matching with Geometric Consistency","arxiv_id":"2404.12209","date":"2024-04-18","proceeding":"CVPR 2024 1","authors":["Viktoria Ehm","Maolin Gao","Paul Roetzer","Marvin Eisenberger","Daniel Cremers","Florian Bernard"],"abstract":"Finding correspondences between 3D shapes is an important and long-standing problem in computer vision, graphics and beyond. A prominent challenge are partial-to-partial shape matching settings, which occur when the shapes to match are only observed incompletely (e.g. from 3D scanning). Although partial-to-partial matching is a highly relevant setting in practice, it is rarely explored. Our work bridges the gap between existing (rather artificial) 3D full shape matching and partial-to-partial real-world settings by exploiting geometric consistency as a strong constraint. We demonstrate that it is indeed possible to solve this challenging problem in a variety of settings. For the first time, we achieve geometric consistency for partial-to-partial matching, which is realized by a novel integer non-linear program formalism building on triangle product spaces, along with a new pruning algorithm based on linear integer programming. Further, we generate a new inter-class dataset for partial-to-partial shape-matching. We show that our method outperforms current SOTA methods on both an established intra-class dataset and our novel inter-class dataset.","url_abs":"https://arxiv.org/abs/2404.12209v2","url_pdf":"https://arxiv.org/pdf/2404.12209v2.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":"partial-to-partial-shape-matching-with","repo_url":"https://github.com/vikiehm/gc-ppsm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"partial-to-partial-shape-matching-with","repo_url":"https://github.com/dongliangcao/unsupervised-learning-of-robust-spectral-shape-matching","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[],"methods":[{"method_slug":"pruning","method_name":"Pruning"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2404.12209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.12209"}},"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/dongliangcao/unsupervised-learning-of-robust-spectral-shape-matching","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/vikiehm/gc-ppsm","reach":null}],"summary":{"ran":2,"ran_draft_wrong":2,"unverified":1},"by_repo_kind":{"official":{"samples":1,"ran":0,"repositories":1},"listed":{"samples":4,"ran":4,"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":1,"samples":[{"code_sha256_prefix":"ec6346664655f9f9","entry":"Registry","repo":"dongliangcao/unsupervised-learning-of-robust-spectral-shape-matching","repo_kind":"listed","path":"networks/fmap_network.py","file_url":"https://github.com/dongliangcao/unsupervised-learning-of-robust-spectral-shape-matching/blob/HEAD/networks/fmap_network.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ec6346664655f9f9"}},{"code_sha256_prefix":"80e853913e035976","entry":"RegularizedFMNet","repo":"dongliangcao/unsupervised-learning-of-robust-spectral-shape-matching","repo_kind":"listed","path":"networks/fmap_network.py","file_url":"https://github.com/dongliangcao/unsupervised-learning-of-robust-spectral-shape-matching/blob/HEAD/networks/fmap_network.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"80e853913e035976"}},{"code_sha256_prefix":"d625369a20308f61","entry":"_get_mask","repo":"dongliangcao/unsupervised-learning-of-robust-spectral-shape-matching","repo_kind":"listed","path":"networks/fmap_network.py","file_url":"https://github.com/dongliangcao/unsupervised-learning-of-robust-spectral-shape-matching/blob/HEAD/networks/fmap_network.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"d625369a20308f61"}},{"code_sha256_prefix":"aee5b68c94193ed9","entry":"get_mask","repo":"dongliangcao/unsupervised-learning-of-robust-spectral-shape-matching","repo_kind":"listed","path":"networks/fmap_network.py","file_url":"https://github.com/dongliangcao/unsupervised-learning-of-robust-spectral-shape-matching/blob/HEAD/networks/fmap_network.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"aee5b68c94193ed9"}},{"code_sha256_prefix":"2ed558337f6bd190","entry":"get_best_matching","repo":"vikiehm/gc-ppsm","repo_kind":"official","path":"processing/gen_high_res_mat.py","file_url":"https://github.com/vikiehm/gc-ppsm/blob/HEAD/processing/gen_high_res_mat.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":"2ed558337f6bd190"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}