Volume 3 - Issue 2
Efficient CBIR retrieval method for image database
Abstract
How to retrieval efficiently similar images from large images database is a great challenge for content-based image retrieval system. A modified K-means cluster algorithm is proposed to form the hierarchy of the indexing structure. A search method based on A*, triangle inequality principle and N-nearest neighbours is applied to achieve an optimal search for the large image database. Experiments on Corel database are carried out that the proposed method based on the hierarchical indexing structure and new search algorithm achieves the logarithm retrieval efficiency.
Paper Details
PaperID: 42549141739
Author's Name: Tang, M., Yang, A., Deng, H.
Volume: Volume 3
Issues: Issue 2
Keywords: A* tree algorithm, Hierarchy of indexing structure, K-means cluster algorithm, Triangle inequality
Year: 2008
Month: April
Pages: 461 - 466