A Novel Fast Affinity Propagation Based Visual Word Clustering Algorithm
The weaknesses of k-means clustering would result in deviation of the vocabulary tree structure. In this paper, we developed an improved affinity propagation clustering algorithm based vocabulary tree structure. Three datasets were used to test the tasks: the Corel dataset, the LabelMe dataset and the Caltech-101 dataset. The experimental result shows that this new build method for vocabulary tree offers not only compute vocabulary tree set faster, but also improve the retrieval accuracy.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
Document Type: Research Article
Publication date: November 1, 2014
More about this publication?
- Journal of Computational and Theoretical Nanoscience is an international peer-reviewed journal with a wide-ranging coverage, consolidates research activities in all aspects of computational and theoretical nanoscience into a single reference source. This journal offers scientists and engineers peer-reviewed research papers in all aspects of computational and theoretical nanoscience and nanotechnology in chemistry, physics, materials science, engineering and biology to publish original full papers and timely state-of-the-art reviews and short communications encompassing the fundamental and applied research.
- Editorial Board
- Information for Authors
- Submit a Paper
- Subscribe to this Title
- Terms & Conditions
- Ingenta Connect is not responsible for the content or availability of external websites