Efficient algorithms for robust and stable principal component pursuit problems

The problem of recovering a low-rank matrix from a set of observations corrupted with gross sparse error is known as the robust principal component analysis (RPCA) and has many applications in computer vision, image processing and web data ranking. It has been shown that under certain conditions, th...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computational optimization and applications Ročník 58; číslo 1; s. 1 - 29
Hlavní autori: Aybat, Necdet Serhat, Goldfarb, Donald, Ma, Shiqian
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Boston Springer US 01.05.2014
Springer Nature B.V
Predmet:
Algorithms
Analysis
Convex analysis
Convex and Discrete Geometry
Data smoothing
Extraction
Image processing
Industrial engineering
Management Science
Mathematical analysis
Mathematical models
Mathematics
Mathematics and Statistics
Methods
Noise reduction
Operations Research
Operations Research/Decision Theory
Optimization
Principal component analysis
Principal components analysis
Sparsity
Statistics
Studies
Surveillance
Iteration complexity
Convex optimization
Smoothing
Alternating direction augmented Lagrangian method
Alternating linearization method
Accelerated proximal gradient method
Compressed sensing
Principal component analysis
Matrix completion
ISSN:0926-6003, 1573-2894
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The problem of recovering a low-rank matrix from a set of observations corrupted with gross sparse error is known as the robust principal component analysis (RPCA) and has many applications in computer vision, image processing and web data ranking. It has been shown that under certain conditions, the solution to the NP-hard RPCA problem can be obtained by solving a convex optimization problem, namely the robust principal component pursuit (RPCP). Moreover, if the observed data matrix has also been corrupted by a dense noise matrix in addition to gross sparse error, then the stable principal component pursuit (SPCP) problem is solved to recover the low-rank matrix. In this paper, we develop efficient algorithms with provable iteration complexity bounds for solving RPCP and SPCP. Numerical results on problems with millions of variables and constraints such as foreground extraction from surveillance video, shadow and specularity removal from face images and video denoising from heavily corrupted data show that our algorithms are competitive to current state-of-the-art solvers for RPCP and SPCP in terms of accuracy and speed.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0926-6003
1573-2894
DOI:10.1007/s10589-013-9613-0