Latent space robust subspace segmentation based on low-rank and locality constraints
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.
latent space subspace segmentation robust coding low-rank representation