Boruvka Meets Nearest Neighbors

Abstract : Computing the minimum spanning tree (MST) is a common task in the pattern recognition and the computer vision fields. However, little work has been done on efficient general methods for solving the problem on large datasets where graphs are complete and edge weights are given implicitly by a distance between vertex attributes. In this work we propose a generic algorithm that extends the classical Boruvka's algorithm by using nearest neighbors search structures to reduce significantly time and memory performances. The algorithm can also compute in a straightforward way approximate MSTs thus further improving speed. Experiments show that the proposed method outperforms classical algorithms on large low-dimensional datasets by several orders of magnitude. Finally, to illustrate the usefulness of the proposed algorithm, we focus on a classical computer vision problem: image segmentation. We modify a state-of-the-art local graph-based clustering algorithm, thus permitting a global scene analysis.
Type de document :
Pré-publication, Document de travail
Contributeur : Mariano Tepper <>
Soumis le : mardi 5 avril 2011 - 14:14:50
Dernière modification le : jeudi 13 octobre 2011 - 12:15:01
Document(s) archivé(s) le : jeudi 8 novembre 2012 - 13:25:56


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00583120, version 1


Mariano Tepper, Marta Mejail, Pablo Musé, Andrés Almansa. Boruvka Meets Nearest Neighbors. 2011. <hal-00583120>




Consultations de
la notice


Téléchargements du document