An optimization approach to unsupervised hierarchical texture segmentation

We introduce a novel optimization framework for hierarchical data clustering and apply it to the problem of unsupervised texture segmentation. The proposed objective function assesses the quality of an image partitioning simultaneously at different resolution levels and yields a sequence of consistently nested image segmentations. A novel model selection criterion to select significant image structures from various scales is proposed. As an efficient deterministic optimization heuristic a mean-field annealing algorithm is derived.

[1]  Joachim M. Buhmann,et al.  Unsupervised segmentation of textured images by pairwise data clustering , 1996, Proceedings of 3rd IEEE International Conference on Image Processing.

[2]  Joachim M. Buhmann,et al.  Deterministic Annealing for Unsupervised Texture Segmentation , 1997, EMMCVPR.

[3]  Wesley E. Snyder,et al.  Mean field annealing: a formalism for constructing GNC-like algorithms , 1992, IEEE Trans. Neural Networks.

[4]  Anil K. Jain,et al.  Unsupervised texture segmentation using Gabor filters , 1990, 1990 IEEE International Conference on Systems, Man, and Cybernetics Conference Proceedings.

[5]  Rose,et al.  Statistical mechanics and phase transitions in clustering. , 1990, Physical review letters.

[6]  Joachim M. Buhmann,et al.  Pairwise Data Clustering by Deterministic Annealing , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Donald Geman,et al.  Boundary Detection by Constrained Optimization , 1990, IEEE Trans. Pattern Anal. Mach. Intell..