Blind texture segmentation

The technique presented solves the problem of texture segmentation in two steps. In the first, a textured image is divided into small squares (20*20 in this case) and a hierarchical clustering algorithm related to a choice of ultrametric distances is used to obtain an initial segmentation. In the second step, the texture boundaries are improved using a recursive procedure with vertical and horizontal segments of smaller and smaller size, converging towards the correct texture boundaries.<<ETX>>

[1]  Songde Ma,et al.  Sequential synthesis of natural textures , 1985, Comput. Vis. Graph. Image Process..

[2]  David B. Cooper,et al.  Simple Parallel Hierarchical and Relaxation Algorithms for Segmenting Noncausal Markovian Random Fields , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  André Gagalowicz,et al.  A New Method for Texture Fields Synthesis: Some Applications to the Study of Human Vision , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Haluk Derin,et al.  Modeling and Segmentation of Noisy and Textured Images Using Gibbs Random Fields , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Songde Ma,et al.  Model driven synthesis of natural textures for 3-D scenes , 1986, Comput. Graph..

[6]  Charles W. Therrien,et al.  An estimation-theoretic approach to terrain image segmentation , 1983, Comput. Vis. Graph. Image Process..

[7]  David B. Cooper,et al.  Bayesian Clustering for Unsupervised Estimation of Surface and Texture Models , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Patrick C. Chen,et al.  Image segmentation as an estimation problem , 1979, 1979 18th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.