Fast marching based superpixels - Archive ouverte HAL Access content directly
Journal Articles Mathematical Morphology - Theory and Applications Year : 2020

Fast marching based superpixels


In this article, we present a fast-marching based algorithm for generating superpixel (FMS) partitions of images. The idea behind the algorithm is to draw an analogy between waves propagating in an heterogeneous medium and regions growing on an image at a rate depending on the local color and texture. The FMS algorithm is evaluated on the Berkeley Segmentation Dataset 500. It yields results in term of boundary adherence that are comparable to the ones obtained with state of the art algorithms including SLIC or ERGC, while improving on these algorithms in terms of compactness and density.
Not file

Dates and versions

hal-03105868 , version 1 (11-01-2021)





Kaiwen Chang, Bruno Figliuzzi. Fast marching based superpixels. Mathematical Morphology - Theory and Applications, 2020, 4 (1), pp.127-142. ⟨10.1515/mathm-2020-0105⟩. ⟨hal-03105868⟩
4593 View
0 Download



Gmail Facebook Twitter LinkedIn More