A novel graph-theoretic texture segmentation algorithm

A new texture segmentation algorithm is described which is invariant under image spatial rotations and linear gray level transformations. The algorithm exploits the properties of the shortest spanning tree and involves both local and global information. The spanning tree is formed by taking into account the relationship not only between neighboring pixels but also between pixels in the surrounding regions. As a result pixels which are not nearest neighbors can interact during the segmentation process, thus enabling an overall reduction in chaining effects and an improvement in the noise immunity characteristics of the system. Texture segmentation is achieved by optimal partitioning of the spanning tree in a hierarchical way so as to form a spanning forest which conforms to a homogeneity requirement for the regions.< >