Skip to main content

Advertisement

Log in

Holistic and partial facial features fusion by binary particle swarm optimization

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

This paper proposes a novel binary particle swarm optimization (PSO) algorithm using artificial immune system (AIS) for face recognition. Inspired by face recognition ability in human visual system (HVS), this algorithm fuses the information of the holistic and partial facial features. The holistic facial features are extracted by using principal component analysis (PCA), while the partial facial features are extracted by non-negative matrix factorization with sparseness constraints (NMFs). Linear discriminant analysis (LDA) is then applied to enhance adaptability to illumination and expression. The proposed algorithm is used to select the fusion rules by minimizing the Bayesian error cost. The fusion rules are finally applied for face recognition. Experimental results using UMIST and ORL face databases show that the proposed fusion algorithm outperforms individual algorithm based on PCA or NMFs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Notes

  1. The ORL database is available from http://www.cam-orl.co.uk/facedatabase.html

References

  1. Jain AK, Ross A, Prabhakar S (2004) An introduction to biometric recognition. IEEE Trans Circuits Syst I 14(1):4–20

    Google Scholar 

  2. Lee DD, Seung HS (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401:788–791

    Article  Google Scholar 

  3. Patrik OH (2004) Non-negative matrix factorization with sparseness constraints. J Mach Learn Res 5:1457–1469

    Google Scholar 

  4. Pu XR, Yi Z et al (2005) Face recognition using fisher non-negative matrix factorization with sparseness constraints. Lect Notes Comput Sci LNCS 3497, pp. 112–117

    Article  Google Scholar 

  5. Turk MA, Pentland (1991) A face recognition using eigenfaces. Computer vision and pattern recognition, 1991. Proc. CVPR ’91., IEEE Computer Society Conference, pp. 586–591 3–6 June 1991

  6. Turk MA, Pentland A (1991) Eigenfaces for recognition. J Cogn Neurosci 3:71–86

    Article  Google Scholar 

  7. Zhao W, Chellappa R, Rosenfeld A, Phillips P (2000) Face recognition: a literature survey. Technical Report CAR-TR-948, University of Maryland

  8. Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks. IV, 1942–1948, IEEE Service Center, Piscataway, NJ

  9. Eberhart RC, Shi Y (1998) Evolving artificial neural networks. In: Proceedings of the IEEE international conference on neural networks and brain, Beijing, China.

  10. Fang Y, Tan T, Wang Y (2002) Fusion of global and local features for face verification. Pattern recognition, 2002. In: Proceedings of the 16th international conference, vol. 2, pp. 11–15, Aug 2002, see also vol. l2, pp. 382–385

  11. Belhumeur PN, Hespanha JP, Kriegman DJ (1997) Eigenfaces vs. fisherfaces: recognition using class specific linear projection. IEEE Trans Pattern Anal Mach Intell 19(7):711–720

    Article  Google Scholar 

  12. Martinez AM, Kak AC (2001) PCA versus LDA. IEEE Trans Pattern Anal Mach Intell 23(2):228–233

    Article  Google Scholar 

  13. Brunelli R, Falavigna D (1995) Person identification using multiple cues. IEEE Trans Pattern Anal Mach Intell 17(10):955–966

    Article  Google Scholar 

  14. Ross A, Jain AK (2003) Information Fusion in Biometrics. Pattern Recognition Letters 24(13):2115–2125

    Article  Google Scholar 

  15. Veeramachaneni K, Osadciw L, Varshney P (2005) An adaptive multimodal biometric management algorithm. IEEE Trans Syst Man Cybern C Appl Rev, 35(3):344–356

    Google Scholar 

  16. Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm optimization. Proceedings of the 1997 Conference System, Man, Cybernetics. Piscataway, NJ

  17. Afshinmanesh F, Marandi A, Rahimi-Kian A (2007) A novel binary particle swarm optimization method using artificial immune system. In: Proceedings of IEEE international conference on computer as a tool (EUROCON 2005) (in press)

  18. Abraham A, He Guo, and Hongbo Liu (2006) Swarm intelligence: foundations, perspectives and applications in swarm intelligence in data mining. In: Abraham A, Grosan C, Ramos V (eds) Studies in computational intelligence, p. 300, Springer, Germany, 2006

  19. Liu H, Abraham A (2005) Fuzzy turbulent particle swarm optimization. In: Proceeding of the 5th international conference on hybrid intelligent systems, Brazil. IEEE CS Press, USA

    Google Scholar 

  20. Pohlheim H (2005) Genetic algorithm toolbox test functions. Department of Automatic Control and Systems Engineering, University of Sheffield

  21. William Spears, C function code [Online]. Available: http://www.aic.nrl.navy.mil/spears/functs.dejong.html

  22. Graham D, Allinson N (1998) [Online]. The UMIST database is available from: http://images. ee.umist.ac.uk/danny/database.html

Download references

Acknowledgments

The authors would like to thank Miss Sheekha for proof reading this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiaorong Pu.

Additional information

This work was supported by National Science Foundation of China under Grant 60471055, and UESTC Youth Fund under Grant L08010601JX04030.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pu, X., Yi, Z. & Fang, Z. Holistic and partial facial features fusion by binary particle swarm optimization. Neural Comput & Applic 17, 481–488 (2008). https://doi.org/10.1007/s00521-007-0148-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-007-0148-0

Keywords

Navigation