An extendible hash for multi-precision similarity querying of image databases

VLDB 2001 - Proceedings of 27th International Conference on Very Large Data Bases

Volumn , Issue , 2001, Pages 221-230

  Lin, Shu ^a,d   Özsu, M Tamer ^b,d   Oria, Vincent ^c,d   Ng, Raymond ^e  

^a IBM TORONTO LAB   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

^c NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

^d UNIVERSITY OF ALBERTA   (Canada)

^e UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COLOR; GRAPHIC METHODS;

3-DIMENSIONAL; COLOR HISTOGRAM; COLOR VECTOR; FILTERING SCHEMES; IMAGE DATABASE; MULTI PRECISION; SIMILARITY-MATCHING; SUB-BLOCKS;

COLOR MATCHING;

EID: 84944325291     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R∗-tree: an efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 322-331, May 1990.
2. C. Faloutsos, W. Equitz, M. Flickner, W. Niblack, D. Petkovic, and R. Barber. Efficient and effective querying by image content. Jour. of Intelligent Information Systems, 3(3/4):231-262, July 1994.
3. J. Hafner, H. S. Sawhney, W. Equitz, M. Flickner, and W. Niblack. Efficient color histogram indexing for quadratic form distance functions. IEEE Trans. on Pattern Analysis and Machine Intelligence, 17(7):729-736, July 1995.
4. A. Hutflesz, H.-W. Six, and P. Widmayer. Globaly order preserving multidimensional linear hashing. In Proc. Fourth Int. Conf. on Data Eng., pages 572-579, February 1988.
5. N. Katayama and S. Satoh. The SR-tree: An index structure for high-dimensional nearest neighbor queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 369-380, May 1997.
6. H.-P. Kriegel and B. Seeger. Multdimensional order preserving linear hashing with partial expansion. In Proc. Int. Conf. on Database Theory, pages 203-220, September 1986.
7. H.-P. Kriegel and B. Seeger. Multidimensional quantile hashing is very efficient or non-uniform record distribution. In Proc. Third Int. Conf. on Data Engineering, pages 10-17, February 1987.
8. H.-P. Kriegel and B. Seeger. Multidimensional quantile hashing is very efficient or non-uniform record distribution. Informaion Science, 48:99-117, 1989.
9. K. Leung and R. T. Ng. Multiscale similarity matching for subimage queries of arbitrary size. In Proc. 4th Working Conf. on Visual Database Syst., pages 243-264, May 1998.
10. S. Lin. An extendible hashing structure for image similarity searches. Master's thesis, University of Alberta, Edmonton, Alberta, Canada, Fall 2000.
11. R. T. Ng and D. Tam. Multilevel filtering for highdimensional image data: Why and how. IEEE Trans. on Knowledge and Data Engineering, 11(6), November/December 1999.
12. J. Nievergelt, H. Hinterberger, and K. C. Sevcik. The grid file: An adaptable, symmetric multikey file structure. ACM Trans. on Database Systems, 9(1):38-71, March 1984.
13. V. Oria, M. T. Özsu, L. Liu, X. Li, J. Z. Li, Y. Niu, and P. J. Iglinski. Modeling images for content-based queries: The DISIMA approach. In Proc. 2nd Int. Conf. on Visual Information Systems, pages 339-346, October 1997.
14. M. Ouksel and P. Scheuermann. Storage mappings for multidimensional linear dynamic hashing. In Proceedings of ACM PODS, pages 90-105, May 1983.
15. R. Ramakrishnan and J. Gehrke. Database Management Systems, 2nd edition McGraw Hill, 2000.
16. M. Stricker and A. Dimai. Color indexing with weak spatial constraints. In Proc. Storage and Retrieval for Image and Video Databases IV, pages 29-40, February 1996.
17. M. A. Stricker and M. Orengo. Similarity of color images. In Proc. Storage and Retrieval for Image and Video Databases III, February 1995.
18. M. J. Swain and D. H. Ballard. Color indexing. Int. Jour. of Computer Vision, 7(1):11-32, 1991.
19. M. Turk and A. Pentland. Eigenfaces for recognition. Jour. of Cognitive Neuroscience, 3(1):71-86, 1991.
20. D. A. White and R. Jain. Similarity indexing with the SStree. In Proc. 12th Int. Conf. on Data Engineering, pages 516-523, 1996.
21. G. Wyszecki andW. S. Stiles. Color science : concepts and methods, quantitative data and formulae. Wiley and Sons, Inc., New York, NY, 2nd edition, 1982.