Orthogonalized Fisher discriminant
The Foley–Sammon discriminant (FSD) exhibits higher performance in face recognition than the Fisher linear discriminant due to its elimination of dependences among discriminant vectors. But its theory is complex and the calculation is time expensive. The orthogonalized Fisher discriminant (OFD), whi...
Saved in:
Published in | Pattern recognition Vol. 38; no. 2; pp. 311 - 313 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier Ltd
01.02.2005
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The Foley–Sammon discriminant (FSD) exhibits higher performance in face recognition than the Fisher linear discriminant due to its elimination of dependences among discriminant vectors. But its theory is complex and the calculation is time expensive. The orthogonalized Fisher discriminant (OFD), which also derives a set of orthogonal discriminant vectors, is very simple and easy to implement. Experiments show that OFD is more effective and efficient than FSD in pattern recognition. |
---|---|
ISSN: | 0031-3203 1873-5142 |
DOI: | 10.1016/j.patcog.2004.06.007 |