{"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/latch-learned-arrangements-of-three-patch","title":"LATCH: Learned Arrangements of Three Patch Codes","arxiv_id":"1501.03719","date":"2015-01-15","proceeding":null,"authors":["Gil Levi","Tal Hassner"],"abstract":"We present a novel means of describing local image appearances using binary\nstrings. Binary descriptors have drawn increasing interest in recent years due\nto their speed and low memory footprint. A known shortcoming of these\nrepresentations is their inferior performance compared to larger, histogram\nbased descriptors such as the SIFT. Our goal is to close this performance gap\nwhile maintaining the benefits attributed to binary representations. To this\nend we propose the Learned Arrangements of Three Patch Codes descriptors, or\nLATCH. Our key observation is that existing binary descriptors are at an\nincreased risk from noise and local appearance variations. This, as they\ncompare the values of pixel pairs; changes to either of the pixels can easily\nlead to changes in descriptor values, hence damaging its performance. In order\nto provide more robustness, we instead propose a novel means of comparing pixel\npatches. This ostensibly small change, requires a substantial redesign of the\ndescriptors themselves and how they are produced. Our resulting LATCH\nrepresentation is rigorously compared to state-of-the-art binary descriptors\nand shown to provide far better performance for similar computation and space\nrequirements.","url_abs":"http://arxiv.org/abs/1501.03719v1","url_pdf":"http://arxiv.org/pdf/1501.03719v1.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":"latch-learned-arrangements-of-three-patch","repo_url":"https://github.com/komrad36/CLATCH","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"latch-learned-arrangements-of-three-patch","repo_url":"https://github.com/komrad36/LATCH","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"latch-learned-arrangements-of-three-patch","repo_url":"https://github.com/komrad36/UCLATCH","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"latch-learned-arrangements-of-three-patch","repo_url":"https://github.com/komrad36/ULATCH","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"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":"3bf2b5d85d2657e3c423a3cf4dee4c4003a028999d229d7e9e5a6771e980d3c7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}