Parallel algorithms for gray-scale image component labeling on a mesh-connected computer
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
An improved seeded region growing algorithm
Pattern Recognition Letters
The editing of picture segmentations using local analysis of graphs
Communications of the ACM
Mean Shift: A Robust Approach Toward Feature Space Analysis
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
The hierarchy of the cocoons of a graph and its application to image segmentation
Pattern Recognition Letters - Special issue: Graph-based representations in pattern recognition
Iterative area filtering of multichannel images
Image and Vision Computing
On Genuine Connectivity Relations Based on Logical Predicates
ICIAP '07 Proceedings of the 14th International Conference on Image Analysis and Processing
Constrained Connectivity for Hierarchical Image Decomposition and Simplification
IEEE Transactions on Pattern Analysis and Machine Intelligence
Beyond self-duality in morphological image analysis
Image and Vision Computing
Adaptive morphological filtering using similarities based on geodesic time
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Constrained Connectivity and Transition Regions
ISMM '09 Proceedings of the 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing
Adaptive morphological filtering using similarities based on geodesic time
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
| Hi-index | 0.00 |
The concept of constrained connectivity [Soille 2008, PAMI] is summarised. We then introduce a variety of measurements for characterising connected components generated by constrained connectivity relations. We also propose a weighted mean for estimating a representative value of each connected component. Finally, we define the notion of spurious connected components and investigate a variety of methods for suppressing them.