Automatic Selection of Stochastic Watershed Hierarchies

09/09/2016
by   Amin Fehri, et al.
0

The segmentation, seen as the association of a partition with an image, is a difficult task. It can be decomposed in two steps: at first, a family of contours associated with a series of nested partitions (or hierarchy) is created and organized, then pertinent contours are extracted. A coarser partition is obtained by merging adjacent regions of a finer partition. The strength of a contour is then measured by the level of the hierarchy for which its two adjacent regions merge. We present an automatic segmentation strategy using a wide range of stochastic watershed hierarchies. For a given set of homogeneous images, our approach selects automatically the best hierarchy and cut level to perform image simplification given an evaluation score. Experimental results illustrate the advantages of our approach on several real-life images datasets.

READ FULL TEXT

page 3

page 5

research
04/11/2022

Assessing hierarchies by their consistent segmentations

Recent segmentation approaches start by creating a hierarchy of nested i...
research
05/06/2013

A Contrario Selection of Optimal Partitions for Image Segmentation

We present a novel segmentation algorithm based on a hierarchical repres...
research
04/02/2020

Minimal obstructions for a matrix partition problem in chordal graphs

If M is an m × m matrix over { 0, 1, ∗}, an M-partition of a graph G is ...
research
04/13/2016

Reversible Image Merging for Low-level Machine Vision

In this paper a hierarchical model for pixel clustering and image segmen...
research
05/23/2016

Stochastic Patching Process

Stochastic partition models tailor a product space into a number of rect...
research
04/29/2021

Compatibility of Partitions, Hierarchies, and Split Systems

The question whether a partition 𝒫 and a hierarchy ℋ or a tree-like spli...

Please sign up or login with your details

Forgot password? Click here to reset