For databases of facial images, where each subject is depicted in only one or a few images, the query precision of interactive retrieval suffers from the problem of extremely small class sizes. A potential way to address this problem is to employ automatic even though imperfect classification on the images according to some high level concepts. In this paper we point out that significant improvement in terms of the occurrence of the first subject hit is feasible only when the classifiers are of sufficient accuracy. In this work Support Vector Machines (SVMs) are incorporated in order to obtain high accuracy for classifying the imbalanced data. We also propose an automatic method to choose the penalty factor of training error and the width parameter of the radial basis function used in training the SVM classifiers. More significant improvement in the speed of retrieval is feasible with small classes than with larger ones. The results of our experiments suggest that the first subject hit can be obtained two to five times faster for semantic classes such as "black persons" or "eyeglass-wearing persons". © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Yang, Z., & Laaksonen, J. (2005). Approximated classification in interactive facial image retrieval. In Lecture Notes in Computer Science (Vol. 3540, pp. 770–779). Springer Verlag. https://doi.org/10.1007/11499145_78
Mendeley helps you to discover research relevant for your work.