A Study to Develop Human Face Recognition using PCA, Neural Networks and Wavelet

DOI : 10.17577/IJERTCONV9IS05081

Download Full-Text PDF Cite this Publication

Text Only Version

A Study to Develop Human Face Recognition using PCA, Neural Networks and Wavelet

Jaimin H Jani Dr. Subhash chandra Desai

Abstract-A method to improve the precision of the face recognition with the help of an integrating of WT, PCA and neural networks has been presented in this paper. The three main critical issues for face recognition are- preprocessing, feature extraction and classifying rules. A hybrid approach for employing the three issues has been presented in this paper. A combination of wavelet transform (WT) and PCA has been used for preprocessing and feature extraction. Neural Network is discussed for achieving a fast decision in the presenceofvarietyoffacialexpressions,intheclassificationstage.Ov erall,improvisationsintheproposed methods accuracy isdone.

INTRODUCTION

Theauthenticationofusershavebeenincreasinginthepastf ewyears,becausetherequirementofsecurity isomnipresent.originally,identificationcardsandpasswo rdswerepopularforprovingauthenticity,though security through these methods is not very reliable. The latest interest of the researchers are authentication technologies based on biology, such as the ones that use iris, fingerprint, face, print of the palm and voice. Face recognition has gained popularity, largely because the process of authentication is done in a hands free way, without interrupting the activity of the user in any way. also, it is economic due to the low cost of the cameras and computer. Psycho-physicists and neuroscientist have focused on issues like face uniqueness, organization of face memory and the perception of faces by infants in the past 20 years. At the same time, engineers have studied, developed and designed algorithms of face recognition in the last 20 years. This paper focusses on the work of the engineers. Content based approach and face based approach are the two approached of face recognition system done by the computers.

There lation ship between the face boundary and facial eatures like nose, eyes, mouth are used in the content based approach. A huge classification error can be committed in the process of derivation, since all the human faces have features that are similar.

Inthefacebasedapproach,thefaceiscapturedasawholean distreatedasa2Dpattern.Thefaceismatched with the statistical regularities. Principal Component Analysis (PCA) is a face based approach, which has been proven to beeffective.

Karhunen- Loeve (KL) transform was proposed the representation of human faces by Sirovich and Kirby. The faces are represented with the help of eigenfaces, which are the linear combinations of weighed

eigenvector, in this method. However, a system of face recognition that makes use of the PCA has been developed by Turk and Pentland. But, this method is not free from limitations. The two limitations of this methodsarelargeloadofcomputationandpoor powerofdiscrimination.Themeasuredsimilaritybetween 2 pictures of the same individual by using the PCA method is high. However, the measured similarity of 2 pictures of different people is also high. Therefore, the discrimination power of this PCA method is very poor.

This drawback of PCA was improved by addition of Linear Discriminant Analysis (LDA) by Swets and Weng. A different method for selection of eigenfaces was suggested by OToole et al. they stated that the eigenvectors which have large eigenvalues is not the best method to differentiate face image. It was also presented by them that the representations of low dimension are efficient in identification of physical features of the face, like race and gender even though they might not be the best way for the recognition of human faces.

Heavyloadofcomputationintheprocessoffindingeigenve ctorsisanotherprobleminPCAbasedmethod is the h. The typical value of computational complexity of O(d2) is 128×128, where d= number of pixels. The cost of computation is beyond many existing computers power. However, Matrix Theory tells us that if the number of training images (N) is smaller than the value of d, the complexity of computation will be decreased to O(N2). Then also if N will increase the load of the computation is increased in cubic order. A newapproachintheapplicationofPCAinthelightofthealre adyexistingPCAapproachhasbeenproposed here. It is proposed that in this method, the image is decayed into many sub bands using the wavelet transform with many frequencycomponents.

Theresultshaveshownthatthe3 levelwavelethasperformedwellinfacerecognition.Them ethodwhich hasbeenproposedinthispaperdoesntworkontheimagere solutionof128x128,butonalowerresolution of 16×16. Hence, the computational complexity is reduced significantly for many applications, where the training images are more than 16×16. increASed accuracy in the recognition and better discrimination power was observed when PCA was applied on wavelet transform (WT) than when PCA was applied on the entire of the

original image.

REVIEW OF PCA

resolution of 16×16 is enough for human face recognition. When compared to the original image having a resolution 128×128, it leads to a reduction

Some major details of PCA are as follows:

Let X = {Xn,n = 1,…, N} R be an ensemble of vectors. When dxd is the product of width and height of the image, the row concatenation of the data of the image is form in the applications of imaging.

1 N

Let be the average vector in the ensemble E( X) =X N n=1fter subtracting the average from each

off the sub image by 64 times, thus implying a reduction on the computational load of 64 times.

  • Theimagesaredecomposedintosubbandswhichcorres

    pondtovariousfrequencyrangesundertheWTmethod. The computational overhead is minimized as the

    sub bands readily meet the input requirement in the system proposed in this paper.

  • While the Fourier decomposition support only the

    global information in the frequency domain, the WTmethodofdecompositionofimagesprovideslocali

    elementof X, a

    elementof X, a

    nformationindomainsfor bothfrequencyandspace.

    In mthoidsifpieadper, we applied two well-known mother

    ensemble of vectors, X = {X n ,n = 1,…, N} with Xn = Xn E( X ) is received .

    covariance matrix M for the ensemble X is defined by M = cov(X ) = E( X X ) , Where M is d 2 xd

    2 matrix, with elements.

    It is a well-known fact of the matrix theory that matrix M is always positive and will only have eigenvaluesthatarenon-negative.ThematrixM oftheeigenvectorsformabasisforRdxd.Thisbasis is called K-L basis.

    The eigenvectors in K are arranged in a descending order of eigenvalues in many applications. In order to compute the dxd eigenvalue from M, 2xd2 matrix has to be solved. In most chances, d=128, hence 16×16 matrix is solved for calculating the eigenvectors and eigenvalues.

    Computer systems requirement for the memory and computation are very high. Matrix theory states that ifN<dxd,thatisN,whichisthenumberoftrainingimage,iss mallerthanM,thecomputationalcomplexity decreases to O(N). Therefore, the implementation of PCA in characterizing the faces has become flexible. The number of training images in most researches is around

    200. But the M rises when the total number of training images in huge, such as2000.

    An images Wavelet decomposition

    In last 10 years, WT has become a useful tool in the analysis of the image. In this paper, WT has been chosen as the option of choice for image decomposition because-

  • The resolution of the sub images are decreased when

an image is decomposed by using the WT method. so, the computational complexity also decreases because it operates n an image which has alow resolution. It was observed by Harmon that a

wavelet Daubechies and Haar. We proposed method that uses by coefficients:

h0 = 0.48296291314453 p =0.83651630373781

p =0.22414386804201

p =0.12940952255126

For daubechies mother wavelet and coefficients: h0 =0.5,p =0.5

PROPOSED METHOD

In order to overcome the limitations of the PCA method, this wavelet based PCA method has been developed. also, utilizationof neural networks have been used for classifying faces. A multilayer architecture was adopted,which is fed by the vectors formed by combining wavelet and PCA and decreased inputunits.Usingaparticularfrequencybandofanimageof thefaceforPCAforsolvingthefirstproblem of PCA has beenproposed.

Using a reduced resolution image for dealing with the second limitation of the PCA has been proposed. The proposed system has two stages. one, training step in which extractions of features, reduction of dimensions and adjustment of weight of MLP neural networks is done. Second, recognition step for identifying the unknown images of faces.

In the training stage, feature extraction of reference images and adjusting the neural network parameters is included. In interested domain, the

representational basis of the images is identified in featureextraction.Then,inputimageistranslatedinaccord ancewiththerepresentationalbasis(whichhave been identified in the training stage) in the recognitionstage.

The 3 important steps in the training stage are-

  1. For decomposing the reference images, WT is applied. Then, by the decomposition of the wavelet in three levels, sub images of 16×16 pixels which have been obtained, areselected.

  2. For obtaining a set of representational basis, by selecting d eigenvectors which correspond to large eigenvalues and sub space projection, PCA is applied on the subimages.

  3. The obtained features of the reference images in the precious step are then used for training neural networks with the help of propagation algorithm. The processing carried out in both the training and recognition stage is similar, the only difference being in the recognition stage, the input unknown images are matched with reference images in the recognition stage. WT and PCA are used for transforming the unknown face images intro the representational basis when an unknown face is presented in the recognitionstage.

EXPERIMENTAL RESULT

The database of face image of Yale university and face database of ORL is used for evaluating the the method that has been proposed in this paper.

All the images in the database of Yale university have a 160×121 resolution. But the WT cant be applied as the images dimension are not the power of 2. The images were then cropped to 91×91, and hen resized in 128×128. A third level of WT decomposition was use for changing the resolution of images.

Table 1 and table 2 show the results of the proposed algorithm on the database of Yale university and database of ORL, and have used the hair mother wavelet. The results of the proposed algorithm in the

database of Yale and ORL which have used Daubechies mother wavelet has been shown in table 3 and 4. The performance in recognition on the test image of the Yale and ORL database which have used various components have been shown in table 5 and 6.

TABLE 1. Algorithm applied on Yale database and haarmotherwavelet.

TABLE 2. Algorithm applied on ORL database and haarmotherwavelet.

PCA on image

PCA on LL band of three level wavelet

Size of image

128*128

16*16

Recognition rate

90%

91.80%

TABLE 3. Algorithm applied on ORL database and Daubechies motherwavelet.

PCA on image

PCA on LL band of three level wavelet

Size of image

128*128

16*16

Recognition rate

90%

97.68%

TABLE 4. Algorithm applied on Yale database and Daubechiesmotherwavelet.

P C A

PCA on LL

band of three level wavelet

Size of image

128*12

8

16*16

Recognition rate

81.78

%

90.35%

TABLE 5. Recognition performance on testimagesof Yale database using the number ofprincipal

components.

Number

ANN

structure

Recog.

Average

1-15

15:25:15

88.37%

86.56%

1-25

25:30:15

90.35%

89.23%

1-35

35:30:15

89.78%

87.24%

1-45

45:25:15

88.92%

87.68%

1-60

60:35:15

83.78%

88.23%

1-80

80:40:15

85.56%

1-105

105:45:15

84.76%

83.67%

Number of P.C

ANN

structure

Recog. rate

(15

attempts)

Average of recognition

1-25

25:40:40

95.37%

94.14%

1-30

30:80:40

94.47%

93.15%

1-35

35:80:40

96.81%

95.45%

1-40

40:40:40

97.68%

96.56%

1-50

50:40:40

96.56%

95.24%

1-100

100:60:40

92.22%

91.72%

Number of P.C

ANN

structure

Recog. rate

(15

attempts)

Average of recognition

1-25

25:40:40

95.37%

94.14%

1-30

30:80:40

94.47%

93.15%

1-35

35:80:40

96.81%

95.45%

1-40

40:40:40

97.68%

96.56%

1-50

50:40:40

96.56%

95.24%

1-100

100:60:40

92.22%

91.72%

TABLE 6. Recognition performance on test images of ORL database using the number of principal components.

PCA on image

PCA on LL band of three level wavelet

Size of image

128*128

16*16

Recognition rate

81.78%

82.2%

TABLE 7. Recognition performance on test images of Yale database using MLP Neural networks by 25of principal components.

Number of P.C

ANN

structure

Recog.rate(10 attempts)

Average of recognition

1-25

25:15:15

89.69%

87.56%

1-25

25:20:15

90.06%

89.45%

1-25

25:25:15

90.10%

89.25%

1-25

25:30:15

90.35%

89.23%

1-25

25:40:15

90.05%

87.45%

1-25

25:50:15

90.%

88.34%

1-25

25:60:15

89.86%

87.24%

TABLE 8. Recognition performance on test images of ORL database using MLP Neural networks by 40 of principal components.

Numberof P.C

ANN

structure

Recog. Rate (15attempts)

Averageof recognition

1-40

40:10:40

89.67%

87.64%

1-40

40:20:40

91.34%

90.78%

1-40

40:30:40

96.99%

94.67%

1-40

40:40:40

97.68%

96.58%

1-40

40:50:40

96.89%

95.24%

1-40

40:60:40

96.57%

95.67%

1-40

40:70:40

95.98%

94.67%

CONCLUSION

A hybrid approach for face recognition has been presented in this paper, by taking care of three issues. For stagesoffeaturerecognitionandpreprocessing, WTandPCAhavebeenappliedina combinedform.And MLP has been explored for quick decision making when there is a wide variety of facial variations in the classification stage. It can be concluded based on the experiments done on Yale university and ORL databasethatacombinationofWT,PCAandMLPyieldsmost favorableperformance,becauseitexhibits the lowest redundant rate, lowest training time and highest rates ofrecognition.

The proposed method also exhibits the a low load of computation in both the stages- training and

recognition.

REFERENCES

  1. R. Chellappa, C. L. Wilson and S. Sirohey, "Human and machine recognition of faces: a survey,"

  2. Proceedings of the IEEE, May 1995, Vol. 83, No. 5, 705-740.

  3. G. Chow and X. Li, "Towards a system for automatic facial feature detection," Pattern

[4] Recognition, 1993, Vol. 26, No. 12, 1739-1755.

  1. F. Goudail, E. Lange, T. Iwamoto, K. Kyuma and N. Otsu, "Face recognition system using local autocorrelations and multiscale integration," IEEE Trans. PAMI, 1996, Vol. 18, No. 10, 1024- 1028.

  2. K. M. Lam and H. Yan, "Locating and extracting the eye in human face images", Pattern Recognition, 1996, Vol. 29, No.5 771-779.

  3. D. Valentin, H. Abdi, A. J. O'Toole and G. W. Cottrell, "Connectionist models of face processing: A Survey," Pattern Recognition, 1994, Vol. 27, 1209-1230.

  4. A. L. Yuille, P. W. Hallinan and D. S. Cohen," Feature extraction from faces using deformable templates," Int. J. of Computer Vision, 1992, Vol. 8, No. 2, 99-111.

  5. M. Kirby and L. Sirovich," Application of the Karhunen- Loeve procedure for the characterization of human faces IEEE Trans. PAMI., 1990, Vol. 12, 103-108.M. Turk and A. Pentland," Eigenfaces for recognition,J. Cognitive Neuroscience, 1991, Vol. 3, 71-86.

  6. M. V. Wickerhauser, Large-rank "approximate component analysis with wavelets for signal feature discrimination and the inversion of complicated maps, J. Chemical Information and Computer Sciences, 1994, Vol. 34, No. 5, 1036-1046.

  7. L.Sirovich and M. Kirby, "Low-dimensional procedure for the characterization of human faces," J. Opt. Soc. Am. A, 1987, Vol. 4, No. 3, 519-524.

  8. D. L. Swets and J. J. Weng, "Using discriminant eigenfeatures for image retrieval," IEEE Trans.PAMI, 1996, Vol. 18, No. 8, 831- 836.

  9. A. J. O'Toole, H. Abdi, K. A. Deffenbacher and D. Valentin, "A low-dimensional representation of faces in the higher dimensions of the space, "J. Opt. Soc. Am., A, 1993, Vol. 10, 405-411.

  10. A. K. Jain," Fundamentals of digital image processing,"Prentice Hall, 1989, pp.163-175.

  11. A.I. Wasserman.Neural Computing: Theory and Practice " New York: Van Nostrand Reinhold,

[16] 1989.

  1. Golovko V., Gladyschuk V." Recirculation Neural Network Training for Image Processing,

  2. Advanced Computer Systems, 1999, P. 73-78.

  3. L. Harmon, "The recognition of faces," Scientific American, 1973, Vol. 229, 71-82.

  4. I. Daubechies, "Ten Lectures on Wavelets, CBMS-NSF series in Applied Mathematics," SIAM Press, Philadelphia, 1992, Vol. 61.

  5. I. Daubechies, "The wavelet transform, time-frequency localization and signal analysis," IEEE Trans.

  6. Information Theory, 1990, Vol. 36, No. 5, 961-1005.

  7. A. Pentland, B. Moghaddam and T. Starner," View- based and modular eigenspaces for face recognition," Proc. IEEE Conf. Computer vision and Pattern Recognition, 1994, Seattle, June, 84- 91.

  8. H. A. Rowley, S. Baluja and T. Kanade, "Neural network-based face detection," IEEE Transaction

[25] on PAMI, 1998, Vol. 20, No. 1,23-38.

  1. E.M.-Tzanakou, E. Uyeda, R. Ray, A Sharma, R. Ramanujan and J. Dong, "Comparison of neural network algorithm for face recognition," Simulation, 1995, 64, 1, 15- 27.

  2. D. Valenti, H. Abdi and A. J. O'Toole, "Principal component and neural network analyses of face images: Explorations into the nature of information available for classifying faces by sex,", Progress in mathematical psychology, 1996, Hillsdale: Erlbaum, in press.

  3. K.Fukunaga, "introduction to Statistical Pattern Recognition, Academic press. S.Z. Li and J. Lu, "Face Recognition Using the Nearest Feature Line Method, "IEEE Trans. Neural Networks, . 1999, vol. 10, no.2,pp .439-443, mar. Y. Meyer, "Wavelets: Algorithms and Applications," SIAM Press, 1993,

    Philadelphia. H. Szu, Y. Sheng and J. Chen, "Wavelet Transform as a Bank of Matched Filters," Applied Optics,June 1992, vol. 31 no. 17, p.p. 3267-3277.

  4. J.T. Chien, Discriminant Waveletfaces and Nearest Feature Classifiers for Face Recognition, PAMI.

[30] , 2002.

  1. Hybrid wavelet artificial neural network model for municipal water demand forecasting, Jowhar Rasheed H.M. Ibrahim,2012

  2. A new wavelet conjunction approach for estimation of relative humidity: wavelet principal component analysis combined with ANN,MaryamBayatvarkeshi, KouroshMohammadi, Ozgur Kisi &RojinFasihi, 2020

  3. Dimension Reduction of Machine Learning-Based Forecasting Models Employing Principal Component Analysis, YinghuiMeng, Sultan Noman Qasem, ManouchehrShokri and Shahab

    ,Mathematics,MDPI,Published: 27 July 2020

  4. Deep Neural Network for Human Face Recognition, Dr. PriyaGuptaa,NidhiSaxena,MeetikaSharma,JagritiTripathia, I.J. Engineering and Manufacturing, 2018,63-71,Published Online January 2018 in MECS, January 2018

  5. A comparative analysis of artificial neural networks and wavelet hybrid approaches to long-term toxicheavy metal prediction Peifeng Li, Pei Hua, DongweiGui, JieNiu, Peng Pei, Jin Zhang & Peter Krebs,Scientific Reports volume 10, Article number: 13439 (2020)

  6. A wavelet neural network approach to predict daily river discharge using meteorological data, ÖmerGürsoy,

    SerefNaciEnginFirst,SAGEJournals,April 25, 2019

  7. Graph Wavelet Neural Network,Bingbing Xu, Huawei Shen, Qi Cao, YunqiQiu, XueqiCheng,Cornell University Press,April 2019

  8. Deep Adaptive Wavelet Network,Maria Ximena Bastidas Rodriguez; Adrien Gruson; Luisa F. Polanía; Shin Fujieda; Flavio Prieto Ortiz; Kohei Takayama,2020 IEEE Winter Conference on Applications of Computer Vision (WACV),March 2020

Leave a Reply