Advances in Constrained Connectivity

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.

[1]  Joachim Weickert,et al.  Scale-Space Theories in Computer Vision , 1999, Lecture Notes in Computer Science.

[2]  Pierre Soille.  On Genuine Connectivity Relations Based on Logical Predicates , 2007, 14th International Conference on Image Analysis and Processing (ICIAP 2007).

[3]  P. Sneath.  The application of computers to taxonomy. , 1957, Journal of general microbiology.

[4]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[5]  Steven W. Zucker,et al.  Region growing: Childhood and adolescence* , 1976 .

[6]  Yll Haxhimusa,et al.  Grouping and segmentation in a hierarchy of graphs , 2004, IS&T/SPIE Electronic Imaging.

[7]  Azriel Rosenfeld,et al.  Fuzzy Digital Topology , 1979, Inf. Control..

[8]  Pierre Soille,et al.  Constrained connectivity for hierarchical image partitioning and simplification , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Pierre Soille,et al.  Adaptive Morphological Filtering Using Similarities Based on Geodesic Time , 2008, DGCI.

[10]  José Crespo,et al.  The flat zone approach: A general low-level region merging segmentation method , 1997, Signal Process..

[11]  Philippe Salembier,et al.  Connected operators and pyramids , 1993, Optics & Photonics.

[12]  Petros Maragos,et al.  Morphological Scale-Space Representation with Levelings , 1999, Scale-Space.

[13]  P. Sneath,et al.  Some thoughts on bacterial classification. , 1957, Journal of general microbiology.

[14]  George L. Nemhauser,et al.  Handbook Of Discrete Optimization , 2005 .

[15]  Andrew Mehnert,et al.  An improved seeded region growing algorithm , 1997, Pattern Recognit. Lett..

[16]  Makoto Nagao,et al.  Region extraction and shape analysis in aerial photographs , 1979 .

[17]  Theodosios Pavlidis,et al.  The editing of picture segmentations using local analysis of graphs , 1977, CACM.

[18]  Xin He,et al.  Parallel algorithms for gray-scale image component labeling on a mesh-connected computer , 1992, SPAA '92.

[19]  Pierre Soille.  On the Morphological Processing of Objects with Varying Local Contrast , 2003, DGCI.

[20]  Pierre Soille,et al.  Beyond self-duality in morphological image analysis , 2005, Image Vis. Comput..

[21]  J. Gower,et al.  Minimum Spanning Trees and Single Linkage Cluster Analysis , 1969 .

[22]  Dorin Comaniciu,et al.  Mean Shift: A Robust Approach Toward Feature Space Analysis , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[23]  A. Schrijver.  On the History of Combinatorial Optimization (Till 1960) , 2005 .

[24]  Claude L. Fennema,et al.  Scene Analysis Using Regions , 1970, Artif. Intell..

[25]  Pierre Soille,et al.  Iterative area filtering of multichannel images , 2007, Image Vis. Comput..

[26]  Rolf Adams,et al.  Seeded Region Growing , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[27]  Hervé Le Men,et al.  The hierarchy of the cocoons of a graph and its application to image segmentation , 2003, Pattern Recognit. Lett..