Embedding of the extended euclidean distance into pattern recognition with higher-order singular value decomposition of prototype tensors

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The paper presents architecture and properties of the ensemble of the classifiers operating in the tensor orthogonal spaces obtained with the Higher-Order Singular Value Decomposition of prototype tensors. In this paper two modifications to this architecture are proposed. The first one consists in embedding of the Extended Euclidean Distance metric which accounts for the spatial relationship of pixels in the input images and allows robustness to small geometrical perturbations of the patterns. The second improvement consists in application of the weighted majority voting for combination of the responses of the classifiers in the ensemble. The experimental results show that the proposed improvements increase overall accuracy of the ensemble. © 2012 IFIP International Federation for Information Processing.

Cite

CITATION STYLE

APA

Cyganek, B. (2012). Embedding of the extended euclidean distance into pattern recognition with higher-order singular value decomposition of prototype tensors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7564 LNCS, pp. 180–190). Springer Verlag. https://doi.org/10.1007/978-3-642-33260-9_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free