In this paper, we propose a novel indexing method for complex similarity queries in high-dimensional image and video databases. In order to provide the indexing method with the flexibility in dealing with multiple features and multiple query objects, we treat every dimension independently. The efficiency of our method is realized by a specialized bitmap indexing that represents all objects in a database as a set of bitmaps. The percentage of data accessed in our indexing method is inversely proportional to the overall dimensionality, and thus the performance deterioration with the increasing dimensionality does not occur. To demonstrate the efficacy of our method we conducted extensive experiments and compared the performance with the linear scan by using real image and video datasets, and obtained a remarkable speedup over the linear scan. © Springer-Verlag 2004.
CITATION STYLE
Cha, G. H. (2004). Efficient and flexible bitmap indexing for complex similarity queries. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2973, 708–720. https://doi.org/10.1007/978-3-540-24571-1_63
Mendeley helps you to discover research relevant for your work.