Please use this identifier to cite or link to this item:
|Title:||Background recovery by fixed-rank robust principal component analysis||Authors:||Leow, W.K.
|Issue Date:||2013||Citation:||Leow, W.K.,Cheng, Y.,Zhang, L.,Sim, T.,Foo, L. (2013). Background recovery by fixed-rank robust principal component analysis. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 8047 LNCS (PART 1) : 54-61. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-40261-6_6||Abstract:||Background recovery is a very important theme in computer vision applications. Recent research shows that robust principal component analysis (RPCA) is a promising approach for solving problems such as noise removal, video background modeling, and removal of shadows and specularity. RPCA utilizes the fact that the background is common in multiple views of a scene, and attempts to decompose the data matrix constructed from input images into a low-rank matrix and a sparse matrix. This is possible if the sparse matrix is sufficiently sparse, which may not be true in computer vision applications. Moreover, algorithmic parameters need to be fine tuned to yield accurate results. This paper proposes a fixed-rank RPCA algorithm for solving background recovering problems whose low-rank matrices have known ranks. Comprehensive tests show that, by fixing the rank of the low-rank matrix to a known value, the fixed-rank algorithm produces more reliable and accurate results than existing low-rank RPCA algorithm. © 2013 Springer-Verlag.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/78039||ISBN:||9783642402609||ISSN:||03029743||DOI:||10.1007/978-3-642-40261-6_6|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 19, 2019
checked on Jul 20, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.