.png){kind=icon}
.png){kind=icon}
Return
An efficient high-dimensional indexing method for content-based retrieval in large image databases
.png){kind=icon}
PRE
AI
DOI：10.1016/j.image.2009.09.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
High-dimensional indexing methods have been proved quite useful for response time improvement. Based on Euclidian distance, many of them have been proposed for applications where data vectors are high-dimensional. However, these methods do not generally support efficiently similarity search when dealing with heterogeneous data vectors. In this paper, we propose a high-dimensional indexing method (KRA(+)-Blocks) as an extension of the region approximation approach to the kernel space. KRA(+)-Blocks combines nonlinear dimensionality reduction technique (KPCA) with region approximation approach to map data vectors into a reduced feature space. The created feature space is then used, on one hand to approximate regions, and on the other hand to provide an effective kernel distances for both filtering process and similarity measurement. In this way, the proposed approach achieves high performances in response time and in precision when dealing with high-dimensional and heterogeneous vectors. (C) 2009 Elsevier B.V. All rights reserved.
Keywords:
CBIR
High-dimensional vector space
Region approximation approach
Kernel
Image databases
Relevance feedback
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
S
IF:
2.7
Papers:
2.8K
Citations:
4.2K
View more organizations