Approximate searches: K-neighbors + precision

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2003, Pages 24-31

  Berrani, Sid Ahmed ^a   Amsaleg, Laurent ^a   Gros, Patrick ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

Approximate Nearest neighbor Searches; Multimedia Batabases; Similarity Searches

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATABASE SYSTEMS; FEEDBACK; IMAGE PROCESSING; MULTIMEDIA SYSTEMS; ONLINE SEARCHING; PROBABILITY; VECTORS;

APPROXIMATE NEAREST-NEIGHBOR SEARCHES; MULTIMEDIA DATABASE; NEAREST NEIGHBORS (NN); SIMILARITY SEARCHES;

CONTENT BASED RETRIEVAL;

EID: 18744367262     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/956869.956870     Document Type: Conference Paper

References (21)

1. L. Amsaleg and P. Gros. Content-based retrieval using local descriptors: Problems and issues from a database perspective. Pattern Analysis and Applications, Special Issue on Image Indexation, 4:108-124, 2001.
2. L. Amsaleg, P. Gros, and S.-A. Berrani. A robust technique to recognize objects in images, and the db problems it raises. In Proceedings of the 7th International Workshop on Multimedia Information Systems, Capri, Italy, November 2001.
3. L. Amsaleg, P. Gros, and S.-A. Berrani. Robust object recognition in images and the related database problems. Special issue of the Journal of Multimedia Tools and Applications, 2003 (To appear).
4. K. P. Bennett, U. Fayyad, and D. Geiger. Density-based indexing for approximate nearest-neighbor queries. In Proceedings of the 5th ACM International Conference on Knowledge Discovery and Data Mining, San Diego, California, USA, pages 233-243, August 1999.
5. K. S. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is "nearest neighbor" meaningful? In Proceedings of the 7th International Conference on Database Theory, Jerusalem, Israel, pages 217-235. Springer, January 1999.
6. C. Böhm, S. Berchtold, and D. A. Keim. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys, 33(3):322-373, September 2001.
7. G. Brown. Modern Mathematics for the Engineer. 1956.
8. P. Ciaccia and M. Patella. Pac nearest neighbor queries: Approximate and controlled search in high-dimensional and metric spaces. In Proceedings of the 16th International Conference on Data Engineering, San Diego, California, USA, pages 244-255, February 2000.
9. C. Faloutsos. Searching Multimedia Databases by Content. Kluwer Academic Publishers, 1996.
10. H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. El Abbadi. Approximate nearest neighbor searching in multimedia databases. In Proceedings of the 17th International Conference on Data Engineering, Heidelberg, Germany, pages 503-511, April 2001.
11. L. Florack, B. ter Haar Romeny, J. Koenderink, and M. Viergever. General intensity transformation and differential invariants. Journal of Mathematical Imaging and Vision, 4(2):171-187, 1994.
12. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In Proceedings of the 25th International Conference on Very Large Data Bases, Edinburgh, Scotland, UK, pages 518-529, September 1999.
13. J. Goldstein and R. Ramakrishnan. Contrast plots and p-sphere trees: Space vs. time in nearest neighbor searches. In Proceedings of the 26th International Conference on Very Large Data Bases, Cairo, Egypt, pages 429-440, September 2000.
14. D. Knuth. Art of Computer Programming, Volume 2: Seminumerical Algorithms, pages 135-136. 1997.
15. C. Li, E. Chang, H. Garcia-Molina, and G. Wiederhold. Clustering for approximate similarity search in high-dimensional spaces. IEEE Transactions on Knowledge and Data Engineering, 14(4):792-808, July 2002.
16. B.-U. Pagel, F. Korn, and C. Faloutsos. Deflating the dimensionality curse using multiple fractal dimensions. In Proceedings of the 16th International Conference on Data Engineering, San Diego, California, USA, pages 589-598, March 2000.
17. C. Schmid and R. Mohr. Local grayvalue invariants for image retrieval. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(5):530-534, May 1997.
18. R. Weber and K. Böhm. Trading quality for time with nearest neighbor search. In Proceedings of the 7th Conference on Extending Database Technology, Konstanz, Germany, pages 21-35, March 2000.
19. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proceedings of the 24th International Conference on Very Large Data Bases, New York City, New York, USA, pages 194-205, August 1998.
20. D. A. White and R. Jain. Similarity indexing with the ss-tree. In Proceedings of the 12th International Conference on Data Engineering, New Orleans, Louisiana, USA, pages 516-523, February 1996.
21. T. Zhang, R. Ramakrishnan, and M. Livny. Birch: An efficient data clustering method for very large databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data, Montreal, Canada, pages 103-114, June 1996.