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

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 together with an iterative algorithm that place seeds vertices at smart locations. Oversegmentation application shows the effectiveness of our approach and gives results comparable to the state-of-the-art methods.