• 沒有找到結果。

A Study of Face Recognition based on Wavelet and LDA Algorithm 賴明志、黃登淵

N/A
N/A
Protected

Academic year: 2022

Share "A Study of Face Recognition based on Wavelet and LDA Algorithm 賴明志、黃登淵"

Copied!
3
0
0

加載中.... (立即查看全文)

全文

(1)

A Study of Face Recognition based on Wavelet and LDA Algorithm 賴明志、黃登淵

E-mail: [email protected]

ABSTRACT

Face recognition has been broadly applied in the areas such as biometric identity authentication, access surveillance and

human-computer interface. More recently, the technique of face recognition has been markedly extended to the applications of the optimality of human-computer interface due to the promotion of “intelligent life”. Additionally, video conference, image content indexing and medical diagnostics are also the most important applications of face recognition. One of the most important topics in face recognition is the extraction and selection of face features, which aims to greatly reduce the higher dimensionality of face space and further to lower the high complexity and heavy loading of the computation of scatter covariance matrices. Face recognition (FR) often encounters the so called “small sample size” (SSS) problem resulting from the small number of available training samples compared to the dimensionality of the sample space. Hence, both within-class scatter matrix SW and between-class scatter matrix SB become singular. It implies that the eigensystem computation can be unstable. This is why we would like to propose an algorithm based on wavelet transform and LDA to solve the difficulties concerning the SSS problem and high dimensionality in training samples. This research modifies Fisher’s criterion as |?仈SB?戉/|?仈(SW+?庹) ?戉, where ? is the set of generalized eigenvectors of and is usually chosen as a matrix with orthonormal column vectors which maximize the ratio of the determinant of the

between-class scatter matrix to that of the within-class scatter matrix. On the other hand, is a very small positive value (i.e., 10-3 in this research), which is added to the diagonal elements of SW to let SW+?庹 be a positive definite matrix. This can help us to solve the difficulties of unstable eigensystem computation. Here, we call this modified method as M-LDA (Modified-LDA). As to Fisher’s LDA, we call it as conventional LDA. Another popular method called D-LDA will also be compared. The Olivetti Research Lab (ORL) face database will be adopted in this research. When applying Haar wavelet and taking maximum available feature spaces, the average recognition rate of M-LDA is 91.5% compared to 87.5% of conventional LDA and 82.5% of D-LDA. However, when Daubechies 9/7 wavelet is used, the average recognition rate of M-LDA keeps the same, but conventional LDA and D-LDA slightly decrease to 86.8% and 82.3%, respectively. Especially, when training samples are deficient, e.g., only two training samples, the recognition rate of M-LDA can be still up to 83%, which is superior to 75% of conventional LDA and 61% of D-LDA, respectively.

The results also reveal the following two key points: (1) the null space of within-class scatter matrix SW is not useless. Instead, it provides the most significant discriminant information. (2) the recognition rate of D-LDA is far lower than that of M-LDA and conventional LDA especially under less feature spaces. It clearly illustrates that the null space of between-class scatter matrix SB contains the most important discriminative information. Finally, the effect of wavelet transformation on recognition rate is also examined. This research compares the recognition rate of D-LDA proposed here with literature [11] and [26]. We use wavelet to reduce the dimensionality of face spaces as a preprocessing, but literature [11] and [26] do not. The calculated results show that the algorithm of wavelet + M-LDA proposed in this research has a recognition rate of 91%, which is higher when compared to 82.9% of [11], but it is similar to 90.8% of [26]. This research proposes M-LDA algorithm. The results of recognition rate are well compared with that of conventional LDA and D-LDA. The result reveals that M-LDA has a better recognition rate especially under deficient training samples. Moreover, recognition rate can rise with an increase in the number of training samples or face classes. But on the other hand, it also strongly increases the training time of face database.

Keywords : Face Recognition ; Wavelet Transform ; Linear Discriminant Analysis Table of Contents

封面內頁 簽名頁 授權書.........................iii 中文摘要............

............iv 英文摘要........................vi 誌謝.........

.................ix 目錄..........................x 圖目錄...

......................xiii 表目錄.........................xv 第一章 緒論 1.1 前言....................1 1.2 文獻回顧.................

.1 1.3 研究動機..................2 1.4 本文架構..................3 第二章 人臉辨識相關技術 2.1 人臉辨識技術綜述...... ........5 2.1.1 基於幾何特徵的方法.........

.5 2.1.2 基於統計模型的方法......... .6 2.1.3 基於類神經的方法.......... .9 2.1.4 基於3D人

(2)

臉識別的方法....... .9 2.2 研究探討..................10 第三章 基於小波與線性鑑別式 的人臉辨識系統 3.1 前言....................11 3.2 小波轉換理論基礎...........

..12 3.3 線性鑑別式理論基礎.............16 3.3.1 線性鑑別式分析方法..........17 3.3.2 特?系統解決方法........21 3.3.3 傳統型線性鑑別式分析方法(LDA)....22 3.3.4 直接線性鑑別式分析方 法(D-LDA)....24 3.3.5 改良型線性鑑別式分析(M-LDA).....28 3.4 人臉特徵子空間性質..........

...30 3.5 人臉辨識分類器...............31 第四章 人臉辨識系統流程與實驗結果 4.1 前言....

................34 4.2 人臉辨識系統流程設計............35 4.3 發展環境.....

.............36 4.4 實驗結果..................37 4.4.1 訓練樣本數與特徵空間對人 臉辨識之影響比較..................38 4.4.2 訓練樣本數與訓練時間對之關係比較...53 4.4.3 實 驗結果討論.............54 第五章 結論與未來研究方向 5.1結論..................

. .56 5.2未來研究方向............... .57 參考文獻.....................

...59 附錄一 部分ORL人臉資料庫影像.............64 REFERENCES

[1] P. N. Belhumeur, J. P. Hespanha, and D. J. Kriegman, “Eigenfaces vs. Fisherfaces : Recognition using class specific linear projection,” IEEE Trans. Pattern Anal. Machine Intell., Vol. 19, pp. 711-720, 1997.

[2] M. Turk, and A. Pentland, “Eigenfaces for recognition,” Journal of Cognitive Neuroscience, Vol. 3, No. 1, pp. 71-86, 1991.

[3] C. Liu, and H. Wechsler, “Enhanced Fisher Linear Discriminant Models for Face Recognition,” Pattern Recognition, Vol. 2, pp. 1368-1372, 1998.

[4] Z. Kouzani, F. He, K. Sammut, and A. Bouzerdoum, “Illumination Invariant Face Recognition,” Proceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics, Vol. 5, pp. 4240-4245, 1998.

[5] R. Bruneli, and T. Poggio, “Face recognition : features versus templates,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 15, No. 10, pp. 1042-1052, 1993.

[6] D. L. Swets, and J. J. Weng, “Using Discriminant Eigenfeatures for Image Retrieval,” IEEE Trans. Pattern Analysis and Machine Intelligence, Vol. 18, No. 8, pp. 831-836, 1996.

[7] S. Z. Li, and J. Lu, “Face Recognition Using the Nearest Feature Line Method,” IEEE Transactions on Neural Networks, Vol. 10, No. 2, pp.

439-443, 1999.

[8] L. F. Chen, H. Y. Mark Liao, M. T. Ko, J. C. Lin, and G. J. Yu, “A new LDA-based face recognition system which can solve the small sample size problem,” Pattern recognition, Vol. 33, pp. 1713-1726, 2000.

[9] R. Lotlikar, and R. Kothari, “Fractional-step dimensionality reduction,” IEEE Transaction on Pattern Analysis and Machine Intelligence, Vol. 22, No. 6, pp. 623-627, 2000.

[10] A. M. Martnez, and A. C. Kak, “PCA versus LDA,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 23, No. 2, pp.

228-233, 2001.

[11] H. Yu, and J. Yang, “A direct LDA algorithm for high-dimensional data – with application to face recognition,” Pattern Recognition, Vol.

34, pp. 2067-2070, 2001.

[12] J. Wang, K. N. Plataniotis, and A. N. Venetsanopoulos, “Selecting discriminate eigenfaces for face recognition,” Pattern Recognition Letters, Vol. 26, pp. 1470-1482, 2005.

[13] J. Lu, K. N. Plataniotis, and A. N. Venetsanopoulos, “Face recognition using LDA-Based Algorithms,” IEEE Transactions on Neural Networks, Vol. 14, No. 1, pp. 195-200, 2003.

[14] M. S. Bartlett, H. M. Lades, and T. Sejnowshi, “Face Recognition by Independent Component Analysis,” IEEE Transaction on Neural Networks, Vol. 13, No. 6, pp. 1450-1464, 2002.

[15] W. S. Lee, H. J. Lee, and J. H. Chung, “Wavelet-based FLD for face recognition,” Proceedings of the 43rd IEEE Midwest Symposium on Circuits and Systems, Vol. 2, pp. 734-737, 2000.

[16] H. Chan, and W. W. Bledsoe,“A man-machine facial recognition system : some preliminary results Technical report,”Panoramic Research Inc., Cal, 1965.

[17] C. Wu, and J. Huang, “Human face profile recognition by computer,”Pattern Recognition, Vol. 23, pp. 255-259, 1990.

[18] B. Moghaddam, C. Nastar and A. Pentland, “A Bayesian Similarity Measure for Direct Image Matching,”International Conference on Pattern Recognition, Vienna, Austria, 1996.

[19] D. Valentin, H. Abdi, A. J. O’Toole, and Garrison W. Cottrell, “Connectionist Models of Face Processing : A survey,”Pattern Recognition. Vol. 27, pp. 1209-1230, 1994.

[20] R. Brunelli, and T. Poggio,“HyperBF networks for gender classification,”in Pro. DARPA Image Understanding Workshop, pp. 311-314, 1992.

(3)

[21] 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,”Journal of the Optical Society of America A., Vol. 10, No. 3, pp. 405-410, 1993.

[22] J. Huang, B. Heisele, and V. Blanz,“Component-based Face Recognition with 3D Morphable Models,”Proc. of the 4th International Conference on Audio- and Video-Based Biometric Person Authentication, AVBPA 2003, Guildford, UK, pp. 27-34, 2003.

[23] W. Zhao, R. Chellappa, and P. J. Phillips,“Subspace Linear Discriminant Analysis for Face Recognition,”Center for Automation Research, University of Maryland, College Park, Technical Report CAR-TR-914, 1999.

[24] M. J. Er, J. Wu, J. Lu, and H. L. Toh, “Face recognition with radial basis function (RBF) neural networks,” IEEE Transactions on Neural Networks, Vol. 13, No. 3, pp. 697-710, 2002.

[25] C. J. C. Burges,“A tutorial on support vector machines for pattern recognition,”Data Min. Knowl. Disc, Vol. 2, No. 2, pp. 121-167, 1998.

[26] X. J. Wu, J. Kittler, J. Y. Yang, K. Messer, and S. Wang,“A new direct LDA(D-LDA) algorithm for feature extraction in face recognition,

”Pattern recognition, ICPR 2004. Proceedings of the 17th International Conference, Vol. 4, pp. 545-548, 2004.

[27] H. Gao, and J. W. Davis, “Why direct LDA is not equivalent to LDA,” Pattern Recognition, Vol. 39, pp. 1002-1006, 2006.

[28] 吳佳珍,“以鑑別性小波參數為主之人臉辨識系統”,國立成功大學資訊工程系碩士論文,民90。

[29] 林咸仁,“改良線性鑑別式分析在少量訓練樣本下之人臉辨識研究”,國立成功大學資訊工程系碩士論文,民91。

[30] 洪倩玉,“建立動態線性鑑別式分析於線上人臉辨識與驗證”,國立成功大學資訊工程系碩士論文,民92。

[31] 繆紹剛譯,“數位影像處理 第二版”,普林斯頓,民92。

[32] ORL人臉資料庫查詢網址: http://www.cl.cam.ac.uk/Research/DTG/attarchive/facedatabase.html

參考文獻

相關文件

Define instead the imaginary.. potential, magnetic field, lattice…) Dirac-BdG Hamiltonian:. with small, and matrix

(2007) demonstrated that the minimum β-aberration design tends to be Q B -optimal if there is more weight on linear effects and the prior information leads to a model of small size;

Microphone and 600 ohm line conduits shall be mechanically and electrically connected to receptacle boxes and electrically grounded to the audio system ground point.. Lines in

• To achieve small expected risk, that is good generalization performance ⇒ both the empirical risk and the ratio between VC dimension and the number of data points have to be small..

The min-max and the max-min k-split problem are defined similarly except that the objectives are to minimize the maximum subgraph, and to maximize the minimum subgraph respectively..

• Given a finite sample of some texture, the goal is to synthesize other samples from that same is to synthesize other samples from that same texture...

• Any node that does not have a local replica of the object periodically creates a QoS-advert message contains (a) its δ i deadline value and (b) depending-on , the ID of the node

Experiment a little with the Hello program. It will say that it has no clue what you mean by ouch. The exact wording of the error message is dependent on the compiler, but it might