Image Characteristics Indexing Based on X-Tree

Abstract:

Image data set are usually very large, which might consist of millions of image objects, it is essential to use an efficient and effective indexing technique to facilitate speedy searching. The features can be expressed in terms of high-dimensional vector data which can be compared with a given query for similarity between them. It is more important that the image database should be preprocessed and establish indexing to improve retrieval efficiency. In this paper, the method of improved X-tree is proposed, design and implementation of a high dimensional index application to facilitate the speedy searching in feature based image information retrieval. Compared by retrieval efficiency and retrieval result, it is convincingly proved that hierarchical index structure based on clustering is efficient and applicable in image characteristics indexing.

• Periodical: Applied Mechanics and Materials (Volumes 513-517)
• Pages: 3761-3764
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.513-517.3761
• Online since: February 2014
• Authors: Rong Hua Gao, Hua Rui Wu*
• Keywords: Image Characteristics, Indexing, Multimedia, Retrieval, X-Tree

References

[1] Liu Yang , Rong Jin , Mummert L. et al. A Boosting Framework for Visuality-Preserving Distance Metric Learning and Its Application to Medical Image Retrieval[J]. Pattern Analysis and Machine Intelligence, 2010, 32(1): 30-44.

DOI: 10.1109/tpami.2008.273

[2] Akakin, H.C., Gurcan M.N. Content-Based Microscopic Image Retrieval System for Multi-Image Queries[J]. IEEE Transactions on Information Technology in Biomedicine, 2012, 16(4): 758-769.

DOI: 10.1109/titb.2012.2185829

[3] Qianni Zhang, Izquierdo E. Histology Image Retrieval in Optimized Multifeature Spaces[J]. Biomedical and Health Informatics, 2013, 17(1): 240-249.

DOI: 10.1109/titb.2012.2227270

[4] Stefan Berchtold, Daniel A. Keim, Hans-Peter Kriegel. The X-tree: An Index Structure for High-Dimensional Data[C]. Proceedings of the 22th International Conference on Very Large Data Bases, 1996, San Francisco, 28-39.

[5] Jegou, H, Douze M, Schmid C. Product Quantization for Nearest Neighbor Search[J]. Pattern Analysis and Machine Intelligence, 2011, 33(1): 117-128.

DOI: 10.1109/tpami.2010.57

[6] H.I. Lin, H. Jagadish, and C. Faloutsos. The TV-tree : An Index Structure for High Dimensional Data[J]. VLDB Journal, 1995, (3): 517-542.

DOI: 10.1007/bf01231606

[7] Ting Liu, Andrew W. Moore, Alexander Gray and Ke Yang. An Investigation of Practical Approximate Nearest Neighbor Algorithms[C]. In Proceedings of Neural Information Processing Systems, Vancouver, (2004).

[8] Hyun-JoLee, Jae-Woo Chang. Signature-Based Hybrid Spill-Tree for Indexing High-Dimensional Data[C]. In Proceedings of Computer and Information Technology, 2009: 287- 292.

DOI: 10.1109/cit.2009.93