NOHIS-Tree: High-Dimensional Index Structure for Similarity Search
Creators
Description
In Content-Based Image Retrieval systems it is important to use an efficient indexing technique in order to perform and accelerate the search in huge databases. The used indexing technique should also support the high dimensions of image features. In this paper we present the hierarchical index NOHIS-tree (Non Overlapping Hierarchical Index Structure) when we scale up to very large databases. We also present a study of the influence of clustering on search time. The performance test results show that NOHIS-tree performs better than SR-tree. Tests also show that NOHIS-tree keeps its performances in high dimensional spaces. We include the performance test that try to determine the number of clusters in NOHIS-tree to have the best search time.
Files
15779.pdf
Files
(343.7 kB)
Name | Size | Download all |
---|---|---|
md5:807893de6d6d0be3f0aa69dd2d8e4919
|
343.7 kB | Preview Download |