Weighted Low Rank Approximation for Background Estimation Problems

July 04, 2017 Β· Declared Dead Β· πŸ› 2017 IEEE International Conference on Computer Vision Workshops (ICCVW)

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Aritra Dutta, Xin Li arXiv ID 1707.01753 Category math.OC: Optimization & Control Cross-listed cs.CV Citations 13 Venue 2017 IEEE International Conference on Computer Vision Workshops (ICCVW) Last Checked 4 months ago
Abstract
Classical principal component analysis (PCA) is not robust to the presence of sparse outliers in the data. The use of the $\ell_1$ norm in the Robust PCA (RPCA) method successfully eliminates the weakness of PCA in separating the sparse outliers. In this paper, by sticking a simple weight to the Frobenius norm, we propose a weighted low rank (WLR) method to avoid the often computationally expensive algorithms relying on the $\ell_1$ norm. As a proof of concept, a background estimation model has been presented and compared with two $\ell_1$ norm minimization algorithms. We illustrate that as long as a simple weight matrix is inferred from the data, one can use the weighted Frobenius norm and achieve the same or better performance.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Optimization & Control

Died the same way β€” πŸ‘» Ghosted