{"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/robust-and-low-rank-representation-for-fast","title":"Robust and Low-Rank Representation for Fast Face Identification with Occlusions","arxiv_id":"1605.02266","date":"2016-05-08","proceeding":null,"authors":["Michael Iliadis","Haohong Wang","Rafael Molina","Aggelos K. Katsaggelos"],"abstract":"In this paper we propose an iterative method to address the face\nidentification problem with block occlusions. Our approach utilizes a robust\nrepresentation based on two characteristics in order to model contiguous errors\n(e.g., block occlusion) effectively. The first fits to the errors a\ndistribution described by a tailored loss function. The second describes the\nerror image as having a specific structure (resulting in low-rank in comparison\nto image size). We will show that this joint characterization is effective for\ndescribing errors with spatial continuity. Our approach is computationally\nefficient due to the utilization of the Alternating Direction Method of\nMultipliers (ADMM). A special case of our fast iterative algorithm leads to the\nrobust representation method which is normally used to handle non-contiguous\nerrors (e.g., pixel corruption). Extensive results on representative face\ndatabases (in constrained and unconstrained environments) document the\neffectiveness of our method over existing robust representation methods with\nrespect to both identification rates and computational time.\n  Code is available at Github, where you can find implementations of the\nF-LR-IRNNLS and F-IRNNLS (fast version of the RRC) :\nhttps://github.com/miliadis/FIRC","url_abs":"http://arxiv.org/abs/1605.02266v2","url_pdf":"http://arxiv.org/pdf/1605.02266v2.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":"robust-and-low-rank-representation-for-fast","repo_url":"https://github.com/miliadis/FIRC","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"face-identification","task_name":"Face Identification"}],"methods":[],"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":"miliadis/FIRC","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":"41b7e1eea06df196a8f739b84a2757b746df7fd3683e21ba0ad119169fe54a5c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}