Face recognition using regularised generalised discriminant locality preserving projections

Face recognition using regularised generalised discriminant locality preserving projections

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Computer Vision — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Discriminant locality preserving projection (DLPP) is a recently proposed algorithm, which is an extension of locality preserving projections (LPP) and can encode both the geometrical and discriminant structure of the data manifold. However, DLPP suffers from small sample size (SSS) problem which is often encountered in face recognition tasks. To deal with this problem, the authors propose a novel regularised generalised discriminant locality preserving projections (RGDLPP) method for facial feature extraction and recognition. First, locality preserving within-class scatter in DLPP method is replaced by locality preserving total scatter and all the training samples are projected into the range of locality preserving total scatter. Then the authors regularise the small and zero eigenvalues of locality preserving within-class scatter since the small eigenvalues are sensitive to noise. RGDLPP address SSS problem by removing the null space of locality preserving total scatter without loss of discriminant information. Meanwhile, RGDLPP can alleviate the problem of noise disturbance of the small eigenvalues. Experiments on the ORL, Yale, FERET and PIE face databases show the effectiveness of the proposed RGDLPP.


    1. 1)
      • K. Fukunaga . (1991) Introduction to statistical pattern recognition.
    2. 2)
      • R.O. Duda , P.E. Hart , D.G. Stork . Pattern classification.
    3. 3)
    4. 4)
    5. 5)
    6. 6)
    7. 7)
      • Huang, R., Liu, Q., Lu, H., Ma, S.: `Solving the small size problem of LDA', Proc. 16th Int Conf. Pattern Recognition, 2002, p. 29–32.
    8. 8)
      • J. Yang , J.Y. Yang . Why can LDA be performed in PCA transformed space?. Patt. Recogn. , 3 , 563 - 566
    9. 9)
    10. 10)
    11. 11)
    12. 12)
    13. 13)
    14. 14)
    15. 15)
    16. 16)
    17. 17)
    18. 18)
    19. 19)
    20. 20)
      • He, X., Yan, S., Hu, Y., Zhang, H.: `Learning a locality preserving subspace for visual recognition', Proc. Ninth Int. Conf. Computer Vision, 2003, France, p. 385–392.
    21. 21)
    22. 22)
    23. 23)
    24. 24)
    25. 25)
    26. 26)
      • Yambor, W., Draper, B., Beveridge, R.: `Analyzing PCA-based face recognition algorithms: eigenvectors selection and distance measures', Empirical Evaluation Methods in Computer Vision, 2002, Singapore, p. 1–14.
    27. 27)
    28. 28)
    29. 29)
    30. 30)
      • Gao, Y., Wang, Y., Feng, X., Zhou, X.: `Face recognition using most discriminative local and global features', 18thInt. Conf. Pattern Recognition, ICPR, 2006, Hong Kong, p. 351–354.
    31. 31)
    32. 32)
    33. 33)
      • Guo, Y., Xu, Z.: `Local Gabor phase difference pattern for face recognition', 19thInt. Conf. Pattern Recognition, 2008, Tampa, FL, p. 1–4.
    34. 34)

Related content

This is a required field
Please enter a valid email address