Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Opto-Electronic Engineering》 2010-09
Add to Favorite Get Latest Update

Linear Extension of Graph Embedding Based on QR Decomposition and Face Recognition

LU Gui-fu1,2,WANG Yong2,JIN Zhong1(1.School of Computer Science and Technology,Nanjing University of Science and Technology,Nanjing 210094,China;2.School of Computer Science and Information,Anhui Polytechnic University,Wuhu 241000,Anhui Province,China)  
In order to address small sample size(3S) problem,a new algorithm for implementing linear extension of graph embedding(LGE) based on QR decomposition is proposed,which could be used in face recognition.Different from the traditional approach of dimension reduction by Principle Component Analysis(PCA),the new algorithm applies QR decomposition to implement dimension reduction.Then the LGE is followed and employed for the second feature extraction in the transformed space.Finally,the nearest neighbor classifier is used for classification and recognition.The new algorithm not only can effectively solve 3S problem,but also hold the discriminant information.Experimental results on YALE and PIE face databases show that the algorithm outperforms the traditional method in recognition rates.
【Fund】: 国家自然科学基金(60873151);; 国家863计划项目(2006AA01Z119);; 江苏省2010年度普通高校研究生科研创新计划项目(178)
【CateGory Index】: TP391.41
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved