“…Thus, it provides slightly less accurate results, but offers in return a sharp reduction in computation time. We find in this family methods such VA-File [8] and its variants [24], [30], the LSH methods [15], [17] and its variants [9], [13], [14], [25], BitMatrix [10], KRA +-Block [11], multi-dimensional inverted index [22], etc. Unluckily, most of indexing and search structures available today have several limitations including scalability:1) a relatively large computation time 2) limiting memory 3) degradation of research quality.…”
This paper presents a comparative experimental study of the multidimensional indexing methods based on the approximation approach. We are particularly interested in the LSH family, which provides efficient index structures and solves the dimensionality curse problem. The goal is to understand the performance gain and the behavior of this family of methods on large-scale databases. E2LSH is compared to the KRA+-Blocks and the sequential scan methods. Two criteria are used in evaluating the E2LSH performances, namely average precision and CPU time using a database of one million image descriptors.
Keywords-Content based image retrieval (CBIR), Curse of dimensionality, Locality sensitive hashing, Multidimensional indexing, Scalability.I.
“…Thus, it provides slightly less accurate results, but offers in return a sharp reduction in computation time. We find in this family methods such VA-File [8] and its variants [24], [30], the LSH methods [15], [17] and its variants [9], [13], [14], [25], BitMatrix [10], KRA +-Block [11], multi-dimensional inverted index [22], etc. Unluckily, most of indexing and search structures available today have several limitations including scalability:1) a relatively large computation time 2) limiting memory 3) degradation of research quality.…”
This paper presents a comparative experimental study of the multidimensional indexing methods based on the approximation approach. We are particularly interested in the LSH family, which provides efficient index structures and solves the dimensionality curse problem. The goal is to understand the performance gain and the behavior of this family of methods on large-scale databases. E2LSH is compared to the KRA+-Blocks and the sequential scan methods. Two criteria are used in evaluating the E2LSH performances, namely average precision and CPU time using a database of one million image descriptors.
Keywords-Content based image retrieval (CBIR), Curse of dimensionality, Locality sensitive hashing, Multidimensional indexing, Scalability.I.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.