Introduction to statistical pattern recognition (2nd ed.)
Introduction to statistical pattern recognition (2nd ed.)
Robust analysis of feature spaces: color image segmentation
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Machine Printed Text and Handwriting Identification in Noisy Document Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Signal Processing
The l1 solution of linear inequalities
Computational Statistics & Data Analysis
Robust Speaker Recognition in Noisy Conditions
IEEE Transactions on Audio, Speech, and Language Processing
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
In this paper we present a robust polynomial classifier based on L 1-norm minimization. We do so by reformulating the classifier training process as a linear programming problem. Due to the inherent insensitivity of the L 1-norm to influential observations, class models obtained via L 1-norm minimization are much more robust than their counterparts obtained by the classical least squares minimization (L 2-norm). For validation purposes, we apply this method to two recognition problems: character recognition and sign language recognition. Both are examined under different signal to noise ratio (SNR) values of the test data. Results show that L 1-norm minimization provides superior recognition rates over L 2-norm minimization when the training data contains influential observations especially if the test dataset is noisy.