Fast Complete Discriminant Locality Preserving Projections for Face Recognition
Lu Gui · 2011
Fast complete discriminant locality preserving projections(FCDLPP) is proposed.There is only one step of economic QR factorization for FCDLPP algorithm to obtain the optimal discriminant vectors in the null space of locality preserving within-class scatter.Then,one step of eigen-decomposition is used to obtain the optimal discriminant vectors in the principal space of the locality preserving within-class scatter.Besides,FCDLPP fuses the regular discriminant features in the principal space and irregular discriminant features in the null space.Theoretical analyses and experimental results show that the proposed FCDLPP outperforms complete discriminant locality preserving projections(CDLPP) on computational speed and recognition rates.