Multidimensional descriptor indexing: Exploring the BitMatrix

10Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Multimedia retrieval brings new challenges, mainly derived from the mismatch between the level of the user interaction-high-level concepts, and that of the automatically processed descriptors-low-level features. The effective use of the low-level descriptors is therefore mandatory. Many data structures have been proposed for managing the representation of multidimensional descriptors, each geared toward efficiency in some set of basic operations. The paper introduces a highly parametrizable structure called the BitMatrix, along with its search algorithms. The BitMatrix is compared with existing methods, all implemented in a common framework. The tests have been performed on two datasets, with parameters covering significant ranges of values. The BitMatrix has proved to be a robust and flexible structure that can compete with other methods for multidimensional descriptor indexing. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Calistru, C., Ribeiro, C., & David, G. (2006). Multidimensional descriptor indexing: Exploring the BitMatrix. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4071 LNCS, pp. 401–410). Springer Verlag. https://doi.org/10.1007/11788034_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free