Corpus ID: 16666149

Partitions d ’ Energie et Segmentation d ’ Images Energy Partitions and Image Segmentation

  title={Partitions d ’ Energie et Segmentation d ’ Images Energy Partitions and Image Segmentation},
  author={Pablo Arbel{\'a}ez and L. Cohen},
We present a method for low-level image segmentation. The problem is formulated in terms of the partition induced by a set of sources and a determined energy. We study two types of energies that process the image at different levels of analysis. The first class is based on the theory of minimal paths and produces a présegmentation of the image. In the second part, where the energy is defined through a region merging process, the simplified image is used to create hierarchies of partitions. 


Extraction de caractéristiques, segmentation d'image et morphologie mathématique
The purpose of this thesis is to investigate new morphological methods for extracting the characteristics of an image regions. These methods are destined to be applied to image segmentation. TwoExpand
Extensive operators in partition lattices for image sequence analysis
This paper proposes a general merging algorithm that can be used to create new connected operators (in particular self-dual operators) and efficient segmentation algorithms (robust criteria and efficient implementation). Expand
Hierarchies of Partitions and Morphological Segmentation
This paper defines, study, construct and show how to use hierarchical segmentation approaches for various segmention or filtering tasks such hierarchies. Expand
The flat zone approach: A general low-level region merging segmentation method
A flat zone segmentation method that is robust (in the sense that it is invariant under certain intensity value transformations) and uses a hierarchical waiting queue algorithm that makes it extremely efficient. Expand
A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics
A database containing 'ground truth' segmentations produced by humans for images of a wide variety of natural scenes is presented and an error measure is defined which quantifies the consistency between segmentations of differing granularities. Expand
Geodesic Saliency of Watershed Contours and Hierarchical Segmentation
A hierarchical segmentation process is derived, which gives a compact description of the image, containing all the segmentations one can obtain by the notion of dynamics, by means of a simple thresholding. Expand
Snakes on the Watershed
A new approach for object boundary extraction, called the watersnake, which is a two-step snake algorithm whose energy functional is minimized by the dynamic programming method and is applied to segmentation of white blood cells in bone marrow images. Expand
Global Minimum for Active Contour Models: A Minimal Path Approach
  • L. Cohen, R. Kimmel
  • Mathematics, Computer Science
  • International Journal of Computer Vision
  • 2004
A new boundary detection approach for shape modeling that detects the global minimum of an active contour model’s energy between two end points and explores the relation between the maximum curvature along the resulting contour and the potential generated from the image. Expand
Subpixel distance maps and weighted distance transforms
An algorithm for computing the Euclidean distance from the boundary of a given digitized shape is presented. The distance is calculated with sub-pixel accuracy. The algorithm is based on an equalExpand
New measure of contrast: the dynamics
  • M. Grimaud
  • Geography, Engineering
  • Optics & Photonics
  • 1992
A transformation which valuates the extrema on a contrast criterion: the dynamics is proposed and a technique of computation based on flooding simulations is proposed which will help to develop the use of the promising transformations based on the dynamics. Expand