Fast Classification in Incrementally Growing Spaces
- Cite this paper as:
- Déniz-Suárez O., Castrillón M., Lorenzo J., Bueno G., Hernández M. (2011) Fast Classification in Incrementally Growing Spaces. In: Vitrià J., Sanches J.M., Hernández M. (eds) Pattern Recognition and Image Analysis. IbPRIA 2011. Lecture Notes in Computer Science, vol 6669. Springer, Berlin, Heidelberg
The classification speed of state-of-the-art classifiers such as SVM is an important aspect to be considered for emerging applications and domains such as data mining and human-computer interaction. Usually, a test-time speed increase in SVMs is achieved by somehow reducing the number of support vectors, which allows a faster evaluation of the decision function. In this paper a novel approach is described for fast classification in a PCA+SVM scenario. In the proposed approach, classification of an unseen sample is performed incrementally in increasingly larger feature spaces. As soon as the classification confidence is above a threshold the process stops and the class label is retrieved. Easy samples will thus be classified using less features, thus producing a faster decision. Experiments in a gender recognition problem show that the method is by itself able to give good speed-error tradeoffs, and that it can also be used in conjunction with other SV-reduction algorithms to produce tradeoffs that are better than with either approach alone.
Keywordsgender recognition Support Vector Machines Principal Component Analysis Eigenfaces
Unable to display preview. Download preview PDF.