Fixed-Rank Representation for Unsupervised Visual Learning

June 2012

Fixed-Rank Representation for Unsupervised Visual Learning

Authors:

R. Liu, Z. Lin, F. De La Torre, and Z. Su
Conference Paper
Proceedings of (CVPR) Computer Vision and Pattern Recognition

Abstract:

Subspace clustering and feature extraction are two of the most commonly used unsupervised learning techniques in computer vision and pattern recognition. State-of-the-art techniques for subspace clustering make use of recent advances in sparsity and rank minimization. However, existing techniques are computationally expensive and may result in degenerate solutions that degrade clustering performance in the case of insufficient data sampling. To partially solve these problems, and inspired by existing work on matrix factorization, this paper proposes fixed-rank representation (FRR) as a unified framework for unsupervised visual learning. FRR is able to reveal the structure of multiple subspaces in closed-form when the data is noiseless. Furthermore, we prove that under some suitable conditions, even with insufficient observations, FRR can still reveal the true subspace memberships. To achieve robustness to outliers and noise, a sparse regularizer is introduced into the FRR framework. Beyond subspace clustering, FRR can be used for unsupervised feature extraction. As a non-trivial byproduct, a fast numerical solver is developed for FRR. Experimental results on both synthetic data and real applications validate our theoretical analysis and demonstrate the benefits of FRR for unsupervised visual learning.
@conference{Liu-2012-120910,
author = {R. Liu And Z. Lin And F. De La Torre And Z. Su},
title = {Fixed-Rank Representation for Unsupervised Visual Learning},
booktitle = {Proceedings of (CVPR) Computer Vision and Pattern Recognition},
year = {2012},
month = {June},
pages = {598 - 605},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.