{"url":"/task/3d-dense-shape-correspondence","name":"3D Dense Shape Correspondence","slug":"3d-dense-shape-correspondence","description_markdown":"Finding a meaningful correspondence between two or more shapes is one of the most fundamental shape analysis tasks. The problem can be generally stated as: given input shapes S1,S2,...,SN, find a meaningful relation (or mapping) between their elements. Under different contexts, the problem has also been referred to as registration, alignment, or simply, matching. Shape correspondence is a key algorithmic component in tasks such as 3D scan alignment and space-time reconstruction, as well as an indispensable prerequisite in diverse applications including attribute transfer, shape interpolation, and statistical modeling.","categories":[{"name":"Computer Vision","url":"/area/computer-vision"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":11,"papers_with_code":8,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":2,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/3d-dense-shape-correspondence-on-shrec-19","slug":"3d-dense-shape-correspondence-on-shrec-19","dataset":"SHREC'19","dataset_url":"/dataset/shrec-19","rows_in_archive":11,"metrics":["Euclidean Mean Error (EME)","Accuracy at 1%"],"first_row_in_archive_order":{"model":"Diffusion 3D Features (Zero-shot)","paper_title":"Diffusion 3D Features (Diff3F): Decorating Untextured Shapes with Distilled Semantic Features","paper_url":"/paper/diffusion-3d-features-diff3f-decorating","paper_date":"2023-11-28","arxiv_id":"2311.17024","code_links":[{"title":"niladridutt/Diffusion-3D-Features","url":"https://github.com/niladridutt/Diffusion-3D-Features"}],"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}}}],"datasets":[{"url":"/dataset/shrec-19","name":"SHREC'19","full_name":"SHREC'19 track Matching Humans with Different Connectivity","num_papers_in_archive":20},{"url":"/dataset/tosca","name":"TOSCA","full_name":"TOSCA high-resolution","num_papers_in_archive":4}],"subtasks":[],"parent_tasks":[{"url":"/task/3d-shape-representation","name":"3D Shape Representation"}],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":8,"of":8,"tagged_in_all":11,"items":[{"url":"/paper/learning-elementary-structures-for-3d-shape","title":"Learning elementary structures for 3D shape generation and matching","date":"2019-08-13","arxiv_id":"1908.04725","repositories_listed":3,"syntology":{"n":2,"n_ran":0,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/correspondence-learning-via-linearly","title":"Correspondence Learning via Linearly-invariant Embedding","date":"2020-10-25","arxiv_id":"2010.13136","repositories_listed":2,"syntology":null},{"url":"/paper/diffusion-3d-features-diff3f-decorating","title":"Diffusion 3D Features (Diff3F): Decorating Untextured Shapes with Distilled Semantic Features","date":"2023-11-28","arxiv_id":"2311.17024","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/se-ornet-self-ensembling-orientation-aware","title":"SE-ORNet: Self-Ensembling Orientation-aware Network for Unsupervised Point Cloud Shape Correspondence","date":"2023-04-10","arxiv_id":"2304.05395","repositories_listed":1,"syntology":null},{"url":"/paper/roca-robust-cad-model-retrieval-and-alignment","title":"ROCA: Robust CAD Model Retrieval and Alignment from a Single Image","date":"2021-12-03","arxiv_id":"2112.01988","repositories_listed":1,"syntology":null},{"url":"/paper/dpc-unsupervised-deep-point-correspondence","title":"DPC: Unsupervised Deep Point Correspondence via Cross and Self Construction","date":"2021-10-16","arxiv_id":"2110.08636","repositories_listed":1,"syntology":null},{"url":"/paper/corrnet3d-unsupervised-end-to-end-learning-of","title":"CorrNet3D: Unsupervised End-to-end Learning of Dense Correspondence for 3D Point Clouds","date":"2020-12-31","arxiv_id":"2012.15638","repositories_listed":1,"syntology":null},{"url":"/paper/3d-coded-3d-correspondences-by-deep-1","title":"3D-CODED : 3D Correspondences by Deep Deformation","date":"2018-06-13","arxiv_id":"1806.05228","repositories_listed":1,"syntology":null}],"syntology_records":2,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}