Tesselations by Connection in Orders

@inproceedings{Couprie2000TesselationsBC,
  title={Tesselations by Connection in Orders},
  author={Michel Couprie and Gilles Bertrand},
  booktitle={DGCI},
  year={2000}
}
The watershed transformation is a powerful tool for segmenting images, but its precise definition in discrete spaces raises difficult problems. We propose a new approach in the framework of orders. We introduce the tesselation by connection, which is a transformation that preserves the connectivity, andcan be implementedb y a parallel algorithm. We prove that this transformation possesses goodg eometrical properties. The extension of this transformation to weighted orders may be seen as a… 

Some properties of topological grayscale watersheds

In this paper, we investigate topological watersheds. For that purpose we introduce a notion of “separation between two points” of an image. One of our main results is a necessary and sufficient

Watersheds, mosaics, and the emergence paradigm

Watersheds, extension maps, and the emergence paradigm

In this paper, we investigate the links between the flooding paradigm and the topological watershed. Guided by the analysis of a classical flooding algorithm, we introduce several notions that help

Geodesy on label images, and applications to video sequence processing

On Topological Watersheds

  • G. Bertrand
  • Mathematics
    Journal of Mathematical Imaging and Vision
  • 2005
TLDR
A necessary and sufficient condition for a map G to be a watershed of a map F, this condition is based on a notion of extension and is derived from the framework of topological watersheds.

Advances in the Analysis of Topographic Features on Discrete Images

TLDR
This paper presents some advances related to the imposition of minima, the lower complete transformation, the hit-or-miss transform, and the extraction of crest lines by a skeletonisation procedure.

References

SHOWING 1-10 OF 34 REFERENCES

Topological gray-scale watershed transformation

TLDR
A 1D topology for grayscale images, and more generally for weighted graphs, is introduced that allows us to precisely define a topologicalgrayscale transformation that generalizes the action of a watershed transformation.

Poset approach to 3D parallel thinning

TLDR
It is shown that the iterative deletion of unipolar points constitutes a first thinning algorithm, and that such an algorithm does not 'thin enough' certain images.

Finite topology as applied to image analysis

A Model for Digital Topology

TLDR
This paper proposes a model for digital topology based on the notion of order and discrete topology and "validates" this model by considering the two fundamental notions of surface and simple point.

Discrete geometry for computer imagery : 8th international conference, DGCI '99, Marne-la-Vallée, France, March 17-19, 1999 : proceedings

Discrete Objects and Shapes.- Multiresolution Representation of Shapes Based on Cell Complexes.- Decomposing Digital 3D Shapes Using a Multiresolution Structure.- Optimal Time Computation of the

Digital topology: Introduction and survey

Image Analysis and Mathematical Morphology

TLDR
This invaluable reference helps readers assess and simplify problems and their essential requirements and complexities, giving them all the necessary data and methodology to master current theoretical developments and applications, as well as create new ones.

Mathematical Morphology in Image Processing

TLDR
This book is designed to be of interest to optical, electrical and electronics, and electro-optic engineers, including image processing, signal processing, machine vision, and computer vision engineers, applied mathematicians, image analysts and scientists and graduate-level students in image processing and mathematical morphology courses.

New Notions for Discrete Topology

TLDR
This work investigates the notions of unipolar and free points, and proposes some discrete definitions for homotopy and a generalization of the notion of simple point.