{"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/face-search-at-scale-80-million-gallery","title":"Face Search at Scale: 80 Million Gallery","arxiv_id":"1507.07242","date":"2015-07-26","proceeding":null,"authors":["Dayong Wang","Charles Otto","Anil K. Jain"],"abstract":"Due to the prevalence of social media websites, one challenge facing computer\nvision researchers is to devise methods to process and search for persons of\ninterest among the billions of shared photos on these websites. Facebook\nrevealed in a 2013 white paper that its users have uploaded more than 250\nbillion photos, and are uploading 350 million new photos each day. Due to this\nhumongous amount of data, large-scale face search for mining web images is both\nimportant and challenging. Despite significant progress in face recognition,\nsearching a large collection of unconstrained face images has not been\nadequately addressed. To address this challenge, we propose a face search\nsystem which combines a fast search procedure, coupled with a state-of-the-art\ncommercial off the shelf (COTS) matcher, in a cascaded framework. Given a probe\nface, we first filter the large gallery of photos to find the top-k most\nsimilar faces using deep features generated from a convolutional neural\nnetwork. The k candidates are re-ranked by combining similarities from deep\nfeatures and the COTS matcher. We evaluate the proposed face search system on a\ngallery containing 80 million web-downloaded face images. Experimental results\ndemonstrate that the deep features are competitive with state-of-the-art\nmethods on unconstrained face recognition benchmarks (LFW and IJB-A). Further,\nthe proposed face search system offers an excellent trade-off between accuracy\nand scalability on datasets consisting of millions of images. Additionally, in\nan experiment involving searching for face images of the Tsarnaev brothers,\nconvicted of the Boston Marathon bombing, the proposed face search system could\nfind the younger brother's (Dzhokhar Tsarnaev) photo at rank 1 in 1 second on a\n5M gallery and at rank 8 in 7 seconds on an 80M gallery.","url_abs":"http://arxiv.org/abs/1507.07242v2","url_pdf":"http://arxiv.org/pdf/1507.07242v2.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":[],"tasks":[{"task_slug":"face-recognition","task_name":"Face Recognition"},{"task_slug":"face-verification","task_name":"Face Verification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/face-verification-on-ijb-a","task":"Face Verification","dataset":"IJB-A","model":"Deep CNN + COTS matcher","rank_in_archive_order":16,"of":17,"metrics":{"TAR @ FAR=0.01":"73.30%"},"uses_additional_data":false}],"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":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"af0a6c570f7cbe9dc6db13a884b2b58704de4429c2587ccf36d04c7800ba7fd9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}