La vitrine de diffusion des publications et contributions des chercheurs de l'ÉTS

A generalized graph reduction framework for interactive segmentation of large images

Gueziri, Houssem-Eddine et McGuffin, Michael J. et Laporte, Catherine. 2016. « A generalized graph reduction framework for interactive segmentation of large images ». Computer Vision and Image Understanding, vol. 150. p. 44-57.

[img] PDF
Accès restreint à : Administrateur seulement jusqu'au 17 Mai 2018.
Licence d'utilisation : Creative Commons CC BY-NC-ND.

Télécharger (11MB)


The speed of graph-based segmentation approaches, such as random walker (RW) and graph cut (GC), depends strongly on image size. For high-resolution images, the time required to compute a segmentation based on user input renders interaction tedious. We propose a novel method, using an approximate contour sketched by the user, to reduce the graph before passing it on to a segmentation algorithm such as RW or GC. This enables a significantly faster feedback loop. The user first draws a rough contour of the object to segment. Then, the pixels of the image are partitioned into “layers” (corresponding to di�erent scales) based on their distance from the contour. The thickness of these layers increases with distance to the contour according to a Fibonacci sequence. An initial segmentation result is rapidly obtained after automatically generating foreground and background labels according to a specifically selected layer; all vertices beyond this layer are eliminated, restricting the segmentation to regions near the drawn contour. Further foreground / background labels can then be added by the user to refine the segmentation. All iterations of the graphbased segmentation benefit from a reduced input graph, while maintaining full resolution near the object boundary. A user study with 16 participants was carried out for RW segmentation of a multi-modal dataset of 22 medical images, using either a standard mouse or a stylus pen to draw the contour. Results reveal that our approach significantly reduces the overall segmentation time compared with the status quo approach (p < 0:01). The study also shows that our approach works well with both input devices. Compared to super-pixel graph reduction, our approach provides full resolution accuracy at similar speed on a high-resolution benchmark image with both RW and GC segmentation methods. However, graph reduction based on super-pixels does not allow interactive correction of clustering errors. Finally, our approach can be combined with super-pixel clustering methods for further graph reduction, resulting in even faster segmentation.

Type de document: Article publié dans une revue, révisé par les pairs
McGuffin, Michael John
Laporte, Catherine
Affiliation: Génie logiciel et des technologies de l'information, Génie électrique
Date de dépôt: 30 mai 2016 16:11
Dernière modification: 17 janv. 2017 21:18

Actions (Authentification requise)

Dernière vérification avant le dépôt Dernière vérification avant le dépôt

Statistiques de téléchargement

Plus de statistiques ...