2006Journal of Xiamen UniversityRequires access

Image Database Content-based Retrieval Indexing Analyses

Lin Kun-hui

Open publisher page 0 citations

Abstract

The enhancement of high-dimensional indexing technique is necessary to improve the performance of image database retrieval.In this paper,the structure and performance of SR-tree and X-tree was analyzed,and split algorithm was improved by introducing the super-node idea in X-tree.A new high-dimensional indexing structure ESR-tree(Extended SR-tree) which used super-sphere and super-rectangle as data package was designed.It reduced overlap effectively,avoided unnecessary split and maintained the balances of the indexing tree.It also reduces the CPU time and I/O number and improves the retrieval efficiency.Experiments show that the performance of ESR-tree is better than SR-tree and X-tree with the increasing data number and dimensions.

About this research paper

What this paper is about

The enhancement of high-dimensional indexing technique is necessary to improve the performance of image database retrieval.In this paper,the structure and performance of SR-tree and X-tree was analyzed,and split algorithm was improved by introducing the super-node idea in X-tree.A new high-dimensional indexing structure ESR-tree(Extended SR-tree) which used super-sphere and super-rectangle as data package was designed.It reduced overlap effectively,avoided unnecessary split and maintained the balances of the indexing tree.It also reduces the CPU time and I/O number and improves the retrieval efficiency.Experiments show that the performance of ESR-tree is better than SR-tree and X-tree with the increasing data number and dimensions.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The enhancement of high-dimensional indexing technique is necessary to improve the performance of image database retrieval.In this paper,the structure and performance of SR-tree and X-tree was analyzed,and split algorithm was improved by introducing the super-node idea in X-tree.A new high-dimensional indexing structure ESR-tree(Extended SR-tree) which used super-sphere and super-rectangle as data package was designed.It reduced overlap effectively,avoided unnecessary split and maintained the balances of the indexing tree.It also reduces the CPU time and I/O number and improves the retrieval efficiency.Experiments show that the performance of ESR-tree is better than SR-tree and X-tree with the increasing data number and dimensions.

Key concepts: Search engine indexing, Tree (set theory), Computer science, R-tree, Database index, Rectangle, Tree structure, B-tree

Related papers

Back to paper searchBrowse research topicsOriginal source
Image Database Content-based Retrieval Indexing Analyses — Research Paper | ScholarLens