Latent space robust subspace segmentation based on low-rank and locality constraints
作者：
Highlights：
• We propose a new latent space robust subspace segmentation method.
• We build the connections between the proposed algorithm and robust coding methods.
• We devise a weighted l1-norm regularizer to capture local structures of data sets.
摘要
•We propose a new latent space robust subspace segmentation method.•We build the connections between the proposed algorithm and robust coding methods.•We devise a weighted l1-norm regularizer to capture local structures of data sets.
论文关键词：Subspace segmentation,Low-rank representation,Latent space,Robust coding
论文评审过程：Available online 29 April 2015, Version of Record 26 May 2015.
论文官网地址：https://doi.org/10.1016/j.eswa.2015.04.041
