A compact space decomposition for effective metric indexing

Pattern Recognition Letters

Volumn 26, Issue 9, 2005, Pages 1363-1376

  Chávez, Edgar ^a   Navarro, Gonzalo ^b  

^a UNIVERSIDAD MICHOACANA DE SAN NICOLÁS DE HIDALGO   (Mexico)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; DATA REDUCTION; IMAGE ANALYSIS; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; MATHEMATICAL MODELS; MULTIMEDIA SYSTEMS;

INTRINSIC DATA; METRIC SPACE MODEL; METRIC SPACE SEARCHING; MULTIMEDIA INFORMATION RETRIEVAL;

PATTERN RECOGNITION;

EID: 18444400570     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2004.11.014     Document Type: Article

References (27)

1. F. Aurenhammer Voronoi diagrams-a survey of a fundamental geometric data structure ACM Comput. Surveys 23 3 1991
2. Baeza-Yates, R., Cunto, W., Manber, U., Wu, S., 1994. Proximity matching using fixed-queries trees. In: Proc. CPM'94, LNCS 807, pp. 198-212
3. C. Böhm, S. Berchtold, and D. Keim Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases ACM Comput. Surveys 33 3 2001 322 373
4. T. Bozkaya, and M. Ozsoyoglu Distance-based indexing for high-dimensional metric spaces Proc. SIGMOD'97 Sigmod Record 26 2 1997 357 368
5. Brin, S., 1995. Near neighbor search in large metric spaces. In: Proc. VLDB'95, pp. 574-584
6. W. Burkhard, and R. Keller Some approaches to best-match file searching CACM 16 4 1973 230 236
7. E. Chávez, and J. Marroquín Proximity queries in metric spaces Proc. WSP'97 1997 Carleton University Press 21 36
8. E. Chávez, J.L. Marroquín, and G. Navarro Fixed queries array: A fast and economical data structure for proximity searching Multimedia Tools Applic. (MTAP) 14 2 2001 113 135
9. E. Chávez, J. Marroquín, and R. Baeza-Yates Spaghettis: an array based algorithm for similarity queries in metric spaces Proc. String Process. Inform. Retrieval (SPIRE'99) 1999 IEEE CS Press 38 46
10. E. Chávez, and G. Navarro An effective clustering algorithm to index high dimensional metric spaces Proc. 7th Internat. Symp. on String Process. Inform. Retrieval (SPIRE'2000) 2000 IEEE CS Press 75 86
11. E. Chávez, G. Navarro, R. Baeza-Yates, and J.L. Marroquín Proximity searching in metric spaces ACM Comput. Surveys 33 3 2001 273 321
12. Ciaccia, P., Patella, M., Zezula, P., 1997. M-tree: an efficient access method for similarity search in metric spaces. In: Proc. 23rd Conf. on Very Large Databases (VLDB'97), pp. 426-435
13. F. Dehne, and H. Nolteimer Voronoi trees and clustering problems Inform. Syst. 12 2 1987 171 175
14. V. Dohnal, C. Gennaro, P. Savino, and P. Zezula D-index: Distance searching index for metric data sets Multimedia Tools Applic. 21 2003 9 33
15. V. Gaede, and O. Günther Multidimensional access methods ACM Comput. Surveys 30 2 1998 170 231
16. G. Gonnet, and R. Baeza-Yates Handbook of Algorithms and Data Structures second Ed. 1991 Addison-Wesley Reading, MA
17. Gisli R. Hjaltason, and Hanan Samet Index-driven similarity search in metric spaces ACM Trans. Database Syst. (TODS) 28 December 2003 517 580
18. Hjaltason, G.R., Samet, H., 2000. Incremental similarity search in multimedia databases. Technical Report CS-TR-4199, Department of Computer Science, University of Maryland
19. I. Kalantari, and G. McDonald A data structure and an algorithm for the nearest point problem IEEE Trans. Software Eng. 9 5 1983
20. L. Micó, J. Oncina, and R.C. Carrasco A fast branch and bound nearest neighbor classifier in metric spaces Pattern Recognition Lett. 17 1996 731 739
21. L. Micó, J. Oncina, and E. Vidal A new version of the nearest-neighbor approximating and eliminating search (AESA) with linear preprocessing-time and memory requirements Pattern Recognition Lett. 15 1994 9 17
22. G. Navarro Searching in metric spaces by spatial approximation Very Large Databases J. (VLDBJ) 11 1 2002 28 46
23. S. Nene, and S. Nayar A simple algorithm for nearest neighbor search in high dimensions IEEE Trans. PAMI 19 9 1997 989 1003
24. H. Nolteimer, K. Verbarg, and C. Zirkelbach Monotonous Bisector* Trees-a tool for efficient partitioning of complex schenes of geometric objects Data Structures and Efficient Algorithms LNCS 594 1992 Springer-Verlag Berlin 186 203
25. J. Uhlmann Satisfying general proximity/similarity queries with metric trees IPL 40 1991 175 179
26. E. Vidal An algorithm for finding nearest neighbors in (approximately) constant average time Pattern Recognition Lett. 4 1986 145 157
27. Yianilos, P., 1993. Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proc. SODA'93, pp. 311-321