Semi-supervised bilinear subspace learning.

Abstract

Recent research has demonstrated the success of tensor based subspace learning in both unsupervised and supervised configurations (e.g., 2-D PCA, 2-D LDA, and DATER). In this correspondence, we present a new semi-supervised subspace learning algorithm by integrating the tensor representation and the complementary information conveyed by unlabeled data. Conventional semi-supervised algorithms mostly impose a regularization term based on the data representation in the original feature space. Instead, we utilize graph Laplacian regularization based on the low-dimensional feature space. An iterative algorithm, referred to as adaptive regularization based semi-supervised discriminant analysis with tensor representation (ARSDA/T), is also developed to compute the solution. In addition to handling tensor data, a vector-based variant (ARSDA/V) is also presented, in which the tensor data are converted into vectors before subspace learning. Comprehensive experiments on the CMU PIE and YALE-B databases demonstrate that ARSDA/T brings significant improvement in face recognition accuracy over both conventional supervised and semi-supervised subspace learning algorithms.