{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/iterative-global-similarity-points-a-robust","title":"Iterative Global Similarity Points : A robust coarse-to-fine integration solution for pairwise 3D point cloud registration","arxiv_id":"1808.03899","date":"2018-08-12","proceeding":null,"authors":["Yue Pan","Bisheng Yang","Fuxun Liang","Zhen Dong"],"abstract":"In this paper, we propose a coarse-to-fine integration solution inspired by\nthe classical ICP algorithm, to pairwise 3D point cloud registration with two\nimprovements of hybrid metric spaces (eg, BSC feature and Euclidean geometry\nspaces) and globally optimal correspondences matching. First, we detect the\nkeypoints of point clouds and use the Binary Shape Context (BSC) descriptor to\nencode their local features. Then, we formulate the correspondence matching\ntask as an energy function, which models the global similarity of keypoints on\nthe hybrid spaces of BSC feature and Euclidean geometry. Next, we estimate the\nglobally optimal correspondences through optimizing the energy function by the\nKuhn-Munkres algorithm and then calculate the transformation based on the\ncorrespondences. Finally,we iteratively refine the transformation between two\npoint clouds by conducting optimal correspondences matching and transformation\ncalculation in a mutually reinforcing manner, to achieve the coarse-to-fine\nregistration under an unified framework.The proposed method is evaluated and\ncompared to several state-of-the-art methods on selected challenging datasets\nwith repetitive, symmetric and incomplete structures.Comprehensive experiments\ndemonstrate that the proposed IGSP algorithm obtains good performance and\noutperforms the state-of-the-art methods in terms of both rotation and\ntranslation errors.","url_abs":"http://arxiv.org/abs/1808.03899v1","url_pdf":"http://arxiv.org/pdf/1808.03899v1.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":"iterative-global-similarity-points-a-robust","repo_url":"https://github.com/YuePanEdward/GH-ICP","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"point-cloud-registration","task_name":"Point Cloud Registration"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1808.03899","atlas_url":"https://app.syntology.ai/?focus=1808.03899","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1808.03899"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1808.03899\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1808.03899"},"call":"get_concepts_for_paper(arxiv_id=\"1808.03899\")"}],"by_repo":[{"repo":"YuePanEdward/GH-ICP","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"13bbe26b0e3a95663076a54cefe0e201894b1ff8ddede47682f8c2e519c91c0d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}