Image kernels

31Citations
Citations of this article
38Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we discuss the mathematical properties of a few kernels specifically constructed for dealing with image data in binary classification and novelty detection problems. First, we show that histogram intersection is a Mercer’s kernel. Then, we show that a similarity measure based on the notion of Hausdorff distance and directly applicable to raw images, though not a Mercer’s kernel, is a kernel for novelty detection. Both kernels appear to be well suited for building effective vision-based learning systems.

Cite

CITATION STYLE

APA

Barla, A., Franceschi, E., Odone, F., & Verri, A. (2002). Image kernels. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2388, pp. 83–96). Springer Verlag. https://doi.org/10.1007/3-540-45665-1_7

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