10 April 2018 A Gaussian-based rank approximation for subspace clustering
Author Affiliations +
Proceedings Volume 10615, Ninth International Conference on Graphic and Image Processing (ICGIP 2017); 106152B (2018) https://doi.org/10.1117/12.2302503
Event: Ninth International Conference on Graphic and Image Processing, 2017, Qingdao, China
Abstract
Low-rank representation (LRR) has been shown successful in seeking low-rank structures of data relationships in a union of subspaces. Generally, LRR and LRR-based variants need to solve the nuclear norm-based minimization problems. Beyond the success of such methods, it has been widely noted that the nuclear norm may not be a good rank approximation because it simply adds all singular values of a matrix together and thus large singular values may dominant the weight. This results in far from satisfactory rank approximation and may degrade the performance of lowrank models based on the nuclear norm. In this paper, we propose a novel nonconvex rank approximation based on the Gaussian distribution function, which has demanding properties to be a better rank approximation than the nuclear norm. Then a low-rank model is proposed based on the new rank approximation with application to motion segmentation. Experimental results have shown significant improvements and verified the effectiveness of our method.
© (2018) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Fei Xu, Fei Xu, Chong Peng, Chong Peng, Yunhong Hu, Yunhong Hu, Guoping He, Guoping He, "A Gaussian-based rank approximation for subspace clustering", Proc. SPIE 10615, Ninth International Conference on Graphic and Image Processing (ICGIP 2017), 106152B (10 April 2018); doi: 10.1117/12.2302503; https://doi.org/10.1117/12.2302503
PROCEEDINGS
8 PAGES


SHARE
Back to Top