Robust Low-Rank Subspace Segmentation with Semidefinite Guarantees

• Published in: 2010 IEEE International Conference on Data Mining Workshops pp. 1179 - 1188
• Main Authors: Yuzhao Ni, Ju Sun, Xiaotong Yuan, Shuicheng Yan, Loong-Fah Cheong
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.12.2010
• Subjects: affinity matrix learning; Clustering algorithms; eigenvalue thresholding; Kernel; Minimization; Noise; Optimization; rank minimization; robust estimation; Robustness; spectral clustering; Symmetric matrices
• DOI: 10.1109/ICDMW.2010.64
• ISBN: 9781424492442; 1424492440
• ISSN: 2375-9232

Recently there is a line of research work proposing to employ Spectral Clustering (SC) to segment (group) high-dimensional structural data such as those (approximately) lying on subspaces or low-dimensional manifolds. By learning the affinity matrix in the form of sparse reconstruction, techniques proposed in this vein often considerably boost the performance in subspace settings where traditional SC can fail. Despite the success, there are fundamental problems that have been left unsolved: the spectrum property of the learned affinity matrix cannot be gauged in advance, and there is often one ugly symmetrization step that post-processes the affinity for SC input. Hence we advocate to enforce the symmetric positive semidefinite constraint explicitly during learning (Low-Rank Representation with Positive SemiDefinite constraint, or LRR-PSD), and show that factually it can be solved in an exquisite scheme efficiently instead of general-purpose SDP solvers that usually scale up poorly. We provide rigorous mathematical derivations to show that, in its canonical form, LRR-PSD is equivalent to the recently proposed Low-Rank Representation (LRR) scheme, and hence offer theoretic and practical insights to both LRR-PSD and LRR, inviting future research. As per the computational cost, our proposal is at most comparable to that of LRR, if not less. We validate our theoretic analysis and optimization scheme by experiments on both synthetic and real data sets.