A Contrario Selection of Optimal Partitions for Image Segmentation

by   Juan Cardelino, et al.

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.


page 3

page 7

page 9

page 11

page 13

page 14

page 15

page 22


Automatic Image Segmentation by Dynamic Region Merging

This paper addresses the automatic image segmentation problem in a regio...

Automatic Selection of Stochastic Watershed Hierarchies

The segmentation, seen as the association of a partition with an image, ...

On the improvement of the in-place merge algorithm parallelization

In this paper, we present several improvements in the parallelization of...

Assessing hierarchies by their consistent segmentations

Recent segmentation approaches start by creating a hierarchy of nested i...

An Efficient Evolutionary Based Method For Image Segmentation

The goal of this paper is to present a new efficient image segmentation ...

Lexicographic Enumeration of Set Partitions

In this report, we summarize the set partition enumeration problems and ...

Combinatorial pyramids and discrete geometry for energy-minimizing segmentation

This paper defines the basis of a new hierarchical framework for segment...

Please sign up or login with your details

Forgot password? Click here to reset