{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/31929"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/31929","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Applications of low-rank matrix recovery methods in computer vision","abstract":"The ubiquitous availability of high-dimensional data such as images and videos has generated a lot of interest in high-dimensional data analysis. One of the key issues that needs to be addressed in real applications is the presence of large-magnitude non-Gaussian errors. For image data, the problem of deformations or domain transformations also poses interesting challenges. In this thesis, we harness recent advances in low-rank matrix recovery via convex optimization techniques to solve real problems in computer vision. This thesis also provides some theoretical analysis that extends existing results to new observation models. Low-rank matrix approximations are a popular tool in data analysis. The well-known Principal Component Analysis (PCA) algorithm is a good example. Recently, it was shown that low-rank matrices can be recovered exactly from grossly corrupted measurements via convex optimization. This framework, called Principal Component Pursuit (PCP), constitutes a powerful tool that allows us to handle corrupted measurements and even missing entries in a principled way. In this thesis, we extend existing theoretical results to the case when a large majority of the entries of the matrix are badly corrupted. On the application side, we first briefly look at the image formation model that naturally gives rise to a low-rank matrix structure, and see how PCP can be used effectively in the photometric stereo problem. We then extend the existing PCP framework in a non-trivial fashion to effectively handle domain transformations in images. The proposed ideas are used to align multiple images simultaneously with one another, as well as to represent structured and symmetric textures in a novel way that is invariant to deformations. In addition to achieving excellent performance on real data, these methods are potentially very useful for other vision tasks like 3D structure recovery for urban images, automatic camera calibration, etc. Finally, we provide some theoretical guarantees for the new observation model encountered in the aforementioned applications. In particular, we show that under some conditions it is possible to recover most low-rank matrices even when a small linear fraction of their entries has been badly corrupted and, furthermore, when only linear measurements of the corrupted matrix are available. Besides being one of the first theoretical results for this case, this dissertation opens up many exciting avenues for future research in this direction.","abstract_html":"The ubiquitous availability of high-dimensional data such as images and videos has generated a lot of interest in high-dimensional data analysis. One of the key issues that needs to be addressed in real applications is the presence of large-magnitude non-Gaussian errors. For image data, the problem of deformations or domain transformations also poses interesting challenges. In this thesis, we harness recent advances in low-rank matrix recovery via convex optimization techniques to solve real problems in computer vision. This thesis also provides some theoretical analysis that extends existing results to new observation models. Low-rank matrix approximations are a popular tool in data analysis. The well-known Principal Component Analysis (PCA) algorithm is a good example. Recently, it was shown that low-rank matrices can be recovered exactly from grossly corrupted measurements via convex optimization. This framework, called Principal Component Pursuit (PCP), constitutes a powerful tool that allows us to handle corrupted measurements and even missing entries in a principled way. In this thesis, we extend existing theoretical results to the case when a large majority of the entries of the matrix are badly corrupted. On the application side, we first briefly look at the image formation model that naturally gives rise to a low-rank matrix structure, and see how PCP can be used effectively in the photometric stereo problem. We then extend the existing PCP framework in a non-trivial fashion to effectively handle domain transformations in images. The proposed ideas are used to align multiple images simultaneously with one another, as well as to represent structured and symmetric textures in a novel way that is invariant to deformations. In addition to achieving excellent performance on real data, these methods are potentially very useful for other vision tasks like 3D structure recovery for urban images, automatic camera calibration, etc. Finally, we provide some theoretical guarantees for the new observation model encountered in the aforementioned applications. In particular, we show that under some conditions it is possible to recover most low-rank matrices even when a small linear fraction of their entries has been badly corrupted and, furthermore, when only linear measurements of the corrupted matrix are available. Besides being one of the first theoretical results for this case, this dissertation opens up many exciting avenues for future research in this direction.","abstract_has_math":false,"creators":["Balasubramanian, Arvind"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Ma, Yi","Huang, Thomas S.","Milenkovic, Olgica","Meyn, Sean P."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012-06-27T21:19:53Z","date_published":"2012-06-27T21:19:53Z","updated_at":"2026-07-22T22:25:30Z","subjects":["Image Alignment","Texture Rectification","Low-Rank Matrix Recovery","Convex Optimization","Photometric Stereo","Principal Component Pursuit"],"languages":["en"],"rights":["Copyright 2012 Arvind Balasubramanian"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/31929","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Ma, Yi","Huang, Thomas S.","Milenkovic, Olgica","Meyn, Sean P."]},{"key":"dc:creator","label":"Author","values":["Balasubramanian, Arvind"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2012-06-27T21:19:53Z","2014-06-28T10:00:19Z","2012-05"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"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":["Image Alignment","Texture Rectification","Low-Rank Matrix Recovery","Convex Optimization","Photometric Stereo","Principal Component Pursuit"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2012 Arvind Balasubramanian"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/31929"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The ubiquitous availability of high-dimensional data such as images and videos has generated a lot of interest in high-dimensional data analysis. One of the key issues that needs to be addressed in real applications is the presence of large-magnitude non-Gaussian errors. For image data, the problem of deformations or domain transformations also poses interesting challenges. In this thesis, we harness recent advances in low-rank matrix recovery via convex optimization techniques to solve real problems in computer vision. This thesis also provides some theoretical analysis that extends existing results to new observation models. Low-rank matrix approximations are a popular tool in data analysis. The well-known Principal Component Analysis (PCA) algorithm is a good example. Recently, it was shown that low-rank matrices can be recovered exactly from grossly corrupted measurements via convex optimization. This framework, called Principal Component Pursuit (PCP), constitutes a powerful tool that allows us to handle corrupted measurements and even missing entries in a principled way. In this thesis, we extend existing theoretical results to the case when a large majority of the entries of the matrix are badly corrupted. On the application side, we first briefly look at the image formation model that naturally gives rise to a low-rank matrix structure, and see how PCP can be used effectively in the photometric stereo problem. We then extend the existing PCP framework in a non-trivial fashion to effectively handle domain transformations in images. The proposed ideas are used to align multiple images simultaneously with one another, as well as to represent structured and symmetric textures in a novel way that is invariant to deformations. In addition to achieving excellent performance on real data, these methods are potentially very useful for other vision tasks like 3D structure recovery for urban images, automatic camera calibration, etc. Finally, we provide some theoretical guarantees for the new observation model encountered in the aforementioned applications. In particular, we show that under some conditions it is possible to recover most low-rank matrices even when a small linear fraction of their entries has been badly corrupted and, furthermore, when only linear measurements of the corrupted matrix are available. Besides being one of the first theoretical results for this case, this dissertation opens up many exciting avenues for future research in this direction.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2012-02-09T22:21:51Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Balasubramanian_Arvind.pdf: 23258354 bytes, checksum: f7c395b5b6cf9d950d571687bb73729d (MD5)","Made available in DSpace on 2012-06-27T21:19:53Z (GMT). No. of bitstreams: 2 Balasubramanian_Arvind.pdf: 23258354 bytes, checksum: f7c395b5b6cf9d950d571687bb73729d (MD5) license.txt: 4072 bytes, checksum: 543d56eb240c7227cc8c245a2e2e111f (MD5)","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by William Ingram (wingram2@illinois.edu) on 2012-06-27T21:24:33Z Item is restricted until 2014-06-27T21:24:27Z","Item reinstated by Sarah Shreeves (sshreeve@illinois.edu) on 2014-06-28T10:00:19Z Item was in collections: Dissertations and Theses - Electrical and Computer Engineering (ID: 446) Graduate Theses and Dissertations at Illinois (ID: 204) No. of bitstreams: 2 Balasubramanian_Arvind.pdf: 23258354 bytes, checksum: f7c395b5b6cf9d950d571687bb73729d (MD5) license.txt: 4072 bytes, checksum: 543d56eb240c7227cc8c245a2e2e111f (MD5)","Item released from any restrictions by Sarah Shreeves (sshreeve@illinois.edu) on 2014-06-28T10:00:19Z"]},{"key":"dc:title","label":"Title","values":["Applications of low-rank matrix recovery methods in computer vision"]}]}],"canonical_facts":{"dc:contributor":["Ma, Yi","Huang, Thomas S.","Milenkovic, Olgica","Meyn, Sean P."],"dc:creator":["Balasubramanian, Arvind"],"dc:date":["2012-06-27T21:19:53Z","2014-06-28T10:00:19Z","2012-05"],"dc:description":["The ubiquitous availability of high-dimensional data such as images and videos has generated a lot of interest in high-dimensional data analysis. One of the key issues that needs to be addressed in real applications is the presence of large-magnitude non-Gaussian errors. For image data, the problem of deformations or domain transformations also poses interesting challenges. In this thesis, we harness recent advances in low-rank matrix recovery via convex optimization techniques to solve real problems in computer vision. This thesis also provides some theoretical analysis that extends existing results to new observation models. Low-rank matrix approximations are a popular tool in data analysis. The well-known Principal Component Analysis (PCA) algorithm is a good example. Recently, it was shown that low-rank matrices can be recovered exactly from grossly corrupted measurements via convex optimization. This framework, called Principal Component Pursuit (PCP), constitutes a powerful tool that allows us to handle corrupted measurements and even missing entries in a principled way. In this thesis, we extend existing theoretical results to the case when a large majority of the entries of the matrix are badly corrupted. On the application side, we first briefly look at the image formation model that naturally gives rise to a low-rank matrix structure, and see how PCP can be used effectively in the photometric stereo problem. We then extend the existing PCP framework in a non-trivial fashion to effectively handle domain transformations in images. The proposed ideas are used to align multiple images simultaneously with one another, as well as to represent structured and symmetric textures in a novel way that is invariant to deformations. In addition to achieving excellent performance on real data, these methods are potentially very useful for other vision tasks like 3D structure recovery for urban images, automatic camera calibration, etc. Finally, we provide some theoretical guarantees for the new observation model encountered in the aforementioned applications. In particular, we show that under some conditions it is possible to recover most low-rank matrices even when a small linear fraction of their entries has been badly corrupted and, furthermore, when only linear measurements of the corrupted matrix are available. Besides being one of the first theoretical results for this case, this dissertation opens up many exciting avenues for future research in this direction.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2012-02-09T22:21:51Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Balasubramanian_Arvind.pdf: 23258354 bytes, checksum: f7c395b5b6cf9d950d571687bb73729d (MD5)","Made available in DSpace on 2012-06-27T21:19:53Z (GMT). No. of bitstreams: 2 Balasubramanian_Arvind.pdf: 23258354 bytes, checksum: f7c395b5b6cf9d950d571687bb73729d (MD5) license.txt: 4072 bytes, checksum: 543d56eb240c7227cc8c245a2e2e111f (MD5)","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by William Ingram (wingram2@illinois.edu) on 2012-06-27T21:24:33Z Item is restricted until 2014-06-27T21:24:27Z","Item reinstated by Sarah Shreeves (sshreeve@illinois.edu) on 2014-06-28T10:00:19Z Item was in collections: Dissertations and Theses - Electrical and Computer Engineering (ID: 446) Graduate Theses and Dissertations at Illinois (ID: 204) No. of bitstreams: 2 Balasubramanian_Arvind.pdf: 23258354 bytes, checksum: f7c395b5b6cf9d950d571687bb73729d (MD5) license.txt: 4072 bytes, checksum: 543d56eb240c7227cc8c245a2e2e111f (MD5)","Item released from any restrictions by Sarah Shreeves (sshreeve@illinois.edu) on 2014-06-28T10:00:19Z"],"dc:identifier":["http://hdl.handle.net/2142/31929"],"dc:language":["en"],"dc:rights":["Copyright 2012 Arvind Balasubramanian"],"dc:subject":["Image Alignment","Texture Rectification","Low-Rank Matrix Recovery","Convex Optimization","Photometric Stereo","Principal Component Pursuit"],"dc:title":["Applications of low-rank matrix recovery methods in computer vision"],"dc:type":["text"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:30Z"}