Nearest neighbor retrieval using distance-based hashing

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 327-336

  Athitsos, Vassilis ^a   Potamias, Michalis ^b   Papapetrou, Panagiotis ^b   Kollios, George ^b  

^a The University of Texas at Arlington   (United States)

^b BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DEMODULATION; FUNCTIONS; IMAGE SEGMENTATION; INDEXING (OF INFORMATION); TECHNOLOGY;

DATA ENGINEERING; DISTANCE MEASURES; DISTANCE-BASED; DISTANCE-BASED INDEXING; HASH FUNCTIONS; HASH TABLES; INDEX STRUCTURES; INDEXING METHODS; INTERNATIONAL CONFERENCES; LOCALITY-SENSITIVE HASHING; METRIC DISTANCES; MULTI-BIT; NEAREST-NEIGHBOR RETRIEVAL; REAL-WORLD DATA SETS; RETRIEVAL ACCURACY; SAMPLE DATA; VECTOR SPACES;

TREES (MATHEMATICS);

EID: 52649111585     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497441     Document Type: Conference Paper

References (50)

1. S. Belongie, J. Malik, and J. Puzieha, "Shape matching and object recognition using shape contexts," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 4, pp. 509-522, 2002.
2. K. Grauman and T. J. Darrell, "Fast contour matching using approximate earth mover's distance," in IEEE Conference on Computer Vision and Pattern Recognition, vol. 1, 2004, pp. 220-227.
3. G. Shakhnaravich, P. Viola, and T. Dairell, "Fast pose estimation with parameter-sensitive hashing," in IEEE International Conference on Computer Vision (ICCV), 2003, pp. 750-757.
4. S. Altschul, W. Gish, W. Miller, E. Myers, and D. Lipman, "Basic local alignment search tool," Journal of Molecular Biology, vol. 215, no. 3, pp. 403-10, 1990.
5. B. Boeckmann, A. Bairoch, R. Apweiler, M. C. Blatter, A. Estreicher, E. Gasteiger, M. J. Martin, K. Michoud, C. O'Donovan, I. Phan, S. Pilbout, and M. Schneider, "The swiss-prot protein knowledgebase and its supplement TrEMBL in 2003." Nucleic Acids Research, vol. 31, no. 1, pp. 365-370, 2003.
6. M. Flickner, H. Sawhney, W. Niblack, J. Ashley, Q. Huang, B. Dom, M. Gorkani, J. Hafner, D. Lee, D. Petkovic, D. Steele, and P. Yanker, "Query by image and video content: The QBIC system," IEEE Computer, vol. 28, no. 9, 1995.
7. Y. Zhu and D. Shasha, "Warping indexes with envelope transforms for query by humming." in ACM International Conference on Management of Data (SIGMOD), 2003, pp. 181-192.
8. A. Gionis, P. Indyk, and R. Motwani, "Similarity search in high dimensions via hashing," in International Conference on Very Large Databases (VLDB), 1999, pp. 518-529.
9. A. Andoni and P. Indyk, "Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions," in IEEE Symposium on Foundations of Computer Science (FOCS), 2006, pp. 459-468.
10. A. Frome, D. Huber, R. Kolluri, T. Bulow, and J. Malik, "Recognizing objects in range data using regional point descriptors," in European Conference on Computer Vision, vol. 3, 2004, pp. 224-237.
11. Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li, "Multiprobe lsh: Efficient indexing for high-dimensional similarity search," in International Conference on Very Large Databases (VLDB), 2007, pp. 950-961.
12. A. Andoni and P. Indyk, "Efficient algorithms for substring near neighbor problem," in ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006, pp. 1203-1212.
13. J. Buhler, "Efficient large-scale sequence comparison by locality-sensitive hashing," Bioinformatics, vol. 17, no. 5, 2001.
14. 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, vol. 33, no. 3, pp. 322-373, 2001.
15. G. Hjaltason and H. Samet, "Properties of embedding methods for similarity searching in metric spaces," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 25, no. 5, pp. 530-549, 2003.
16. G. R. Hjaltason and H. Samet, "Index-driven similarity search in metric spaces," ACM Transactions on Database Systems, vol. 28, no. 4, pp. 517-580, 2003.
17. D. A. White and R. Jain, "Similarity indexing: Algorithms and performance," in Storage and Retrieval for Image and Video Databases (SPIE), 1996, pp. 62-73.
18. K. V. R. Kanth, D. Agrawal, and A. Singh, "Dimensionality reduction for similarity searching in dynamic databases," in ACM International Conference on Management of Data (SIGMOD), 1998, pp. 166-176.
19. 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, vol. 14, no. 4, pp. 792-808, 2002.
20. Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima, "The A-tree: An index structure for high-dimensional spaces using relative approximation," in International Conference on Very Large Data Bases, 2000, pp. 516-526.
21. E. Tuncel, H. Ferhatosmanoglu, and K. Rose, "VQ-index: An index structure for similarity searching in multimedia databases," in Proc. of ACM Multimedia, 2002, pp. 543-552.
22. R. Weber and K. Böhm, "Trading quality for time with nearest-neighbor search," in International Conference on Extending Database Technology: Advances in Database Technology, 2000, pp. 21-35.
23. R. Weber, H.-J. Schek, and S. Blott, "A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces," in International Conference on Very Large Data Bases, 1998, pp. 194-205.
24. V. I. Levenshtein, "Binary codes capable of correcting deletions, insertions, and reversals," Soviet Physics, vol. 10, no. 8, pp. 707-710, 1966.
25. E. Keogh, "Exact indexing of dynamic time warping," in International Conference on Very Large Data Bases, 2002, pp. 406-417.
26. H. Barrow, J. Tenenbaum, R. Bolles, and H. Wolf, "Parametric correspondence and chamfer matching: Two new techniques for image matching," in International Joint Conference on Artificial Intelligence, 1977, pp. 659-663.
27. T. M. Cover and J. A. Thomas, Elements of information theory. New York, NY, USA: Wiley-Interscience, 1991.
28. E. Chávez, G. Navarro, R. Baeza-Yates, and J. L. Marroquín, "Searching in metric spaces," ACM Computing Surveys, vol. 33, no. 3, pp. 273-321, 2001.
29. E. Chávez and G. Navarro, "Metric databases." in Encyclopedia of Database Technologies and Applications, L. C. Rivera, J. H. Doom, and V. E. Ferraggine, Eds. Idea Group, 2005, pp. 366-371.
30. P. Yianilos, "Data structures and algorithms for nearest neighbor search in general metric spaces," in ACM-SIAM Symposium on Discrete Algorithms (SODA), 1993, pp. 311-321.
31. J. Uhlman, "Satisfying general proximity/similarity queries with metric uses," Information Processing Letters, vol.40, no.4, pp. 175-179, 1991.
32. T. Bozkaya and Z. Ozsoyoglu, "Indexing large metric spaces for similarity seach queries," ACM Transactions on Database Systems (TODS), vol. 24, no. 3, pp. 361-404, 1999.
33. P. Ciaccia, M. Patella, and P. Zezula, "M-tree: An efficient access method for similarity search in metric spaces," in International Conference on Very Large Data Bases, 1997, pp. 426-435.
34. C. Traina, Jr., A. Traina, B. Seeger, and C. Faloutsos, "Slim-trees: High performance metric trees minimizing overlap between nodes," in International Conference on Extending Database Technology (EDBT), 2000, pp. 51-65.
35. P. Zezula, P. Savino, G. Amato, and F. Rabitti, "Approximate similarity retrieval with M-trees," The VLDB Journal, vol. 4, pp. 275-293, 1998.
36. V Athitsos, M. Hadjieleftheriou, G. Kollios, and S. Sclaroff, "Query-sensitive embeddings," ACM Transactions on Database Systems (TODS), vol. 32, no. 2, 2007.
37. J. Bourgain, "On Lipschitz embeddings of finite metric spaces in Hilbert space," Israel Journal of Mathematics, vol. 52, pp. 46-52, 1985.
38. C. Faloutsos and K. I. Lin, "FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets," in ACM International Conference on Management of Data (SIGMOD), 1995, pp. 163-174.
39. G. Hristescu and M. Farach-Colton, "Cluster-preserving embedding of proteins," CS Department, Rutgers University, Tech. Rep. 99-50, 1999.
40. X. Wang, J. T. L. Wang, K. I. Lin, D. Shasha, B. A. Shapiro, and K. Zhang, "An index structure for data mining and clustering," Knowledge and Information Systems, vol. 2, no. 2, pp. 161-184, 2000.
41. K.-S. Goh, B. Li, and E. Chang, "DynDex: a dynamic and non-metric space indexer," in ACM International Conference on Multimedia, 2002, pp. 466-475.
42. M. E. Houle and J. Sakuma, "Fast approximate similarity search in extremely high-dimensional data sets," in IEEE International Conference on Data Engineering (ICDE), 2005, pp. 619-630.
43. T. Skopal, "On fast non-metric similarity search by metric access methods," in International Conference on Extending Database Technology (EDBT), 2006, pp. 718-736.
44. R. Panigrahy, "Entropy based nearest neighbor search in high dimensions," in ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006, pp. 1186-1195.
45. I. Guyon, L. Schomaker, and R. Plamondon, "Unipen project of online data exchange and recognizer benchmarks," in 12th International Conference on Pattern Recognition, 1994, pp. 29-33.
46. J. B. Kruskall and M. Liberman, "The symmetric time warping algorithm: From continuous to discrete," in Time Warps. Addison-Wesley, 1983.
47. Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, "Gradient-based learning applied to document recognition," Proceedings of the IEEE, vol. 86, no. 11, pp. 2278-2324, 1998.
48. V. Athitsos, "Learning embeddings for indexing, retrieval, and classification, with applications to object and shape recognition in image databases," Ph.D. dissertation, Boston University, 2006.
49. Poser 5 Reference Manual, Curious Labs, Santa Cruz, CA, August 2002.
50. Q. Yuan, S. Sclaroff, and V. Athitsos, "Automatic 2D hand tracking in video sequences." in IEEE Workshop on Applications of Computer Vision, 2005, pp. 250-256.