A topological characterization of thinning
Theoretical Computer Science
Watershed of a continuous function
Signal Processing - Special issue on mathematical morphology and its applications to signal processing
Geodesic Saliency of Watershed Contours and Hierarchical Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Set-Theoretical Algebraic Approaches to Connectivityin Continuous or Digital Spaces
Journal of Mathematical Imaging and Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Lattice Approach to Image Segmentation
Journal of Mathematical Imaging and Vision
International Journal of Computer Vision
Constrained Connectivity for Hierarchical Image Decomposition and Simplification
IEEE Transactions on Pattern Analysis and Machine Intelligence
Partial Partitions, Partial Connections and Connective Segmentation
Journal of Mathematical Imaging and Vision
Adjunctions on the lattices of partitions and of partial partitions
Applicable Algebra in Engineering, Communication and Computing
On the Equivalence Between Hierarchical Segmentations and Ultrametric Watersheds
Journal of Mathematical Imaging and Vision
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing
Orders on partial partitions and maximal partitioning of sets
ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing
Antiextensive connected operators for image and sequence processing
IEEE Transactions on Image Processing
Building the Component Tree in Quasi-Linear Time
IEEE Transactions on Image Processing
Hi-index | 0.00 |
The refinement order on partitions corresponds to the operation of merging blocks in a partition, which is relevant to image segmentation and filtering methods. Its mathematical extension to partial partitions, that we call standard order, involves several operations, not only merging, but also creating new blocks or inflating existing ones, which are equally relevant to image segmentation and filtering techniques. These three operations correspond to three basic partial orders on partial partitions, the merging, inclusion and inflating orders. There are three possible combinations of these three basic orders, one of them is the standard order, the other two are the merging-inflating and inclusion-inflating orders. We study these orders in detail, giving in particular their minimal and maximal elements, covering relations and height functions. We interpret hierarchies of partitions and partial partitions in terms of an adjunction between (partial) partitions (possibly with connected blocks) and scalars. This gives a lattice-theoretical interpretation of edge saliency, hence a typology for the edges in partial partitions. The use of hierarchies in image filtering, in particular with component trees, is also discussed. Finally, we briefly mention further orders on partial partitions that can be useful for image segmentation.