Fast Haar transform based feature extraction for face representation and recognition
IEEE Transactions on Information Forensics and Security
G-Optimal Feature Selection with Laplacian regularization
Neurocomputing
Hi-index | 0.00 |
A fast subspace analysis and feature extraction algorithm is proposed which is based on fast Haar transform and integral vector. In rapid object detection and conventional binary subspace learning, Haar-like functions have been frequently used but true Haar functions are seldom employed. In this paper we have shown that true Haar functions can be successfully used to accelerate subspace analysis and feature extraction. Both the training and testing speed of the proposed method is higher than conventional algorithms. Experimental results on face database demonstrated its effectiveness.