Please use this identifier to cite or link to this item:
|Title:||Classification and feature extraction by simplexization||Authors:||Fu, Y.
|Keywords:||Discriminant simplex analysis (DSA)
K-nearest-neighbor simplex (kNNS)
Nearest feature line classifier
|Issue Date:||Mar-2008||Citation:||Fu, Y., Yan, S., Huang, T.S. (2008-03). Classification and feature extraction by simplexization. IEEE Transactions on Information Forensics and Security 3 (1) : 91-100. ScholarBank@NUS Repository. https://doi.org/10.1109/TIFS.2007.916280||Abstract:||Techniques for classification and feature extraction are often intertwined. In this paper, we contribute to these two aspects via the shared philosophy of simplexizing the sample set. For general classification, we present a new criteria based on the concept of k-nearest-neighbor simplex (kNNS), which is constructed by the k nearest neighbors, to determine the class label of a new datum. For feature extraction, we develop a novel subspace learning algorithm, called discriminant simplex analysis (DSA), in which the intraclass compactness and interclass separability are both measured by kNNS distances. Comprehensive experiments on face recognition and lipreading validate the effectiveness of the DSA as well as the kNNS-based classification approach. © 2008 IEEE.||Source Title:||IEEE Transactions on Information Forensics and Security||URI:||http://scholarbank.nus.edu.sg/handle/10635/55299||ISSN:||15566013||DOI:||10.1109/TIFS.2007.916280|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 17, 2019
WEB OF SCIENCETM
checked on Nov 8, 2019
checked on Oct 28, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.