Constrained Connectivity for Hierarchical Image Decomposition and Simplification.

Pierre Soille

Abstract: This paper introduces an image partitioning and simplification method based on the constrained connectivity paradigm. According to this paradigm, two pixels are said to be connected if they satisfy a series of constraints defined in terms of simple measures such as the maximum gray-level differences over well-defined pixel paths and regions. The resulting connectivity relation generates a unique partition of the image definition domain. The simplification of the image is then achieved by setting each segment of the partition to the mean value of the pixels falling within this segment. Fine to coarse partition hierarchies (and, therefore, images of increasing degree of simplification) are produced by varying the threshold value associated with each connectivity constraint. The paper also includes a generalization to multichannel images, application examples, a review of related image segmentation techniques, and pseudocode for an implementation based on queue and stack data structures.