{"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/efficient-decentralized-visual-place","title":"Efficient Decentralized Visual Place Recognition From Full-Image Descriptors","arxiv_id":"1705.10739","date":"2017-05-30","proceeding":null,"authors":["Titus Cieslewski","Davide Scaramuzza"],"abstract":"In this paper, we discuss the adaptation of our decentralized place\nrecognition method described in [1] to full image descriptors. As we had shown,\nthe key to making a scalable decentralized visual place recognition lies in\nexploting deterministic key assignment in a distributed key-value map. Through\nthis, it is possible to reduce bandwidth by up to a factor of n, the robot\ncount, by casting visual place recognition to a key-value lookup problem. In\n[1], we exploited this for the bag-of-words method [3], [4]. Our method of\ncasting bag-of-words, however, results in a complex decentralized system, which\nhas inherently worse recall than its centralized counterpart. In this paper, we\ninstead start from the recent full-image description method NetVLAD [5]. As we\nshow, casting this to a key-value lookup problem can be achieved with k-means\nclustering, and results in a much simpler system than [1]. The resulting system\nstill has some flaws, albeit of a completely different nature: it suffers when\nthe environment seen during deployment lies in a different distribution in\nfeature space than the environment seen during training.","url_abs":"http://arxiv.org/abs/1705.10739v1","url_pdf":"http://arxiv.org/pdf/1705.10739v1.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":"efficient-decentralized-visual-place","repo_url":"https://github.com/uzh-rpg/dslam_open","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":null,"task_name":"Image Description"},{"task_slug":"visual-place-recognition","task_name":"Visual Place Recognition"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"uzh-rpg/dslam_open","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":"11bc7bf28c5c77e79bd026699ef375f5c531d59e727f9a1bf965717f92356f92","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}