arXiv · 0906.2770
Combinatorial pyramids and discrete geometry for energy-minimizing segmentation
Abstract
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.
Explore related subjects
Keep this discovery
Martin Braure De Calignon, Luc Brun, Jacques-Olivier Lachaud. 2009-06-15. Combinatorial pyramids and discrete geometry for energy-minimizing segmentation. https://arxiv.org/abs/0906.2770
Cite the original work for its findings. Save a collection to share your selection of sources.