{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81151"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81151","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Error Correction for High-Dimensional Data via Convex Programming","abstract":"Finally, we show how these theoretical developments lead to simple, scalable, and robust algorithms for face recognition in the presence of varying illumination and occlusion. The idea is extremely simple: seek the sparsest representation of the test image as a linear combination of training images plus a sparse error term due to occlusion. In addition to achieving excellent performance on public databases, this approach sheds light on several important issues in face recognition, such as the choice of features and robustness to corruption and occlusion.","abstract_html":"Finally, we show how these theoretical developments lead to simple, scalable, and robust algorithms for face recognition in the presence of varying illumination and occlusion. The idea is extremely simple: seek the sparsest representation of the test image as a linear combination of training images plus a sparse error term due to occlusion. In addition to achieving excellent performance on public databases, this approach sheds light on several important issues in face recognition, such as the choice of features and robustness to corruption and occlusion.","abstract_has_math":false,"creators":["Wright, John N."],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical and Computer Engineering","degree_department":null,"school":null,"contributors":["Ma, Yi"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:09:47Z","date_published":"2015-09-25T20:09:47Z","updated_at":"2026-07-22T22:26:15Z","subjects":["Engineering, Electronics and Electrical"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3395542"],"render_values":[{"text":"(MiAaPQ)AAI3395542","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81151","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Ma, Yi"]},{"key":"dc:creator","label":"Author","values":["Wright, John N."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:09:47Z","10000-01-01","2009"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Engineering, Electronics and Electrical"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81151","(MiAaPQ)AAI3395542"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Finally, we show how these theoretical developments lead to simple, scalable, and robust algorithms for face recognition in the presence of varying illumination and occlusion. The idea is extremely simple: seek the sparsest representation of the test image as a linear combination of training images plus a sparse error term due to occlusion. In addition to achieving excellent performance on public databases, this approach sheds light on several important issues in face recognition, such as the choice of features and robustness to corruption and occlusion.","Made available in DSpace on 2015-09-25T20:09:47Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3395542.pdf: 7846761 bytes, checksum: ae572fab8e35314ba5d87880ded4ed94 (MD5) Previous issue date: 2009","Embargo set by: Seth Robbins for item 82432 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","199 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2009."]},{"key":"dc:title","label":"Title","values":["Error Correction for High-Dimensional Data via Convex Programming"]}]}],"canonical_facts":{"dc:contributor":["Ma, Yi"],"dc:creator":["Wright, John N."],"dc:date":["2015-09-25T20:09:47Z","10000-01-01","2009"],"dc:description":["Finally, we show how these theoretical developments lead to simple, scalable, and robust algorithms for face recognition in the presence of varying illumination and occlusion. The idea is extremely simple: seek the sparsest representation of the test image as a linear combination of training images plus a sparse error term due to occlusion. In addition to achieving excellent performance on public databases, this approach sheds light on several important issues in face recognition, such as the choice of features and robustness to corruption and occlusion.","Made available in DSpace on 2015-09-25T20:09:47Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3395542.pdf: 7846761 bytes, checksum: ae572fab8e35314ba5d87880ded4ed94 (MD5) Previous issue date: 2009","Embargo set by: Seth Robbins for item 82432 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","199 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2009."],"dc:identifier":["http://hdl.handle.net/2142/81151","(MiAaPQ)AAI3395542"],"dc:language":["eng"],"dc:subject":["Engineering, Electronics and Electrical"],"dc:title":["Error Correction for High-Dimensional Data via Convex Programming"],"dc:type":["text"],"thesis:degree_discipline":["Electrical and Computer Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:15Z"}