{"url":"/sota/point-cloud-registration-on-kitti-fcgf","task":{"name":"Point Cloud Registration","url":"/task/point-cloud-registration","note":null},"dataset":{"name":"KITTI (FCGF setting)","url":"/dataset/kitti"},"category":"Computer Vision","categories":["Computer Vision"],"category_note":null,"description":"**Point Cloud Registration** is a fundamental problem in 3D computer vision and photogrammetry. Given several sets of points in different coordinate systems, the aim of registration is to find the transformation that best aligns all of them into a common coordinate system. Point Cloud Registration plays a significant role in many vision applications such as 3D model reconstruction, cultural heritage management, landslide monitoring and solar energy analysis.\r\n\r\n\r\n<span class=\"description-source\">Source: [Iterative Global Similarity Points : A robust coarse-to-fine integration solution for pairwise 3D point cloud registration ](https://arxiv.org/abs/1808.03899)</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Recall (0.6m, 5 degrees)","RE (all)","TE (all)"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Recall (0.6m, 5 degrees)":"higher","RE (all)":null,"TE (all)":null}},"counts":{"rows":11,"rows_with_code":11,"rows_with_paper_page":11,"rows_dated":11,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"GeoTransformer","metrics":{"Recall (0.6m, 5 degrees)":"99.5"},"uses_additional_data":false,"paper_date":"2022-02-14","paper":"/paper/geometric-transformer-for-fast-and-robust","paper_url":"https://arxiv.org/abs/2202.06688v2","paper_title":"Geometric Transformer for Fast and Robust Point Cloud Registration","code":"https://github.com/qinzheng93/geotransformer","n_code_links":2,"syntology":{"n_ran":4,"n_unverified":5,"n_samples":9,"n_pointer_only_licence":9}},{"rank_in_archive_order":2,"model":"DGR + ICP (RE (all), TE(all) are reported in PCAM)","metrics":{"RE (all)":"1.43","Recall (0.6m, 5 degrees)":"98.2","TE (all)":"0.16"},"uses_additional_data":false,"paper_date":"2020-04-24","paper":"/paper/deep-global-registration","paper_url":"https://arxiv.org/abs/2004.11540v2","paper_title":"Deep Global Registration","code":"https://github.com/chrischoy/FCGF","n_code_links":2,"syntology":{"n_ran":5,"n_unverified":4,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":3,"model":"FCGF","metrics":{"Recall (0.6m, 5 degrees)":"98.2"},"uses_additional_data":false,"paper_date":"2019-10-27","paper":"/paper/fully-convolutional-geometric-features","paper_url":"https://github.com/chrischoy/FCGF","paper_title":"Fully Convolutional Geometric Features","code":"https://github.com/chrischoy/FCGF","n_code_links":1,"syntology":null},{"rank_in_archive_order":4,"model":"PCAM-soft + ICP","metrics":{"RE (all)":"0.79","Recall (0.6m, 5 degrees)":"98","TE (all)":"0.12"},"uses_additional_data":false,"paper_date":"2021-10-04","paper":"/paper/pcam-product-of-cross-attention-matrices-for","paper_url":"https://arxiv.org/abs/2110.01269v1","paper_title":"PCAM: Product of Cross-Attention Matrices for Rigid Registration of Point Clouds","code":"https://github.com/valeoai/pcam","n_code_links":1,"syntology":null},{"rank_in_archive_order":5,"model":"PCAM-Sparse + ICP","metrics":{"RE (all)":"1.04","Recall (0.6m, 5 degrees)":"97.4","TE (all)":"0.17"},"uses_additional_data":false,"paper_date":"2021-10-04","paper":"/paper/pcam-product-of-cross-attention-matrices-for","paper_url":"https://arxiv.org/abs/2110.01269v1","paper_title":"PCAM: Product of Cross-Attention Matrices for Rigid Registration of Point Clouds","code":"https://github.com/valeoai/pcam","n_code_links":1,"syntology":null},{"rank_in_archive_order":6,"model":"PCAM - Soft","metrics":{"RE (all)":"1.00","Recall (0.6m, 5 degrees)":"97.2","TE (all)":"0.18"},"uses_additional_data":false,"paper_date":"2021-10-04","paper":"/paper/pcam-product-of-cross-attention-matrices-for","paper_url":"https://arxiv.org/abs/2110.01269v1","paper_title":"PCAM: Product of Cross-Attention Matrices for Rigid Registration of Point Clouds","code":"https://github.com/valeoai/pcam","n_code_links":1,"syntology":null},{"rank_in_archive_order":7,"model":"DGR (RE (all), TE(all) are reported in PCAM)","metrics":{"RE (all)":"1.62","Recall (0.6m, 5 degrees)":"96.9","TE (all)":"0.34"},"uses_additional_data":false,"paper_date":"2020-04-24","paper":"/paper/deep-global-registration","paper_url":"https://arxiv.org/abs/2004.11540v2","paper_title":"Deep Global Registration","code":"https://github.com/chrischoy/FCGF","n_code_links":2,"syntology":{"n_ran":5,"n_unverified":4,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":8,"model":"PCAM-Sparse","metrics":{"RE (all)":"1.17","Recall (0.6m, 5 degrees)":"96.5","TE (all)":"0.22"},"uses_additional_data":false,"paper_date":"2021-10-04","paper":"/paper/pcam-product-of-cross-attention-matrices-for","paper_url":"https://arxiv.org/abs/2110.01269v1","paper_title":"PCAM: Product of Cross-Attention Matrices for Rigid Registration of Point Clouds","code":"https://github.com/valeoai/pcam","n_code_links":1,"syntology":null},{"rank_in_archive_order":9,"model":"Exhaustive Grid Search","metrics":{"Recall (0.6m, 5 degrees)":"94.59"},"uses_additional_data":false,"paper_date":"2024-03-23","paper":"/paper/addressing-the-generalization-of-3d","paper_url":"https://link.springer.com/article/10.1007/s00138-024-01510-w","paper_title":"Addressing the generalization of 3D registration methods with a featureless baseline and an unbiased benchmark","code":"https://github.com/DavidBoja/exhaustive-grid-search","n_code_links":1,"syntology":null},{"rank_in_archive_order":10,"model":"RANSAC","metrics":{"Recall (0.6m, 5 degrees)":"34.2"},"uses_additional_data":false,"paper_date":"2009-05-12","paper":"/paper/fast-point-feature-histograms-fpfh-for-3d","paper_url":"https://ieeexplore.ieee.org/document/5152473","paper_title":"Fast Point Feature Histograms (FPFH) for 3D Registration","code":"https://github.com/isl-org/Open3D/blob/main/cpp/open3d/pipelines/registration/Feature.h","n_code_links":1,"syntology":null},{"rank_in_archive_order":11,"model":"FGR","metrics":{"Recall (0.6m, 5 degrees)":"0.2"},"uses_additional_data":false,"paper_date":"2016-10-08","paper":"/paper/fast-global-registration","paper_url":"http://vladlen.info/papers/fast-global-registration.pdf","paper_title":"Fast Global Registration","code":"https://github.com/isl-org/FastGlobalRegistration","n_code_links":1,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,264 of the 9,581 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9581,"papers_checked":6264,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":3316},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":3,"rows_with_any_sample_ran":3,"distinct_papers_with_graph_line":2,"distinct_papers_with_any_sample_ran":2,"samples_over_distinct_papers":{"n_ran":9,"n_unverified":9,"n_samples":18,"n_pointer_only_licence":9,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":14,"n_unverified":13,"n_samples":27,"n_pointer_only_licence":9,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}