{"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/sparse-representation-based-open-set","title":"Sparse Representation-based Open Set Recognition","arxiv_id":"1705.02431","date":"2017-05-06","proceeding":null,"authors":["He Zhang","Vishal M. Patel"],"abstract":"We propose a generalized Sparse Representation- based Classification (SRC)\nalgorithm for open set recognition where not all classes presented during\ntesting are known during training. The SRC algorithm uses class reconstruction\nerrors for classification. As most of the discriminative information for open\nset recognition is hidden in the tail part of the matched and sum of\nnon-matched reconstruction error distributions, we model the tail of those two\nerror distributions using the statistical Extreme Value Theory (EVT). Then we\nsimplify the open set recognition problem into a set of hypothesis testing\nproblems. The confidence scores corresponding to the tail distributions of a\nnovel test sample are then fused to determine its identity. The effectiveness\nof the proposed method is demonstrated using four publicly available image and\nobject classification datasets and it is shown that this method can perform\nsignificantly better than many competitive open set recognition algorithms.\nCode is public available: https://github.com/hezhangsprinter/SROSR","url_abs":"http://arxiv.org/abs/1705.02431v1","url_pdf":"http://arxiv.org/pdf/1705.02431v1.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":"sparse-representation-based-open-set","repo_url":"https://github.com/hezhangsprinter/SROSR","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"open-set-learning","task_name":"Open Set Learning"},{"task_slug":"sparse-representation-based-classification","task_name":"Sparse Representation-based Classification"},{"task_slug":"hypothesis-testing","task_name":"Two-sample testing"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1705.02431","atlas_url":"https://app.syntology.ai/?focus=1705.02431","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1705.02431"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1705.02431\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1705.02431"},"call":"get_concepts_for_paper(arxiv_id=\"1705.02431\")"}],"by_repo":[{"repo":"hezhangsprinter/SROSR","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":"9541fcf0f15e2e589c6ba7b3f4f9767494524023e3ecfc783c68c756b91b325c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}