Face Identification With Top-Push Constrained Generalized Low-Rank Approximation of Matrices

We present a novel top-push constrained feature learning (TFL) method for face identification. The idea is to learn low-rank approximations from raw intensity face images such that the squared distance between all faces of the same identity should be smaller than that of different identities by a margin. To this end, we formulate the learning process under the framework of generalized low-rank approximation of matrices (GLRAM) supervised with a top-push constraint. GLRAM operates on the matrix representation of images to seek low-dimensional and compact features, which improves the discriminative power of the features while reducing the time and space costs. The top-push constraint aims to optimize the face identification accuracy of the top-rank matching list, which makes the learned features more discriminative and compact, thus reducing the variability and ambiguity. Once the optimization is finished, the features are vectorized and used for similarity measurement. The effectiveness of TFL is verified on four publicly available face datasets.