Combinatorial pyramids and discrete geometry for energy-minimizing segmentation

This paper defines the basis of a new hierarchical framework for segmentation algorithms based on energy minimization schemes. This new framework is based on two formal tools. First, a combinatorial pyramid encode efficiently a hierarchy of partitions. Secondly, discrete geometric estimators measure precisely some important geometric parameters of the regions. These measures combined with photometrical and topological features of the partition allows to design energy terms based on discrete measures. Our segmentation framework exploits these energies to build a pyramid of image partitions with a minimization scheme. Some experiments illustrating our framework are shown and discussed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/24/2007

Contains and Inside relationships within combinatorial Pyramids

Irregular pyramids are made of a stack of successively reduced graphs em...
research
12/12/2007

Hierarchy construction schemes within the Scale set framework

Segmentation algorithms based on an energy minimisation framework often ...
research
04/22/2012

A Unified Multiscale Framework for Discrete Energy Minimization

Discrete energy minimization is a ubiquitous task in computer vision, ye...
research
10/01/2020

A survey of mass partitions

Mass partition problems describe the partitions we can induce on a famil...
research
09/21/2020

On uncertainty inequalities related to subcube partitions and additive energy

The additive energy plays a central role in combinatorial number theory....
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/11/2022

Assessing hierarchies by their consistent segmentations

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

Please sign up or login with your details

Forgot password? Click here to reset