A contrario selection of optimal partitions for image segmentation
From MaRDI portal
Publication:2873239
Abstract: We present a novel segmentation algorithm based on a hierarchical representation of images. The main contribution of this work is to explore the capabilities of the A Contrario reasoning when applied to the segmentation problem, and to overcome the limitations of current algorithms within that framework. This exploratory approach has three main goals. Our first goal is to extend the search space of greedy merging algorithms to the set of all partitions spanned by a certain hierarchy, and to cast the segmentation as a selection problem within this space. In this way we increase the number of tested partitions and thus we potentially improve the segmentation results. In addition, this space is considerably smaller than the space of all possible partitions, thus we still keep the complexity controlled. Our second goal aims to improve the locality of region merging algorithms, which usually merge pairs of neighboring regions. In this work, we overcome this limitation by introducing a validation procedure for complete partitions, rather than for pairs of regions. The third goal is to perform an exhaustive experimental evaluation methodology in order to provide reproducible results. Finally, we embed the selection process on a statistical A Contrario framework which allows us to have only one free parameter related to the desired scale.
Recommendations
- Image segmentation by a contrario simulation
- Hierarchizing graph-based image segmentation algorithms relying on region dissimilarity: the case of the Felzenszwalb-Huttenlocher method
- A methodology for hierarchical image segmentation evaluation
- Image segmentation with multidimensional refinement indicators
- scientific article; zbMATH DE number 1796925
Cited in
(9)- A methodology for hierarchical image segmentation evaluation
- An overview of SaT segmentation methodology and its applications in image processing
- A three-stage approach for segmenting degraded color images: smoothing, lifting and thresholding (SLaT)
- Hierarchizing graph-based image segmentation algorithms relying on region dissimilarity: the case of the Felzenszwalb-Huttenlocher method
- Energy partitions and image segmentation
- Image segmentation by a contrario simulation
- Joint contours, corner and T-junction detection: an approach inspired by the mammal visual system
- Ordering partial partitions for image segmentation and filtering: merging, creating and inflating blocks
- Minimal partitions and image classification using a gradient-free perimeter approximation
This page was built for publication: A contrario selection of optimal partitions for image segmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2873239)