Eikonal-based vertices growing and iterative seeding for efficient graph-based segmentation

Pierre Buyssens (1) , Matthieu Toutain (1) , Abderrahim Elmoataz (1) , Olivier Lézoray (1)

1 Equipe Image - Laboratoire GREYC - UMR6072

In this paper we propose to use the Eikonal equation on graphs for generalized data clustering. We introduce a new potential function that favors the creation of homogeneous clusters to-gether with an iterative algorithm that place seeds vertices at smart locations. Oversegmentation application shows the ef-fectiveness of our approach and gives results comparable to the state-of-the-art methods.

Mots clés: Graphs; Eikonal equation; Seeds positioning; Oversegmentation

Domaines: Traitement des images [eess.IV]

Pierre Buyssens, Matthieu Toutain, Abderrahim Elmoataz, Olivier Lézoray. Eikonal-based vertices growing and iterative seeding for efficient graph-based segmentation. IEEE International Conference on Image Processing (ICIP 2014), Oct 2014, Paris, France. 5 pp. ⟨hal-01080017⟩