Buoy Indexing of Metric Feature Spaces for Fast Approximate Image Queries
暂无分享,去创建一个
[1] Christos Faloutsos,et al. FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets , 1995, SIGMOD '95.
[2] Pavel Zezula,et al. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.
[3] Marco Patella,et al. Using the distance distribution for approximate similarity queries in high-dimensional metric spaces , 1999, Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99.
[4] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[5] Raymond T. Ng,et al. Evaluating multidimensional indexing structures for images transformed by principal component analysis , 1996, Electronic Imaging.
[6] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[7] Vladimir Pestov,et al. On the geometry of similarity search: Dimensionality curse and concentration of measure , 1999, Inf. Process. Lett..
[8] Christos Faloutsos,et al. The A dynamic index for multidimensional ob-jects , 1987, Very Large Data Bases Conference.
[9] Ramin Zabih,et al. Comparing images using joint histograms , 1999, Multimedia Systems.
[10] Stephan Volmer,et al. Color co-occurrence descriptors for querying-by-example , 1998, Proceedings 1998 MultiMedia Modeling. MMM'98 (Cat. No.98EX200).
[11] Stephan Volmer. Tracing Images in Large Databases by Comparison of Wavelet Fingerprints , 1997 .
[12] Peter G. B. Enser. Pictorial information retrieval , 1995 .
[13] Ramesh C. Jain,et al. Similarity indexing: algorithms and performance , 1996, Electronic Imaging.
[14] Sunil Arya,et al. An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.