关键词: K-均值聚类算法, A*树算法, 三角不等式原则, N近邻方法

Abstract: How to retrieve similar images from large images database efficiently is a great challenge for content-based image retrieval system. A modified K-means algorithm was proposed to form the hierarchy of the indexing structure. A* search algorithm, triangle inequality principle and N-near neighbours were applied to achieve an optimal search in order to retrieve efficiently for the large image database. Experiments on Corel database show that the proposed algorithm achieves efficient logarithm retrieval.

Key words: K-means cluster algorithm, A* tree algorithm, triangle inequality principal, N-near neighbours method