| Summary: | Nowadays there is growing research interest in designing high performance algorithms for automatic facial recognition systems, and an efficient computational approach is required. Accurate face recognition, however, is difficult due to facial complexity. In this paper, we propose a novel and efficient facial image representation named the Stretched Natural Vector (SNV) method which is defined on the intensity values in a grayscale image matrix, where each entry in an intensity matrix records the level of gray at a single pixel in a m×n array. We prove that the SNV defined in this context can distinguish photo matrices in strict one-to-one fashion. This is to say it is theoretically possible to fully recover a grayscale image matrix from the corresponding complete SNV. Experiments on a number of datasets demonstrate that our truncated SNV method compares favorably both in recognition accuracy and efficiency (measured in wall-clock time) against “Full-Pixel” algorithm, Principal Component Analysis (PCA) method, and even its widely used variants - two dimensional PCA (2DPCA) method and two dimensional Euler PCA (2D-EPCA) method.
|
|---|
