Null space clustering with applications to motion segmentation and face clustering

The problems of motion segmentation and face clustering can be addressed in a framework of subspace clustering methods. In this paper, we tackle the more general problem of clustering data points lying in a union of low-dimensional linear(or affine) subspaces, which can be naturally applied in motio...

Full description

Saved in:
Bibliographic Details
Published in2014 IEEE International Conference on Image Processing (ICIP) pp. 283 - 287
Main Authors Pan Ji, Yiran Zhong, Hongdong Li, Salzmann, Mathieu
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2014
Subjects
affinity matrix
Clustering algorithms
Computer vision
Face
face clustering
Minimization
Motion segmentation
Noise
normalized cuts
Null space
subspace clustering
Online AccessGet full text

Cover

More Information
Summary:The problems of motion segmentation and face clustering can be addressed in a framework of subspace clustering methods. In this paper, we tackle the more general problem of clustering data points lying in a union of low-dimensional linear(or affine) subspaces, which can be naturally applied in motion segmentation and face clustering. For data points drawn from linear (or affine) subspaces, we propose a novel algorithm called Null Space Clustering (NSC), utilizing the null space of the data matrix to construct the affinity matrix. To better deal with noise and outliers, it is converted to an equivalent problem with Frobenius norm minimization, which can be solved efficiently. We demonstrate that the proposed NSC leads to improved performance in terms of clustering accuracy and efficiency when compared to state-of-the-art algorithms on two well-known datasets, i.e., Hopkins 155 and Extended Yale B.
ISSN:1522-4880
2381-8549
DOI:10.1109/ICIP.2014.7025056