Kernel method for improving image retrieval performance: a survey (Q532629)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Kernel method for improving image retrieval performance: a survey |
scientific article; zbMATH DE number 5884643
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Kernel method for improving image retrieval performance: a survey |
scientific article; zbMATH DE number 5884643 |
Statements
Kernel method for improving image retrieval performance: a survey (English)
0 references
5 May 2011
0 references
Summary: The subject of this paper is the kernel method, which offers an elegant solution to improve the effectiveness and the efficiency of the learning process in an image retrieval system. By simulating learning in high-dimensional feature spaces while working with the original low-dimensional input data, kernel methods provide a way for obtaining non-linear decision boundaries from algorithms previously restricted to handling only linearly separable image collections. The aim of this paper is to summarise results that have been obtained by using the kernel method in image retrieval systems. First, the paper introduces the kernel method together with some of its useful properties, and several kernel types used in fields like image retrieval, text mining, machine learning, and computational biology. Then, the paper focuses on applications and research questions involving the kernel method, such as kernel-based learning, kernel selection and feature selection methods.
0 references
kernel-based learning
0 references
content-based image retrieval
0 references
CBIR
0 references
kernel types
0 references
kernel selection
0 references
feature selection
0 references
0.7367814779281616
0 references
0.703084409236908
0 references
0.6944431662559509
0 references