424 research outputs found
A graph-based mathematical morphology reader
This survey paper aims at providing a "literary" anthology of mathematical
morphology on graphs. It describes in the English language many ideas stemming
from a large number of different papers, hence providing a unified view of an
active and diverse field of research
On the equivalence between hierarchical segmentations and ultrametric watersheds
We study hierarchical segmentation in the framework of edge-weighted graphs.
We define ultrametric watersheds as topological watersheds null on the minima.
We prove that there exists a bijection between the set of ultrametric
watersheds and the set of hierarchical segmentations. We end this paper by
showing how to use the proposed framework in practice in the example of
constrained connectivity; in particular it allows to compute such a hierarchy
following a classical watershed-based morphological scheme, which provides an
efficient algorithm to compute the whole hierarchy.Comment: 19 pages, double-colum
New characterizations of minimum spanning trees and of saliency maps based on quasi-flat zones
We study three representations of hierarchies of partitions: dendrograms
(direct representations), saliency maps, and minimum spanning trees. We provide
a new bijection between saliency maps and hierarchies based on quasi-flat zones
as used in image processing and characterize saliency maps and minimum spanning
trees as solutions to constrained minimization problems where the constraint is
quasi-flat zones preservation. In practice, these results form a toolkit for
new hierarchical methods where one can choose the most convenient
representation. They also invite us to process non-image data with
morphological hierarchies
A uniqueness property of perfect fusion grids
electronic version (6 pp.)International audienc
Writing Reusable Digital Geometry Algorithms in a Generic Image Processing Framework
Digital Geometry software should reflect the generality of the underlying
mathe- matics: mapping the latter to the former requires genericity. By
designing generic solutions, one can effectively reuse digital geometry data
structures and algorithms. We propose an image processing framework focused on
the Generic Programming paradigm in which an algorithm on the paper can be
turned into a single code, written once and usable with various input types.
This approach enables users to design and implement new methods at a lower
cost, try cross-domain experiments and help generalize resultsComment: Workshop on Applications of Discrete Geometry and Mathematical
Morphology, Istanb : France (2010
Dimensional operators for mathematical morphology on simplicial complexes
International audienceIn this work we study the framework of mathematical morphology on simplicial complex spaces. Simplicial complexes are widely used to represent multidimensional data, such as meshes, that are two dimensional complexes, or graphs, that can be interpreted as one dimensional complexes. Mathematical morphology is one of the most powerful frameworks for image processing, including the processing of digital structures, and is heavily used for many applications. However, mathematical morphology operators on simplicial complex spaces is not a concept fully developed in the literature. Specifically, we explore properties of the dimensional operators, small, versatile operators that can be used to define new operators on simplicial complexes, while maintaining properties from mathematical morphology. These operators can also be used to recover many morphological operators from the literature. Matlab code and additional material, including the proofs of the original properties, are freely available at~\url{https://code.google.com/p/math-morpho-simplicial-complexes.
Weighted fusion graphs: merging properties and watersheds
International audienc
Parallelization Strategy for Elementary Morphological Operators on Graphs
International audienceThis article focuses on the graph-based mathematical morphology operators presented in [J. Cousty et al, Morphological ltering on graphs, CVIU 2013]. These operators depend on a size parameter that species the number of iterations of elementary dilations/erosions. Thus, the associated running times increase with the size parameter. In this article, we present distance maps that allow us to recover (by thresh-olding) all considered dilations and erosions. The algorithms based on distance maps allow the operators to be computed with a single linear-time iteration, without any dependence to the size parameter. Then, we investigate a parallelization strategy to compute these distance maps. The idea is to build iteratively the successive level-sets of the distance maps, each level set being traversed in parallel. Under some reasonable assumptions about the graph and sets to be dilated, our parallel algorithm runs in O(n/p + K log 2 p) where n, p, and K are the size of the graph, the number of available processors, and the number of distinct level-sets of the distance map, respectively
- âŠ