Paper Title:
An Efficient Hierarchical Clustering Algorithm and its Application for Image Retrieval
  Abstract

Clustering is an efficient and fundamental unsupervised learning algorithm for many vision-based applications. This paper aim at the problems of fast indexing high-dimensional local invariant features of images (e.g. SIFT features) and quick similarity searching of images in a scalable image database by using a hierarchical clustering algorithm. We adopt the hierarchical K-means (HKM) clustering method to build a visual vocabulary tree efficiently on given training data and represent image as a “bag of visual words” which are the leaf nodes of the visual vocabulary tree. For the application of image retrieval, we adopt an usually-used indexing structure called “inverted file” to record the mapping of each visual word to the database images containing that visual word along with the number of times it appears in each image. We propose a weighted voting strategy for the application of content-based image retrieval and achieve desirable performance through experiments.

  Info
Periodical
Edited by
Ran Chen
Pages
3757-3761
DOI
10.4028/www.scientific.net/AMM.44-47.3757
Citation
W. M. Xu, K. L. Fang, H. R. Zhang, "An Efficient Hierarchical Clustering Algorithm and its Application for Image Retrieval", Applied Mechanics and Materials, Vols. 44-47, pp. 3757-3761, 2011
Online since
December 2010
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Zheng Liu, Hua Yan, Zhen Li
Abstract:Traditional image clustering methods mainly depends on visual features only. Due to the well-known “semantic gap”, visual features can hardly...
2649
Authors: Dan Wen Chen, Li Qiong Deng, Zhi Min Yuan, Ling Da Wu
Abstract:How to combine multi-modal features effectively is a difficult problem in news story correlation analysis, this paper puts forward a new...
1040
Authors: Yin Sheng Zhang, Hui Lin Shan, Jia Qiang Li, Jie Zhou
Chapter 8: Nanomaterials and Nanomanufacturing
Abstract:The traditional K-means clustering algorithm prematurely plunges into a local optimum because of sensitive selection of the initial cluster...
1977
Authors: Chun Xia Jin, Hai Yan Zhou, Qiu Chan Bai
Chapter 6: Algorithm Design
Abstract:To solve the problem of sparse keywords and similarity drift in short text segments, this paper proposes short text clustering algorithm with...
1716
Authors: Fang Yang, Li Jiang, Jian Hui Si, Cai Feng Liu, Xue Dong Tian
Chapter 11: Artificial Intelligence
Abstract:Character image clustering can find similar characters which have much reference value to ancient character identification. But the classical...
1728