{"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":"/method/rpm-net","slug":"rpm-net","name":"RPM-Net","full_name":"RPM-Net","full_name_withheld":false,"description_markdown":"**RPM-Net** is an end-to-end differentiable deep network for robust point matching uses learned features. It preserves robustness of RPM against noisy/outlier points while desensitizing initialization with point correspondences from learned feature distances instead of spatial distances. The network uses the differentiable Sinkhorn layer and annealing to get soft assignments of point correspondences from hybrid features learned from both spatial coordinates and local geometry. To further improve registration performance, the authors introduce a secondary network to predict optimal annealing parameters.","description_state":"present","introduced_year":null,"introduced_by":{"title":"RPM-Net: Robust Point Matching using Learned Features","paper":"/paper/2003-13479","first_author":"Zi Jian Yew","n_authors":2,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/2003-13479"},"source":{"url":"https://arxiv.org/abs/2003.13479v1","title":"RPM-Net: Robust Point Matching using Learned Features","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Computer Vision","area_id":"computer-vision","collection":"Point Cloud Models","url":"/methods/category/point-cloud-models","pwc_aliases":[]}],"n_papers_tagged":2,"archive_num_papers":2,"papers_newest_first":[{"paper":null,"slug":"deep-weighted-consensus-dense-correspondence","title":"Deep Weighted Consensus: Dense correspondence confidence maps for 3D shape registration","date":"2021-05-06","arxiv_id":"2105.02714","n_code_links":0,"syntology":null},{"paper":"/paper/2003-13479","slug":"2003-13479","title":"RPM-Net: Robust Point Matching using Learned Features","date":"2020-03-30","arxiv_id":"2003.13479","n_code_links":5,"syntology":{"ran":26,"of":31,"n_ran_checked":25,"n_instrument":1,"unverified":5,"pointer_only":16,"phrase":"26 ran (of which 0 constructed an object rather than computing a result; 25 with no instrument failure: 1 honoured, 0 violated, 24 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","official":{"repos":["yewzijian/RPMNet"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":2,"ran_from_kinds":["listed","official"]}}}],"papers_shown":2,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":2,"with_a_code_link":1,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":2,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/method/rpm-net/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/rpm-net/papers/ran/1","json":"/method/rpm-net/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/deep-learning","name":"Deep Learning","papers":1},{"task":"/task/point-cloud-registration","name":"Point Cloud Registration","papers":1}],"tasks_shown":2,"n_tasks":2,"usage_by_year":[{"year":"2020","papers":1},{"year":"2021","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/rpm-net"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=RPM-Net","read_at":"2026-10-05T01:01:24+00:00","query":"RPM-Net","kind":"paper","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"2003.13479","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"unresolved_bearers","may_be_wrong_sense":true,"bearers_found":2,"served":null,"leading_other_bearer":{"arxiv_id":"2003.13479","title":"RPM-Net: Robust Point Matching using Learned Features","citations":598,"named_by":["title_prefix"],"bearer_name":"RPM-Net: Robust Point Matching using Learned Features","ask_with":"have('2003.13479')"},"n_other_bearers_listed":2,"note":"Nothing resolved to 'RPM-Net' by name, but 2 thing(s) here DECLARE that name -- most cited: the paper 'RPM-Net: Robust Point Matching using Learned Features' (arXiv:2003.13479, 598 citations). That is a RESOLUTION miss, not a coverage gap: the corpus holds the name under a spelling the lookup did not reach. Ask again with an entry of `also_named`."},"name_competition_text":"Nothing resolved to this name, but 2 entries in Syntology's graph carry it; the most cited is the paper “RPM-Net: Robust Point Matching using Learned Features” (arXiv:2003.13479, 598 citations). The lookup reads this as a miss of its own name matching, not a gap in coverage: the graph holds the name under a spelling the lookup did not reach.","near_matches":["U-Net","W-Net","A*Net","γ-Net","F-Net","R-Net"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"14b90c49f506668328e239113bc5fcd494957daf6151b0efce55a64f1121201f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}