Novel elastic graph matching-based face authentication with optimal class separability

Yanchao Xing, Zheng Tan, Kin Man Lam

Research output: Journal article publicationJournal articleAcademic researchpeer-review


In order to resolve the problem in traditional elastic graph matching that the cost function cannot effectively reflect the facial shape difference, and the weights for cost components cannot be determined automatically, a novel face authentication algorithm with support vector machine-based elastic graph matching is presented. This algorithm first introduces facial geometric feature similarity cost in the cost function, which enhances its discriminant power on shape difference. Then it takes all cost components as a similarity vector and trains the support vector machine with training samples. Finally it generates the new cost function through the classifier's discriminant. The new cost function reflects the relative importance of each cost component, and has optimal class separability. Experiments show that this algorithm gets 6.6% improvement in face authentication rate, and 1.5 pixel of decrease in dynamic matching error.
Original languageEnglish
Pages (from-to)565-568
Number of pages4
JournalHsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University
Issue number6
Publication statusPublished - 1 Jun 2003


  • Elastic graph matching
  • Extended rectangular grid
  • Face authentication
  • Support vector machine

ASJC Scopus subject areas

  • General Engineering


Dive into the research topics of 'Novel elastic graph matching-based face authentication with optimal class separability'. Together they form a unique fingerprint.

Cite this