{"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/the-cuda-latch-binary-descriptor-because","title":"The CUDA LATCH Binary Descriptor: Because Sometimes Faster Means Better","arxiv_id":"1609.03986","date":"2016-09-13","proceeding":null,"authors":["Christopher Parker","Matthew Daiter","Kareem Omar","Gil Levi","Tal Hassner"],"abstract":"Accuracy, descriptor size, and the time required for extraction and matching\nare all important factors when selecting local image descriptors. To optimize\nover all these requirements, this paper presents a CUDA port for the recent\nLearned Arrangement of Three Patches (LATCH) binary descriptors to the GPU\nplatform. The design of LATCH makes it well suited for GPU processing. Owing to\nits small size and binary nature, the GPU can further be used to efficiently\nmatch LATCH features. Taken together, this leads to breakneck descriptor\nextraction and matching speeds. We evaluate the trade off between these speeds\nand the quality of results in a feature matching intensive application. To this\nend, we use our proposed CUDA LATCH (CLATCH) to recover structure from motion\n(SfM), comparing 3D reconstructions and speed using different representations.\nOur results show that CLATCH provides high quality 3D reconstructions at\nfractions of the time required by other representations, with little, if any,\nloss of reconstruction quality.","url_abs":"http://arxiv.org/abs/1609.03986v2","url_pdf":"http://arxiv.org/pdf/1609.03986v2.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":"the-cuda-latch-binary-descriptor-because","repo_url":"https://github.com/komrad36/CLATCH","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"the-cuda-latch-binary-descriptor-because","repo_url":"https://github.com/komrad36/LATCH","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"the-cuda-latch-binary-descriptor-because","repo_url":"https://github.com/komrad36/UCLATCH","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"the-cuda-latch-binary-descriptor-because","repo_url":"https://github.com/komrad36/ULATCH","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":null,"task_name":"GPU"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"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":"komrad36/CLATCH","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"komrad36/LATCH","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"komrad36/UCLATCH","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"komrad36/ULATCH","kind":"listed","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":"8819c64dc97fc0bc1b93280ac3d129fbb4e40b55d2b6a022c61b532c628f0e7f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}