文章基本信息

标题：LogDet Rank Minimization with Application to Subspace Clustering
本地全文：下载
作者：Zhao Kang ; Chong Peng ; Jie Cheng 等
期刊名称：Computational Intelligence and Neuroscience
印刷版ISSN：1687-5265
电子版ISSN：1687-5273
出版年度：2015
卷号：2015
DOI：10.1155/2015/824289
出版社：Hindawi Publishing Corporation
摘要：Low-rank matrix is desired in many machine learning and computer vision problems. Most of the recent studies use the nuclear norm as a convex surrogate of the rank operator. However, all singular values are simply added together by the nuclear norm, and thus the rank may not be well approximated in practical problems. In this paper, we propose using a log-determinant (LogDet) function as a smooth and closer, though nonconvex, approximation to rank for obtaining a low-rank representation in subspace clustering. Augmented Lagrange multipliers strategy is applied to iteratively optimize the LogDet-based nonconvex objective function on potentially large-scale data. By making use of the angular information of principal directions of the resultant low-rank representation, an affinity graph matrix is constructed for spectral clustering. Experimental results on motion segmentation and face clustering data demonstrate that the proposed method often outperforms state-of-the-art subspace clustering algorithms.