Please use this identifier to cite or link to this item:
Title: Reweighted sparse subspace clustering
Authors: Xu, J
Xu, K
Chen, K
Ruan, J
Keywords: Compressed sensing
Convex programming
Human face clustering
Iterative weighting
Motion segmentation
Non-rigid motions
Sparse representation
Spectral clustering
Subspace clustering
ℓ1 minimization
Issue Date: 2015
Publisher: Academic Press Inc.
Source: Computer vision and image understanding, 2015, v. 138, 2246, p. 25-37 How to cite?
Journal: Computer Vision and Image Understanding 
Abstract: Abstract Motion segmentation and human face clustering are two fundamental problems in computer vision. The state-of-the-art algorithms employ the subspace clustering scheme when processing the two problems. Among these algorithms, sparse subspace clustering (SSC) achieves the state-of-the-art clustering performance via solving a ℓ1 minimization problem and employing the spectral clustering technique for clustering data points into different subspaces. In this paper, we propose an iterative weighting (reweighted) ℓ1 minimization framework which largely improves the performance of the traditional ℓ1 minimization framework. The reweighted ℓ1 minimization framework makes a better approximation to the ℓ0 minimization than tradition ℓ1 minimization framework. Following the reweighted ℓ1 minimization framework, we propose a new subspace clustering algorithm, namely, reweighted sparse subspace clustering (RSSC). Through an extensive evaluation on three benchmark datasets, we demonstrate that the proposed RSSC algorithm significantly reduces the clustering errors over the SSC algorithm while the additional reweighted step has a moderate impact on the computational cost. The proposed RSSC also achieves lowest clustering errors among recently proposed algorithms. On the other hand, as majority of the algorithms were evaluated on the Hopkins155 dataset, which is insufficient of non-rigid motion sequences, the dataset can hardly reflect the ability of the existing algorithms on processing non-rigid motion segmentation. Therefore, we evaluate the performance of the proposed RSSC and state-of-the-art algorithms on the Freiburg-Berkeley Motion Segmentation Dataset, which mainly contains non-rigid motion sequences. The performance of these state-of-the-art algorithms, as well as RSSC, will drop dramatically on this dataset with mostly non-rigid motion sequences. Though the proposed RSSC achieves the better performance than other algorithms, the results suggest that novel algorithms that focus on segmentation of non-rigid motions are still in need.
ISSN: 1077-3142
DOI: 10.1016/j.cviu.2015.04.003
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Jul 28, 2017


Last Week
Last month
Citations as of Aug 15, 2017

Page view(s)

Last Week
Last month
Checked on Aug 14, 2017

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.