ISMM
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We study hierachical segmentation in the framework of edgeweighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that t...
ISMM
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We present a programming framework for discrete mathematical morphology centered on the concept of genericity. We show that formal definitions of morphological algorithm...
ISMM
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We present an efficient implementation of the ultimate attribute opening operator. In this implementation, the ultimate opening is computed by processing the image maxtre...
ISMM
2009
Springer
14 years 5 months ago
2009
Springer
In order to describe anisotropy in image processing models or physical measurements, matrix fields are a suitable choice. In diffusion tensor magnetic resonance imaging (DT-MRI),...
ISMM
2009
Springer
14 years 5 months ago
2009
Springer
The aim of this paper is to propose efficient tools for analysing shape families using morphological operators. The developments include the definition of shape statistics (mean a...
ISMM
2009
Springer
14 years 5 months ago
2009
Springer
In this paper, a method for morphological segmentation using shape information is presented. This method is based on a morphological operator named ultimate attribute opening (UAO)...
ISMM
2009
Springer
14 years 5 months ago
2009
Springer
Applying computer technology, such as computer vision in driver assistance, implies that processes and data are modeled as being discretized rather than being continuous. The area ...
ISMM
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. This paper deals with the theory and applications of spatially-variant mathematical morphology. We formalize the definition of spatially variant dilation/erosion and ope...
ISMM
2009
Springer
14 years 5 months ago
2009
Springer
We study some basic morphological operators acting on the lattice of all subgraphs of a (non-weighted) graph G. To this end, we consider two dual adjunctions between the edge set a...