A visual word clustering algorithm based on affinity propagation

摘要

Because of the weaknesses of k-means clustering would result in deviation of the vocabulary tree structure, we developed an improved vocabulary tree structure based on affinity propagation clustering algorithm. There were three datasets used to test the tasks: the Corel dataset, the LabelMe dataset and the Caltech-101 dataset. The experiments evaluated this new build method for vocabulary tree offers not only incrementally computed sets of vocabulary tree quickly, but gained in retrieval accuracy as well.