Is Similarity Search useful for High Dimensional Spaces?
|
Abstract:
In recent years, multimedia content-based retrieval has become an important research problem. In order to provide effective and also efficient access to relevant data stored in large (often distributed) digital repositories, advanced software tools are necessary. Content-based retrieval works on the idea of abstracting the contents of an object, for example color or shape in the case of images, by so-called features-- features are typically points in a high-dimensional vector space. Instead of determining the similarity of two objects based on their raw data, only the much smaller feature representations are used to estimate the objects ' similarity. Given a reference (query) object represented by its features, similarity predicates are defined to retrieve a specific number of best cases or all objects
Citations
| 1651 | R-trees: A dynamic index structure for spatial searching – Guttman - 1984 |
| 416 | ªThe X-Tree: An Index Structure for High-Dimensional Data,º – Berchtold, Keim, et al. - 1996 |
| 334 | M-tree: An efficient access method for similarity search in metric spaces – Ciaccia, Patella, et al. - 1997 |
| 316 | A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces – Weber, Schek, et al. - 1998 |
| 296 | The SR-Tree: An Index Structure for High Dimensional Nearest Neighbor Queries – Katayama, Satoh - 1997 |
| 154 | The TVtree: An Index Structure for High Dimensional Data – Lin, Jagadish, et al. - 1992 |
| 96 | Searching Multimedia Databases by Content – Faloutsos - 1996 |
| 5 | When is "nearest neighbour" meaningful – Beyer, Goldstein, et al. - 1999 |
