Please use this identifier to cite or link to this item:
|Title:||When fisher meets Fukunaga-Koontz: A new look at linear discriminants|
|Source:||Sheng, Z.,Sim, T. (2006). When fisher meets Fukunaga-Koontz: A new look at linear discriminants. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition 1 : 323-329. ScholarBank@NUS Repository. https://doi.org/10.1109/CVPR.2006.334|
|Abstract:||The Fisher Linear Discriminant (FLD) is commonly used in pattern recognition. It finds a linear subspace that maximally separates class patterns according to Fisher's Criterion. Several methods of computing the FLD have been proposed in the literature, most of which require the calculation of the so-called scatter matrices. In this paper, we bring a fresh perspective to FLD via the Fukunaga-Koontz Transform (FKT). We do this by decomposing the whole data space into four subspaces, and show where Fisher's Criterion is maximally satisfied. We prove the relationship between FLD and FKT analytically, and propose a method of computing the most discriminative subspace. This method is based on the QR decomposition, which works even when the scatter matrices are singular, or too large to be formed. Our method is general and may be applied to different pattern recognition problems. We validate our method by experimenting on synthetic and real data. © 2006 IEEE.|
|Source Title:||Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.