Graphs and algorithms
Theoretical Aspects of Gray-Level Morphology
IEEE Transactions on Pattern Analysis and Machine Intelligence
Connections for sets and functions
Fundamenta Informaticae - Special issue on mathematical morphology
A Comparison of Algorithms for Connected Set Openings and Closings
IEEE Transactions on Pattern Analysis and Machine Intelligence
Journal of Mathematical Imaging and Vision
Quasi-Linear Algorithms for the Topological Watershed
Journal of Mathematical Imaging and Vision
Watersheds, mosaics, and the emergence paradigm
Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
Antiextensive connected operators for image and sequence processing
IEEE Transactions on Image Processing
Weighted fusion graphs: Merging properties and watersheds
Discrete Applied Mathematics
A New Fuzzy Connectivity Measure for Fuzzy Sets
Journal of Mathematical Imaging and Vision
Mathematical morphology in computer graphics, scientific visualization and visual exploration
ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing
Visualizing high-dimensional structures by dimension ordering and filtering using subspace analysis
EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization
| Hi-index | 0.00 |
We show several properties of the ordered dynamics. In particular, we give necessary and sufficient conditions which indicate when a transformation preserves the dynamics of the regional maxima. We also establish a link between the dynamics, minimum spanning trees, and component trees. At last, we propose a linear time algorithm for computing, given the component tree of a function, the dynamics of all its maxima.