Kernel based approach for high dimensional heterogeneous image features management in CBIR context

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

Abstract

In this paper we address a challenge of the problem of the dimensionality curse and the semantic gap reduction for content based image retrieval in large and heterogeneous databases. The strength of our idea resides in building an effective multidimensional indexing method based on kernel principal component analysis (KPCA) which supports efficiently similarity search of the heterogeneous vectors (color, texture, shape) and maps data vectors on a low feature space that is partitioned into regions. An efficient approach to approximate feature space regions is proposed with the corresponding upper and lower distance bounds. Finally, relevance feedback mechanism is exploited to create a flexible retrieval metric in order to reduce the semantic gap between the user need and the data representation. Experimental evaluations show that the use of region approximation approach with relevance feedback can significantly improve both the quality and the CPU time of the results. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Daoudi, I., Idrissi, K., & Ouatik, S. E. (2008). Kernel based approach for high dimensional heterogeneous image features management in CBIR context. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5259 LNCS, pp. 860–871). Springer Verlag. https://doi.org/10.1007/978-3-540-88458-3_78

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