{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81149"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81149","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Harnessing Sparse and Low-Dimensional Structures for Robust Clustering of Imagery Data","abstract":"We propose a robust framework for clustering data. In practice, data obtained from real measurement devices can be incomplete, corrupted by gross errors, or not correspond to any assumed model. We show that, by properly harnessing the intrinsic low-dimensional structure of the data, these kinds of practical problems can be dealt with in a uniform fashion. In particular, we propose two robust segmentation algorithms: an algebraic method for data from multiple quadratic manifolds, and an information-theoretic approach for data from multiple linear subspaces. Our techniques draw from many diverse areas, including lossy data compression, sparse representation, algebraic geometry, and robust statistics. We verify the efficacy of our algorithms by applying them to the segmentation of tracked image features of objects in a dynamic scene under the affine and perspective camera models, and the segmentation of a natural image into regions with homogeneous texture. We benchmark the performance of our methods on many publicly available notion and imagery datasets. Our results are on par with state-of-the-art results, in many cases exceeding them. Finally, we explore potential extensions and improvements to our techniques as well as new applications.","abstract_html":"We propose a robust framework for clustering data. In practice, data obtained from real measurement devices can be incomplete, corrupted by gross errors, or not correspond to any assumed model. We show that, by properly harnessing the intrinsic low-dimensional structure of the data, these kinds of practical problems can be dealt with in a uniform fashion. In particular, we propose two robust segmentation algorithms: an algebraic method for data from multiple quadratic manifolds, and an information-theoretic approach for data from multiple linear subspaces. Our techniques draw from many diverse areas, including lossy data compression, sparse representation, algebraic geometry, and robust statistics. We verify the efficacy of our algorithms by applying them to the segmentation of tracked image features of objects in a dynamic scene under the affine and perspective camera models, and the segmentation of a natural image into regions with homogeneous texture. We benchmark the performance of our methods on many publicly available notion and imagery datasets. Our results are on par with state-of-the-art results, in many cases exceeding them. Finally, we explore potential extensions and improvements to our techniques as well as new applications.","abstract_has_math":false,"creators":["Rao, Shankar Ramamohan"],"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:46Z","date_published":"2015-09-25T20:09:46Z","updated_at":"2026-07-22T22:26:15Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3392444"],"render_values":[{"text":"(MiAaPQ)AAI3392444","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81149","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":["Rao, Shankar Ramamohan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:09:46Z","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":["Computer Science"]}]},{"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/81149","(MiAaPQ)AAI3392444"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["We propose a robust framework for clustering data. In practice, data obtained from real measurement devices can be incomplete, corrupted by gross errors, or not correspond to any assumed model. We show that, by properly harnessing the intrinsic low-dimensional structure of the data, these kinds of practical problems can be dealt with in a uniform fashion. In particular, we propose two robust segmentation algorithms: an algebraic method for data from multiple quadratic manifolds, and an information-theoretic approach for data from multiple linear subspaces. Our techniques draw from many diverse areas, including lossy data compression, sparse representation, algebraic geometry, and robust statistics. We verify the efficacy of our algorithms by applying them to the segmentation of tracked image features of objects in a dynamic scene under the affine and perspective camera models, and the segmentation of a natural image into regions with homogeneous texture. We benchmark the performance of our methods on many publicly available notion and imagery datasets. Our results are on par with state-of-the-art results, in many cases exceeding them. Finally, we explore potential extensions and improvements to our techniques as well as new applications.","Made available in DSpace on 2015-09-25T20:09:46Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3392444.pdf: 1786879 bytes, checksum: 69aaa76f760241b2164b390ef5b2c9e1 (MD5) Previous issue date: 2009","Embargo set by: Seth Robbins for item 82430 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","95 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2009."]},{"key":"dc:title","label":"Title","values":["Harnessing Sparse and Low-Dimensional Structures for Robust Clustering of Imagery Data"]}]}],"canonical_facts":{"dc:contributor":["Ma, Yi"],"dc:creator":["Rao, Shankar Ramamohan"],"dc:date":["2015-09-25T20:09:46Z","10000-01-01","2009"],"dc:description":["We propose a robust framework for clustering data. In practice, data obtained from real measurement devices can be incomplete, corrupted by gross errors, or not correspond to any assumed model. We show that, by properly harnessing the intrinsic low-dimensional structure of the data, these kinds of practical problems can be dealt with in a uniform fashion. In particular, we propose two robust segmentation algorithms: an algebraic method for data from multiple quadratic manifolds, and an information-theoretic approach for data from multiple linear subspaces. Our techniques draw from many diverse areas, including lossy data compression, sparse representation, algebraic geometry, and robust statistics. We verify the efficacy of our algorithms by applying them to the segmentation of tracked image features of objects in a dynamic scene under the affine and perspective camera models, and the segmentation of a natural image into regions with homogeneous texture. We benchmark the performance of our methods on many publicly available notion and imagery datasets. Our results are on par with state-of-the-art results, in many cases exceeding them. Finally, we explore potential extensions and improvements to our techniques as well as new applications.","Made available in DSpace on 2015-09-25T20:09:46Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3392444.pdf: 1786879 bytes, checksum: 69aaa76f760241b2164b390ef5b2c9e1 (MD5) Previous issue date: 2009","Embargo set by: Seth Robbins for item 82430 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","95 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2009."],"dc:identifier":["http://hdl.handle.net/2142/81149","(MiAaPQ)AAI3392444"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Harnessing Sparse and Low-Dimensional Structures for Robust Clustering of Imagery Data"],"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"}