A Semantic Index Structure for Multimedia Retrieval

To be effective multimedia retrieval mechanisms, index methods must provide not only efficient access but also meaningful retrieval by addressing challenges in multimedia retrieval. This article presents the AH+-tree, a height-balanced, tree-based index structure that efficiently incorporates high-level affinity information to support Content-Based Image Retrieval (CBIR) through similarity queries. The incorporation of affinity information allows the AH+-tree to address the problems of semantic gap and user perception subjectivity inherent to multimedia retrieval. Based on the Affinity-Hybrid Tree (AH-Tree), the AH+-tree utilizes affinity information in a novel way to eliminate the I/O overhead of the AH-Tree while maintaining the same functionality and quality of results. We explain the structure of the AH+-tree and implement and analyze algorithms for tree construction and similarity queries (range and nearest neighbor). Experimental results demonstrate the superior I/O efficiency of the AH+-tree over that of the AH-Tree and the M-tree without a detrimental impact on real-time costs of the retrieval process.

[1]  Christos Faloutsos,et al.  Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes , 2000, EDBT.

[2]  Hong Heather Yu,et al.  Overview and Future Trends of Multimedia Research for Content Access and Distribution , 2007, Int. J. Semantic Comput..

[3]  Tomás Skopal,et al.  Where are you heading, metric access methods?: a provocative survey , 2010, SISAP.

[4]  David B. Lomet,et al.  The hB-tree: a multiattribute indexing method with good guaranteed performance , 1990, TODS.

[5]  Jurandy Almeida,et al.  BP-tree: an efficient index for similarity search in high-dimensional metric spaces , 2010, CIKM.

[6]  Shu-Ching Chen,et al.  Affinity Hybrid Tree: An Indexing Technique for Content-Based Image Retrieval in Multimedia Databases , 2006, Eighth IEEE International Symposium on Multimedia (ISM'06).

[7]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[8]  Dianhui Wang,et al.  Multimedia data mining for building rule-based image retrieval systems , 2005, 2005 IEEE International Conference on Multimedia and Expo.

[9]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[10]  Peter N. Yianilos,et al.  Data structures and algorithms for nearest neighbor search in general metric spaces , 1993, SODA '93.

[11]  Guojun Lu.  Techniques and data structures for efficient multimedia retrieval based on similarity , 2002, IEEE Trans. Multim..

[12]  Pavel Zezula,et al.  Similarity Search: The Metric Space Approach (Advances in Database Systems) , 2005 .

[13]  Jiawei Han,et al.  Mining MultiMedia Data , 1999 .

[14]  Beng Chin Ooi,et al.  iDistance: An adaptive B+-tree based indexing method for nearest neighbor search , 2005, TODS.

[15]  Pavel Zezula,et al.  Similarity Search - The Metric Space Approach , 2005, Advances in Database Systems.

[16]  Min Chen,et al.  MMM: a stochastic mechanism for image database queries , 2003, Fifth International Symposium on Multimedia Software Engineering, 2003. Proceedings..

[17]  Benjamin Bustos,et al.  Dynamic similarity search in multi-metric spaces , 2006, MIR '06.

[18]  Ramez Elmasri,et al.  Fundamentals of Database Systems , 1989 .

[19]  HongJiang Zhang.  Relevance Feedback in Content-based Image Search , 2001, PRIS.

[20]  J. T. Robinson,et al.  The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.

[21]  Ge Yu,et al.  M+-tree : A New Dynamical Multidimensional Index for Metric Spaces , 2003, ADC.

[22]  Rudolf Bayer,et al.  Organization and maintenance of large ordered indexes , 1972, Acta Informatica.

[23]  Tomás Skopal,et al.  Improving the Performance of M-Tree Family by Nearest-Neighbor Graphs , 2007, ADBIS.