ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Clustering for Approximate Similarity Search in High-Dimensional Spaces
IEEE Transactions on Knowledge and Data Engineering
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
IEEE Transactions on Knowledge and Data Engineering
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search
ACM Transactions on Database Systems (TODS)
CLUE: cluster-based retrieval of images by unsupervised learning
IEEE Transactions on Image Processing
Hi-index | 0.00 |
Retrieval of images based on the content is a process that requires the comparison of the multidimensional representation of the contents of a given example with all of those images in the database. To speed up this process, several indexing techniques have been proposed. All of them do efficiently the work up to 30 dimensions [8]. Above that, their performance is affected by the properties of the multidimensional space. Facing this problem, one alternative is to reduce the dimensions of the image representation which however conveys an additional loss of precision. Another approach that has been studied and seems to exhibit good performance is the clustering of the database. On this article we analyze this option from a computational complexity approach and devise a proposal for the number of clusters to obtain from the database, which can lead to sublinear algorithms.