高维索引技术作为高维空间数据的快速查询手段,对使用高维数据的基于内容图像检索有着广泛的应用。本文提出以Guttman提出的R树结构建立存储图像的特征值的高维索引结构来提高图像检索效率。首先对R树的结构进行介绍,然后通过对比相同情况下使用线性查询和R村查询各自的查询次数和查询时间分析R村查询的优势。实验结果表明,利用R树结构可以减少图像检索的查询次数和查询时间,明显地提高图像检索的效率。
High-dimensional indexing technique, as the quick query strategy in high dimension data, has been widely used in Content-Based Image Retrieval. This paper buihs a high-dimensional indexing structnre to store the eigenvalue of image inside nsing R-tree which is firstly proposed by Guttman in 1984. In order to improve the efficiency of image retrieval, this paper first introduces the structure of R-tree. Then the advantage of R-tree searching is analyzed by comparing the query times and searching time of R-tree searching and linear structnre searching respectively. The experimental results demonstrate that, benefited from the R-tree structure, the query times and searching time are reduced and the efficiency are improved remarkably.