Classification and Feature Extraction by Simplexization

Authors:
Yun Fu;Shuicheng Yan;T. S. Huang
Affiliations:
Univ. of Illinois at Urbana-Champaign, Urbana;-;-
Venue:
IEEE Transactions on Information Forensics and Security
Year:
2008

Citing 0
Cited 7

Binary sparse nonnegative matrix factorization

IEEE Transactions on Circuits and Systems for Video Technology
Fast Haar transform based feature extraction for face representation and recognition

IEEE Transactions on Information Forensics and Security
Iterative subspace analysis based on feature line distance

IEEE Transactions on Image Processing
A doubly weighted approach for appearance-based subspace learning methods

IEEE Transactions on Information Forensics and Security
Distance metric learning for content identification

IEEE Transactions on Information Forensics and Security
Fisher Difference Discriminant Analysis: Determining the Effective Discriminant Subspace Dimensions for Face Recognition

Neural Processing Letters
Image classification based on effective extreme learning machine

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

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 -nearest-neighbor simplex (), which is constructed by the 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 distances. Comprehensive experiments on face recognition and lipreading validate the effectiveness of the DSA as well as the -based classification approach.