Robust orthonormal subspace learning: Efficient recovery of corrupted low-rank matrices
Low-rank matrix recovery from a corrupted observation has many applications in computer vision. Conventional methods address this problem by iterating between nuclear norm minimization and sparsity minimization. However, iterative nuclear norm minimization is computationally prohibitive for large-scale data (e.g., video) analysis. In this paper, we propose a Robust Orthogonal Subspace Learning (ROSL) method to achieve efficient low-rank recovery. Our intuition is a novel rank measure on the...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition|
|01_Shu_Robust_orthonormal_subspace_2014.pdf||699.5 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.