By Topic

Case Study: Distance-Based Image Retrieval in the MoBIoS DBMS

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Mao, R. ; Dept. of Comput. Sci., Texas Univ., Austin, TX ; Iqbal, Q. ; Wenguo Liu ; Miranker, D.P.

Similarity search leveraging distance-based index structures is increasingly being used for complex data types. It has been shown that for high dimensional uniform vectors with similarity norms, any clustering and partitioning index method is outperformed by sequential scan. However, intrinsic clustering of real data usually leads to low intrinsic dimensionality. MoBIoS (the molecular biological information system) is a next generation database management system comprising distance-based indices. Owing to its generality, we have built, evaluated and optimized a prototype of a distance-based image retrieval system. We show that under a metric distance function, image data is intrinsically low dimensional. We investigate the performance of three distance-based index structures (M-tree, RBT-index, and MVP-index), and, to optimize the construction of MVP-indexes, develop new heuristics that seek centers as pivots and partition the data according to its intrinsic clustering. Last, we show the SQL extension to embody distance-based image retrieval in MoBIoS

Published in:

Computer and Information Technology, 2005. CIT 2005. The Fifth International Conference on

Date of Conference:

21-23 Sept. 2005