Sciweavers

Share
CORR
2010
Springer

Real-time Robust Principal Components' Pursuit

9 years 8 months ago
Real-time Robust Principal Components' Pursuit
In the recent work of Candes et al, the problem of recovering low rank matrix corrupted by i.i.d. sparse outliers is studied and a very elegant solution, principal component pursuit, is proposed. It is motivated as a tool for video surveillance applications with the background image sequence forming the low rank part and the moving objects/persons/abnormalities forming the sparse part. Each image frame is treated as a column vector of the data matrix made up of a low rank matrix and a sparse corruption matrix. Principal component pursuit solves the problem under the assumptions that the singular vectors of the low rank matrix are spread out and the sparsity pattern of the sparse matrix is uniformly random. However, in practice, usually the sparsity pattern and the signal values of the sparse part (moving persons/objects) change in a correlated fashion over time, for e.g., the object moves slowly and/or with roughly constant velocity. This will often result in a low rank sparse matrix. ...
Chenlu Qiu, Namrata Vaswani
Added 22 Mar 2011
Updated 22 Mar 2011
Type Journal
Year 2010
Where CORR
Authors Chenlu Qiu, Namrata Vaswani
Comments (0)
books