An efficient bitmap indexing method for similarity search in high dimensional multimedia databases

2004 IEEE International Conference on Multimedia and Expo (ICME)

Volumn 2, Issue , 2004, Pages 815-818

  Jeong, Jinguk ^a   Nang, Jongho ^a  

^a Sogang University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

BIT-STRINGS; BITMAP INDEXING METHOD; FILTERING PROCESS; HIGH DIMENSIONAL MULTIMEDIA DATABASES;

APPROXIMATION THEORY; DATABASE SYSTEMS; FILTRATION; IMAGE ANALYSIS; PROBLEM SOLVING; VECTORS;

MULTIMEDIA SYSTEMS;

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

References (6)

1. N. Beckmann, H.P, Kriegal, R. Schneider, and B. Seeger, "The R*-tree: An Efficient and Robust Access Method for Points and Rectangles," Proceedings of ACM SIGMOD Conference, 1990.
2. G.H. Cha, X. Zhu, D. Petkovic, and C.W. Chung, "An Efficient Indexing Method for Nearest Neighbor Searches in High-Dimensional Image Databases," IEEE Transaction on Multimedia, Vol. 4, No.1, 2002.
3. R. Weber, H.J. Schek, and S. Blott, "A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces," Proceedings of ICVLDB, 1998.
4. P.O. Neil, and D. Quass, "Improved Query Performance with Variant Indexes," Proceedings of ACM SIGMOD Conference, 1997.
5. A. Yamada, M. Pickering, S. Jeannin, L. Cieplinski, and Jens, MPEG-7 Visual part of eXperimentation Model Verision 9.0, ISO/IEC JTC1/ SC29/WG11/N3914, January 2001.
6. K.S. Beyer, J.Goldstein, R.Ramakrishan, and U.Shaft, "When is Nearest Neighbor Meaningful?," Proceedings of Int'l Conf. on Database Theory, 1999.