Feature generation by simple FLD

Minora Fukumi, Yasue Mitsukura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper presents a new algorithm for feature generation, which is approximately derived based on geometrical interpretation of the Fisher linear discriminant analysis. In a field of pattern recognition or signal processing, the principal component analysis (PCA) is often used for data compression and feature extraction. Furthermore, iterative learning algorithms for obtaining eigen-vectors have been presented in pattern recognition and image analysis. Their effectiveness has been demonstrated on computational time and pattern recognition accuracy in many applications. However, recently the Fisher linear discriminant (FLD) analysis has been used in such a field, especially face image analysis. The drawback of FLD is a long computational time in compression of large-sized between-class and within-class covariance matrices. Usually FLD has to carry out minimization of a within-class variance. However in this case the inverse matrix of the within-class covariance matrix cannot be obtained, since data dimension is higher than the number of data and then it includes many zero eigenvalues. In order to overcome this difficulty, a new iterative feature generation method, a simple FLD is introduced and its effectiveness is demonstrated.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages643-649
Number of pages7
Volume3681 LNAI
Publication statusPublished - 2005
Externally publishedYes
Event9th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2005 - Melbourne, Australia
Duration: 2005 Sep 142005 Sep 16

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3681 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other9th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2005
CountryAustralia
CityMelbourne
Period05/9/1405/9/16

Fingerprint

Discriminant
Pattern recognition
Discriminant Analysis
Discriminant analysis
Covariance matrix
Image analysis
Pattern Recognition
Data Compression
Image Analysis
Data compression
Principal Component Analysis
Principal component analysis
Learning algorithms
Feature extraction
Signal processing
Learning
Inverse matrix
Iterative Algorithm
Feature Extraction
Signal Processing

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Fukumi, M., & Mitsukura, Y. (2005). Feature generation by simple FLD. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3681 LNAI, pp. 643-649). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3681 LNAI).

Feature generation by simple FLD. / Fukumi, Minora; Mitsukura, Yasue.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3681 LNAI 2005. p. 643-649 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3681 LNAI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fukumi, M & Mitsukura, Y 2005, Feature generation by simple FLD. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 3681 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3681 LNAI, pp. 643-649, 9th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2005, Melbourne, Australia, 05/9/14.
Fukumi M, Mitsukura Y. Feature generation by simple FLD. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3681 LNAI. 2005. p. 643-649. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Fukumi, Minora ; Mitsukura, Yasue. / Feature generation by simple FLD. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3681 LNAI 2005. pp. 643-649 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{b5d5c06621454410934c416b22ce8afa,
title = "Feature generation by simple FLD",
abstract = "This paper presents a new algorithm for feature generation, which is approximately derived based on geometrical interpretation of the Fisher linear discriminant analysis. In a field of pattern recognition or signal processing, the principal component analysis (PCA) is often used for data compression and feature extraction. Furthermore, iterative learning algorithms for obtaining eigen-vectors have been presented in pattern recognition and image analysis. Their effectiveness has been demonstrated on computational time and pattern recognition accuracy in many applications. However, recently the Fisher linear discriminant (FLD) analysis has been used in such a field, especially face image analysis. The drawback of FLD is a long computational time in compression of large-sized between-class and within-class covariance matrices. Usually FLD has to carry out minimization of a within-class variance. However in this case the inverse matrix of the within-class covariance matrix cannot be obtained, since data dimension is higher than the number of data and then it includes many zero eigenvalues. In order to overcome this difficulty, a new iterative feature generation method, a simple FLD is introduced and its effectiveness is demonstrated.",
author = "Minora Fukumi and Yasue Mitsukura",
year = "2005",
language = "English",
isbn = "3540288945",
volume = "3681 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "643--649",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Feature generation by simple FLD

AU - Fukumi, Minora

AU - Mitsukura, Yasue

PY - 2005

Y1 - 2005

N2 - This paper presents a new algorithm for feature generation, which is approximately derived based on geometrical interpretation of the Fisher linear discriminant analysis. In a field of pattern recognition or signal processing, the principal component analysis (PCA) is often used for data compression and feature extraction. Furthermore, iterative learning algorithms for obtaining eigen-vectors have been presented in pattern recognition and image analysis. Their effectiveness has been demonstrated on computational time and pattern recognition accuracy in many applications. However, recently the Fisher linear discriminant (FLD) analysis has been used in such a field, especially face image analysis. The drawback of FLD is a long computational time in compression of large-sized between-class and within-class covariance matrices. Usually FLD has to carry out minimization of a within-class variance. However in this case the inverse matrix of the within-class covariance matrix cannot be obtained, since data dimension is higher than the number of data and then it includes many zero eigenvalues. In order to overcome this difficulty, a new iterative feature generation method, a simple FLD is introduced and its effectiveness is demonstrated.

AB - This paper presents a new algorithm for feature generation, which is approximately derived based on geometrical interpretation of the Fisher linear discriminant analysis. In a field of pattern recognition or signal processing, the principal component analysis (PCA) is often used for data compression and feature extraction. Furthermore, iterative learning algorithms for obtaining eigen-vectors have been presented in pattern recognition and image analysis. Their effectiveness has been demonstrated on computational time and pattern recognition accuracy in many applications. However, recently the Fisher linear discriminant (FLD) analysis has been used in such a field, especially face image analysis. The drawback of FLD is a long computational time in compression of large-sized between-class and within-class covariance matrices. Usually FLD has to carry out minimization of a within-class variance. However in this case the inverse matrix of the within-class covariance matrix cannot be obtained, since data dimension is higher than the number of data and then it includes many zero eigenvalues. In order to overcome this difficulty, a new iterative feature generation method, a simple FLD is introduced and its effectiveness is demonstrated.

UR - http://www.scopus.com/inward/record.url?scp=33745315650&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745315650&partnerID=8YFLogxK

M3 - Conference contribution

SN - 3540288945

SN - 9783540288947

VL - 3681 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 643

EP - 649

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -