Double Weighted Low-Rank Representation and Its Efficient Implementation
To overcome the limitations of existing low-rank representation(LRR)methods,i.e.,the error distribution should be known a prior and the leading rank components might be over penalized,this paper proposes a new low-rank representation based model,namely double weighted LRR(DWLRR),using two distinguished properties on the concerned representation matrix.The first characterizes various distributions of the residuals into an adaptively learned weighting matrix for more flexibility of noise resistance.The second employs a parameterized rational penalty as well as a weighting vector s to reveal the importance of different rank components for better approximation to the intrinsic subspace structure.Moreover,we derive a computationally efficient algorithm based on the parallel updating scheme and automatic thresholding operation.Comprehensive experimental results conducted on image clustering demonstrate the robustness and efficiency of DWLRR compared with other state-of-the-art models.
Subspace clustering Low-rank approximation Nonconvex surrogate function Proximal gradient method
Jianwei Zheng Kechen Lou Ping Yang Wanjun Chen Wanliang Wang
Zhejiang University of Technology,Hangzhou 310023,China
国际会议
澳门
英文
565-577
2019-04-14（万方平台首次上网日期，不代表论文的发表时间）