Side Information in Robust Principal Component Analysis: Algorithms and Applications

Robust Principal Component Analysis (RPCA) aims at recovering a low-rank subspace from grossly corrupted high-dimensional (often visual) data and is a cornerstone in many machine learning and computer vision applications. Even though RPCA has been shown to be very successful in solving many rank min...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Xue, Niannan, Panagakis, Yannis, Zafeiriou, Stefanos
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Xue, Niannan
Panagakis, Yannis
Zafeiriou, Stefanos
description Robust Principal Component Analysis (RPCA) aims at recovering a low-rank subspace from grossly corrupted high-dimensional (often visual) data and is a cornerstone in many machine learning and computer vision applications. Even though RPCA has been shown to be very successful in solving many rank minimisation problems, there are still cases where degenerate or suboptimal solutions are obtained. This is likely to be remedied by taking into account of domain-dependent prior knowledge. In this paper, we propose two models for the RPCA problem with the aid of side information on the low-rank structure of the data. The versatility of the proposed methods is demonstrated by applying them to four applications, namely background subtraction, facial image denoising, face and facial expression recognition. Experimental results on synthetic and five real world datasets indicate the robustness and effectiveness of the proposed methods on these application domains, largely outperforming six previous approaches.
doi_str_mv 10.48550/arxiv.1702.00648
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1702_00648</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1702_00648</sourcerecordid><originalsourceid>FETCH-LOGICAL-a678-c1e26eeebaa1854e5e4de4bd12a7f36472af8191c7ec7f604b348f1e4e3290e13</originalsourceid><addsrcrecordid>eNotz81OxCAUQGE2LszoA7iSF2iFQgvjrmn8mWSSMdp9c9telIQCgWqctzdWV2d3ko-QG85Kqeua3UH6tl8lV6wqGWukviT9m52RHrwJaYHVBk-tp69h_MwrfUnWTzaCo11YYvDoV9p6cOds8z1t3XtIdv1YMgU_0zZGZ6dtka_IhQGX8fq_O9I_PvTdc3E8PR269lhAo3QxcawaRBwBuK4l1ihnlOPMK1BGNFJVYDTf80nhpEzD5CikNhwlimrPkIsduf3bbqwhJrtAOg-_vGHjiR8SXUvt</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Side Information in Robust Principal Component Analysis: Algorithms and Applications</title><source>arXiv.org</source><creator>Xue, Niannan ; Panagakis, Yannis ; Zafeiriou, Stefanos</creator><creatorcontrib>Xue, Niannan ; Panagakis, Yannis ; Zafeiriou, Stefanos</creatorcontrib><description>Robust Principal Component Analysis (RPCA) aims at recovering a low-rank subspace from grossly corrupted high-dimensional (often visual) data and is a cornerstone in many machine learning and computer vision applications. Even though RPCA has been shown to be very successful in solving many rank minimisation problems, there are still cases where degenerate or suboptimal solutions are obtained. This is likely to be remedied by taking into account of domain-dependent prior knowledge. In this paper, we propose two models for the RPCA problem with the aid of side information on the low-rank structure of the data. The versatility of the proposed methods is demonstrated by applying them to four applications, namely background subtraction, facial image denoising, face and facial expression recognition. Experimental results on synthetic and five real world datasets indicate the robustness and effectiveness of the proposed methods on these application domains, largely outperforming six previous approaches.</description><identifier>DOI: 10.48550/arxiv.1702.00648</identifier><language>eng</language><subject>Computer Science - Computer Vision and Pattern Recognition</subject><creationdate>2017-02</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,777,882</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1702.00648$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1702.00648$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Xue, Niannan</creatorcontrib><creatorcontrib>Panagakis, Yannis</creatorcontrib><creatorcontrib>Zafeiriou, Stefanos</creatorcontrib><title>Side Information in Robust Principal Component Analysis: Algorithms and Applications</title><description>Robust Principal Component Analysis (RPCA) aims at recovering a low-rank subspace from grossly corrupted high-dimensional (often visual) data and is a cornerstone in many machine learning and computer vision applications. Even though RPCA has been shown to be very successful in solving many rank minimisation problems, there are still cases where degenerate or suboptimal solutions are obtained. This is likely to be remedied by taking into account of domain-dependent prior knowledge. In this paper, we propose two models for the RPCA problem with the aid of side information on the low-rank structure of the data. The versatility of the proposed methods is demonstrated by applying them to four applications, namely background subtraction, facial image denoising, face and facial expression recognition. Experimental results on synthetic and five real world datasets indicate the robustness and effectiveness of the proposed methods on these application domains, largely outperforming six previous approaches.</description><subject>Computer Science - Computer Vision and Pattern Recognition</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz81OxCAUQGE2LszoA7iSF2iFQgvjrmn8mWSSMdp9c9telIQCgWqctzdWV2d3ko-QG85Kqeua3UH6tl8lV6wqGWukviT9m52RHrwJaYHVBk-tp69h_MwrfUnWTzaCo11YYvDoV9p6cOds8z1t3XtIdv1YMgU_0zZGZ6dtka_IhQGX8fq_O9I_PvTdc3E8PR269lhAo3QxcawaRBwBuK4l1ihnlOPMK1BGNFJVYDTf80nhpEzD5CikNhwlimrPkIsduf3bbqwhJrtAOg-_vGHjiR8SXUvt</recordid><startdate>20170202</startdate><enddate>20170202</enddate><creator>Xue, Niannan</creator><creator>Panagakis, Yannis</creator><creator>Zafeiriou, Stefanos</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20170202</creationdate><title>Side Information in Robust Principal Component Analysis: Algorithms and Applications</title><author>Xue, Niannan ; Panagakis, Yannis ; Zafeiriou, Stefanos</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a678-c1e26eeebaa1854e5e4de4bd12a7f36472af8191c7ec7f604b348f1e4e3290e13</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Computer Science - Computer Vision and Pattern Recognition</topic><toplevel>online_resources</toplevel><creatorcontrib>Xue, Niannan</creatorcontrib><creatorcontrib>Panagakis, Yannis</creatorcontrib><creatorcontrib>Zafeiriou, Stefanos</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Xue, Niannan</au><au>Panagakis, Yannis</au><au>Zafeiriou, Stefanos</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Side Information in Robust Principal Component Analysis: Algorithms and Applications</atitle><date>2017-02-02</date><risdate>2017</risdate><abstract>Robust Principal Component Analysis (RPCA) aims at recovering a low-rank subspace from grossly corrupted high-dimensional (often visual) data and is a cornerstone in many machine learning and computer vision applications. Even though RPCA has been shown to be very successful in solving many rank minimisation problems, there are still cases where degenerate or suboptimal solutions are obtained. This is likely to be remedied by taking into account of domain-dependent prior knowledge. In this paper, we propose two models for the RPCA problem with the aid of side information on the low-rank structure of the data. The versatility of the proposed methods is demonstrated by applying them to four applications, namely background subtraction, facial image denoising, face and facial expression recognition. Experimental results on synthetic and five real world datasets indicate the robustness and effectiveness of the proposed methods on these application domains, largely outperforming six previous approaches.</abstract><doi>10.48550/arxiv.1702.00648</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1702.00648
ispartof
issn
language eng
recordid cdi_arxiv_primary_1702_00648
source arXiv.org
subjects Computer Science - Computer Vision and Pattern Recognition
title Side Information in Robust Principal Component Analysis: Algorithms and Applications
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T06%3A15%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Side%20Information%20in%20Robust%20Principal%20Component%20Analysis:%20Algorithms%20and%20Applications&rft.au=Xue,%20Niannan&rft.date=2017-02-02&rft_id=info:doi/10.48550/arxiv.1702.00648&rft_dat=%3Carxiv_GOX%3E1702_00648%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true