{"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/teaser-fast-and-certifiable-point-cloud","title":"TEASER: Fast and Certifiable Point Cloud Registration","arxiv_id":"2001.07715","date":"2020-01-21","proceeding":null,"authors":["Heng Yang","Jingnan Shi","Luca Carlone"],"abstract":"We propose the first fast and certifiable algorithm for the registration of two sets of 3D points in the presence of large amounts of outlier correspondences. We first reformulate the registration problem using a Truncated Least Squares (TLS) cost that is insensitive to a large fraction of spurious correspondences. Then, we provide a general graph-theoretic framework to decouple scale, rotation, and translation estimation, which allows solving in cascade for the three transformations. Despite the fact that each subproblem is still non-convex and combinatorial in nature, we show that (i) TLS scale and (component-wise) translation estimation can be solved in polynomial time via adaptive voting, (ii) TLS rotation estimation can be relaxed to a semidefinite program (SDP) and the relaxation is tight, even in the presence of extreme outlier rates, and (iii) the graph-theoretic framework allows drastic pruning of outliers by finding the maximum clique. We name the resulting algorithm TEASER (Truncated least squares Estimation And SEmidefinite Relaxation). While solving large SDP relaxations is typically slow, we develop a second fast and certifiable algorithm, named TEASER++, that uses graduated non-convexity to solve the rotation subproblem and leverages Douglas-Rachford Splitting to efficiently certify global optimality. For both algorithms, we provide theoretical bounds on the estimation errors, which are the first of their kind for robust registration problems. Moreover, we test their performance on standard, object detection, and the 3DMatch benchmarks, and show that (i) both algorithms dominate the state of the art and are robust to more than 99% outliers, (ii) TEASER++ can run in milliseconds, and (iii) TEASER++ is so robust it can also solve problems without correspondences, where it largely outperforms ICP and it is more accurate than Go-ICP while being orders of magnitude faster.","url_abs":"https://arxiv.org/abs/2001.07715v2","url_pdf":"https://arxiv.org/pdf/2001.07715v2.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":"teaser-fast-and-certifiable-point-cloud","repo_url":"https://github.com/MIT-SPARK/TEASER-plusplus","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"teaser-fast-and-certifiable-point-cloud","repo_url":"https://github.com/MIT-SPARK/CertifiablyRobustPerception","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"teaser-fast-and-certifiable-point-cloud","repo_url":"https://github.com/StrikerCC/Teaser-plusplus-testing","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"teaser-fast-and-certifiable-point-cloud","repo_url":"https://github.com/esteimle/teaser","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"teaser-fast-and-certifiable-point-cloud","repo_url":"https://github.com/jewettaij/superpose3d","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"teaser-fast-and-certifiable-point-cloud","repo_url":"https://github.com/mergarsal/FastCertRelPose","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"teaser-fast-and-certifiable-point-cloud","repo_url":"https://github.com/mit-spark/kiss-matcher","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"object-detection","task_name":"Object Detection"},{"task_slug":"point-cloud-registration","task_name":"Point Cloud Registration"},{"task_slug":"translation","task_name":"Translation"},{"task_slug":"object-detection-1","task_name":"object-detection"}],"methods":[{"method_slug":"pruning","method_name":"Pruning"},{"method_slug":"test","method_name":"Test"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2001.07715","atlas_url":"https://app.syntology.ai/?focus=2001.07715","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.07715"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2001.07715"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2001.07715"},"call":"get_harvested_code_for_paper(arxiv_id=\"2001.07715\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2001.07715"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2001.07715\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2001.07715"},"call":"get_concepts_for_paper(arxiv_id=\"2001.07715\")"}],"by_repo":[{"repo":"MIT-SPARK/TEASER-plusplus","kind":"official","samples":1,"ran":1,"instrument":0,"unverified":0},{"repo":"MIT-SPARK/CertifiablyRobustPerception","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"StrikerCC/Teaser-plusplus-testing","kind":"listed","samples":2,"ran":1,"instrument":0,"unverified":1,"placed_by_identical_code":2},{"repo":"esteimle/teaser","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"jewettaij/superpose3d","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mergarsal/FastCertRelPose","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mit-spark/kiss-matcher","kind":"listed","samples":4,"ran":4,"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2001.07715.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2001.07715.svg"},"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/StrikerCC/Teaser-plusplus-testing","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mergarsal/FastCertRelPose","reach":{"status":"ok","spdx":"GPL-3.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/jewettaij/superpose3d","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/MIT-SPARK/TEASER-plusplus","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mit-spark/kiss-matcher","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/esteimle/teaser","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/MIT-SPARK/CertifiablyRobustPerception","reach":{"status":"ok"}}],"summary":{"ran":4,"ran_violates":2,"unverified":1},"n_samples":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":1,"ran":1,"n_ran_checked":1,"n_instrument":0,"repositories":1},"listed":{"samples":6,"ran":5,"n_ran_checked":5,"n_instrument":0,"repositories":2}},"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":2,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":6,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-24","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"fafbafddf90c5b64","code_sha256_prefix":"fafbafddf90c5b64","entry":"bin_to_pcd","repo":"mit-spark/kiss-matcher","repo_kind":"listed","path":"python/utils/bin2pcd.py","file_url":"https://github.com/mit-spark/kiss-matcher/blob/HEAD/python/utils/bin2pcd.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"bin_file_name:str/0/str","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T22:24:42.659479+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"fafbafddf90c5b64"}},{"code_sha256":"2c68a865d526c0cd","code_sha256_prefix":"2c68a865d526c0cd","entry":"get_angular_error","repo":null,"repo_kind":"listed","path":null,"file_url":null,"link_basis":"identical_code_first_harvested_elsewhere","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"R_exp:ndarray/2/float, R_est:ndarray/2/float","fixture_out_type":"float64","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"2c68a865d526c0cd"},"code_page":null,"census":null,"placed_by_identical_code":{"repo":"StrikerCC/Teaser-plusplus-testing","path":"examples/teaser_python_ply/teaser_python_ply.py","file_url":"https://github.com/StrikerCC/Teaser-plusplus-testing/blob/HEAD/examples/teaser_python_ply/teaser_python_ply.py","papers":["1905.12536"],"is":"identical code Syntology harvested from this repository for another paper; this paper's link records no repository, path or licence of its own"},"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","mcp_get_code":{"code_sha256":"2c68a865d526c0cd"}},{"code_sha256":"54db1e4574db065f","code_sha256_prefix":"54db1e4574db065f","entry":"get_angular_error","repo":"MIT-SPARK/TEASER-plusplus","repo_kind":"official","path":"examples/teaser_python_ply/teaser_python_ply.py","file_url":"https://github.com/MIT-SPARK/TEASER-plusplus/blob/HEAD/examples/teaser_python_ply/teaser_python_ply.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"R_exp:ndarray/2/float, R_est:ndarray/2/float","fixture_out_type":"float64","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"54db1e4574db065f"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"54db1e4574db065f"}},{"code_sha256":"91b6d2125d1eadc6","code_sha256_prefix":"91b6d2125d1eadc6","entry":"read_bin","repo":"mit-spark/kiss-matcher","repo_kind":"listed","path":"python/kiss_matcher/io_utils.py","file_url":"https://github.com/mit-spark/kiss-matcher/blob/HEAD/python/kiss_matcher/io_utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"bin_path:str/0/str","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T22:24:42.659479+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"91b6d2125d1eadc6"}},{"code_sha256":"bbe0439489192e4b","code_sha256_prefix":"bbe0439489192e4b","entry":"read_pcd","repo":"mit-spark/kiss-matcher","repo_kind":"listed","path":"python/kiss_matcher/io_utils.py","file_url":"https://github.com/mit-spark/kiss-matcher/blob/HEAD/python/kiss_matcher/io_utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"pcd_path:str/0/str","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T22:24:42.659479+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"bbe0439489192e4b"}},{"code_sha256":"d33d4de02bd79322","code_sha256_prefix":"d33d4de02bd79322","entry":"read_ply","repo":"mit-spark/kiss-matcher","repo_kind":"listed","path":"python/kiss_matcher/io_utils.py","file_url":"https://github.com/mit-spark/kiss-matcher/blob/HEAD/python/kiss_matcher/io_utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"ply_path:str/0/str","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T22:24:42.659479+00:00","code_page":"/code/read-ply","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d33d4de02bd79322"}},{"code_sha256":"103473bb55796d70","code_sha256_prefix":"103473bb55796d70","entry":"find_mutually_nn_keypoints","repo":null,"repo_kind":"listed","path":null,"file_url":null,"link_basis":"identical_code_first_harvested_elsewhere","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"placed_by_identical_code":{"repo":"StrikerCC/Teaser-plusplus-testing","path":"examples/teaser_python_3dsmooth/teaser_python_3dsmooth.py","file_url":"https://github.com/StrikerCC/Teaser-plusplus-testing/blob/HEAD/examples/teaser_python_3dsmooth/teaser_python_3dsmooth.py","papers":["1905.12536"],"is":"identical code Syntology harvested from this repository for another paper; this paper's link records no repository, path or licence of its own"},"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","mcp_get_code":{"code_sha256":"103473bb55796d70"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"3444e25078ec85236706a024d682a92e67cc6bc7c73578326f6fa3c888332ee0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}