{"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/scalable-recognition-with-a-vocabulary-tree","title":"Scalable Recognition with a Vocabulary Tree","arxiv_id":null,"date":"2006-06-22","proceeding":null,"authors":["David Nist ́er and Henrik Stew ́enius"],"abstract":"A recognition scheme that scales efficiently to a large number of objects is presented. The efficiency and quality is exhibited in a live demonstration that recognizes CD-covers from a database of 40000 images of popular music CD’s.The scheme builds upon popular techniques of indexing descriptors extracted from local regions, and is robust to background clutter and occlusion.  The local region descriptors are hierarchically quantized in a vocabulary tree.   The vocabulary tree allows a larger and more discriminatory vocabulary to be used efficiently, which we show experimentally leads to a dramatic improvement in retrieval quality.  The most significant property of the scheme is that the tree directly defines the quantization. The quantization and the indexing are therefore fully integrated,essentially being one and the same.The recognition quality is evaluated through retrieval on a database with ground truth, showing the power of the vocabulary tree approach, going as high as 1 million images.","url_abs":"https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1641018&casa_token=YxmVHaIQf4AAAAAA:POjvP1wTXgb15dsCs7EW_IgF8-Wu9foRVDxK8sMTCTsTYV2mSgTPfiV-egx4OUw5xYyHLQ&tag=1","url_pdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1641018&casa_token=YxmVHaIQf4AAAAAA:POjvP1wTXgb15dsCs7EW_IgF8-Wu9foRVDxK8sMTCTsTYV2mSgTPfiV-egx4OUw5xYyHLQ&tag=1","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":"scalable-recognition-with-a-vocabulary-tree","repo_url":"https://github.com/epignatelli/scalable-recognition-with-a-vocabulary-tree","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"quantization","task_name":"Quantization"},{"task_slug":"retrieval","task_name":"Retrieval"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"epignatelli/scalable-recognition-with-a-vocabulary-tree","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":"e0cda5314b49aed95023a5f27df7e6347a4b297c266d458851e41ec45a3057f2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}