This paper presents an empirical evaluation on a dissimilarity measure strategy by which dissimilarity-based classifications (DBCs) [10] can be efficiently implemented. In DBCs, classifiers are not based on the feature measurements of individual objects, but rather on a suitable dissimilarity measure among the objects. In image classification tasks, however, one of the most intractable problems to measure the dissimilarity is the distortion and lack of information caused by the differences in illumination and directions and outlier data. To overcome this problem, in this paper, we study a new way of performing DBCs in eigenspaces spanned, one for each class, by the subset of principal eigenvectors, extracted from the training data set through a principal component analysis. Our experimental results, obtained with well-known benchmark databases, demonstrate that when the dimensionality of the eigenspaces has been appropriately chosen, the DBCs can be improved in terms of classification accuracies. © 2011 Springer-Verlag.
CITATION STYLE
Kim, S. W., & Duin, R. P. W. (2011). Dissimilarity-based classifications in eigenspaces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7042 LNCS, pp. 425–432). https://doi.org/10.1007/978-3-642-25085-9_50
Mendeley helps you to discover research relevant for your work.