Face recognition using integrated discrete cosine transform and kernel fisher discriminant analysis
In face recognition applications, the dimension of the sample space is usually larger than the number of the samples in a training set. As a result, Fisher Linear Discriminant Analysis (FLD) based methods suffers due to singularity problem (of scatter matrix). This situation is often referred as &qu...
保存先:
| 主要な著者: | , , |
|---|---|
| その他の著者: | |
| フォーマット: | Conference paper |
| 出版事項: |
2023
|
| 主題: | |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
| 要約: | In face recognition applications, the dimension of the sample space is usually larger than the number of the samples in a training set. As a result, Fisher Linear Discriminant Analysis (FLD) based methods suffers due to singularity problem (of scatter matrix). This situation is often referred as "small sample size" (SSS) problem. Moreover, FLD is a linear algorithm by nature. Hence, it fails to extract important information from nonlinear and complex data such as face image. To remedy this problem, this paper presents a new face recognition approach by integrating Discrete Cosine Transform (DCT) and Kernel Fisher Discriminant Analysis (KFDA). The DCT has the capability to compact the energy in an image and let the dimensionality of the input sample space to be reduced. Then, KFDA, a new variant of FLD, will be used to extract the most discriminating feature. This is performed by transforming the reduced DCT subset using a nonlinear kernel function to a high dimensional nonlinear feature space and then followed by the FLD step. Based on the extensive experiments performed on ORL Database, the highest recognition accuracy of 95.375% is achieved with only 24 features. �2006 IEEE. |
|---|