Simultaneous Segmentation and Filtering via Reduced Graph Cuts

Nicolas Lermé (1) , François Malgouyres (2)

1 SATIE - Systèmes et Applications des Technologies de l'Information et de l'Energie
2 IMT - Institut de Mathématiques de Toulouse UMR5219

Recently, optimization with graph cuts became very attractive but generally remains limited to small-scale problems due to the large memory requirement of graphs, even when restricted to binary variables. Unlike previous heuristics which generally fail to fully capture details, [8] proposes another band-based method for reducing these graphs in image segmentation. This method provides small graphs while preserving thin structures but do not offer low memory usage when the amount of regularization is large. This is typically the case when images are corrupted by an impulsive noise. In this paper, we overcome this situation by embedding a new parameter in this method to both further reducing graphs and filtering the segmentation. This parameter avoids any post-processing steps, appears to be generally less sensitive to noise variations and offers a good robustness against noise. We also provide an empirical way to automatically tune this parameter and illustrate its behavior for segmenting grayscale and color images.

Mots clés: graph cuts; reduction; image segmentation; filtering

Domaines: Optimisation et contrôle [math.OC]

Nicolas Lermé, François Malgouyres. Simultaneous Segmentation and Filtering via Reduced Graph Cuts. ACIVS, 2012, Brno, Czech Republic. pp.201 - 212, ⟨10.1007/978-3-642-33140-4_18⟩. ⟨hal-01486861⟩