This Article 
 Bibliographic References 
 Add to: 
Unsupervised Texture Segmentation in a Deterministic Annealing Framework
August 1998 (vol. 20 no. 8)
pp. 803-818

Abstract—We present a novel optimization framework for unsupervised texture segmentation that relies on statistical tests as a measure of homogeneity. Texture segmentation is formulated as a data clustering problem based on sparse proximity data. Dissimilarities of pairs of textured regions are computed from a multiscale Gabor filter image representation. We discuss and compare a class of clustering objective functions which is systematically derived from invariance principles. As a general optimization framework, we propose deterministic annealing based on a mean-field approximation. The canonical way to derive clustering algorithms within this framework as well as an efficient implementation of mean-field annealing and the closely related Gibbs sampler are presented. We apply both annealing variants to Brodatz-like microtexture mixtures and real-word images.

[1] A. Jain and F. Farrokhnia, "Unsupervised Texture Segmentation Using Gabor Filters," Pattern Recognition, vol. 24, no. 12, pp. 1,167-1,186, 1991.
[2] J. Mao and A. Jain, "Texture Classification and Segmentation Using Multiresolution Simultaneous Autoregressive Models," Pattern Recognition, vol. 25, pp. 173-188, 1992.
[3] D. Geman,S. Geman,C. Graffigne,, and P. Dong,“Boundary detection by constrained optimization,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 7, pp. 609-628, July 1990.
[4] T. Ojala, M. Pietikäinen, and D. Harwood, "A Comparative Study of Texture Measures With Classification Based Feature Distributions," Pattern Recognition, vol. 29, no. 1, pp. 51-59, 1996.
[5] J. Shi and J. Malik, “Normalized Cuts and Image Segmenation,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 731-737, June 1997.
[6] J. MacQueen, "Some Methods for Classification and Analysis of Multivariate Observations," Proc. Fifth Berkeley Symp. Mathematical Statistics and Probability, pp. 281-297, 1967.
[7] C. Peterson and B. Söderberg, "A New Method for Mapping Optimisation Problems Onto Neural Networks," Int'l J. Neural Systems, vol. 1, no. 1, pp. 3-22, 1989.
[8] D.E. Van Den Bout and T.K. Miller, III,“Graph partitioning using annealed neural network,” IEEE Trans. on Neural Networks, vol. 1, no. 2, June 1990.
[9] A. Yuille, "Generalized Deformable Models, Statistical Physics, and Matching Problems," Neural Computation, vol. 2, pp. 1-24, 1990.
[10] S. Gold and A. Rangarajan, “A Graduated Assignment Algorithm for Graph Matching,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 4, pp. 377-388, Apr. 1996.
[11] K. Rose, E. Gurewitz, and G. Fox, "Vector Quantization by Deterministic Annealing," IEEE Trans Information Theory, vol. 38, no. 4, pp. 1249-1257, 1992.
[12] J.M. Buhmann and H. Kühnel, "Vector Quantization with Complexity Costs," IEEE Trans Information Theory, vol. 39, pp. 1,133-1,145, July 1993.
[13] D. Geiger and F. Girosi,“Parallel and deterministic algorithms from MRFs: Surface reconstruction,” IEEE Transactions on PAMI, vol. 13, no. 5, pp. 401-412, May 1991.
[14] G.L. Bilbro, W.E. Snyder, S.J. Garnier, and J.W. Gault, "Mean Field Annealing: A Formalism for Constructing GNC-Like Algorithms," IEEE Trans. Neural Networks, vol. 3, Jan. 1992.
[15] J. Zhang,“The mean field theory in EM procedures for blind Markov random field image restoration,” IEEE Transactions on Image Proc., vol. 2, no. 1, pp. 27-40, Jan. 1993.
[16] J. Zerubia and R. Chellappa, "Mean Field Annealing Using Compound Gauss-Markov Random Fields for Edge Detection and Image Estimation," IEEE Trans. Neural Networks, vol. 4, no. 4, pp. 703-709, 1993.
[17] T. Hofmann and M. Buhmann, Pairwise Data Clustering by Deterministic Annealing IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 1, pp. 1-14, Jan. 1997.
[18] C. Peterson and J. Anderson, "A Mean Field Theory Learning Algorithm for Neural Networks," Complex Systems, vol. 1, pp. 995-1,019, 1987.
[19] D. Geiger and F. Girosi, "Coupled Markov Random Fields and Mean Field Theory," Advances in Neural Information Processing Systems 2, pp. 660-667, 1990.
[20] G. Bilbro and W. Snyder, "Mean Field Approximation Minimizes Relative Entropy," J. Optical Soc. Am., vol. 8, no. 2, 1989.
[21] J. Zhang, "The Application of the Gibbs-Bogoliubov-Feynman Inequality in Mean-Field Calculations for Markov Random Fields," IEEE Trans. Image Processing, vol. 5, no. 7, pp. 1,208-1,214, 1996.
[22] S. Geman and D. Geman, "Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, no. 6, pp. 721-741, Nov. 1984.
[23] H. Romeny, ed., Geometry-Driven Diffusion in Computer Vision. Kluwer Academic Publishers, 1994.
[24] L. Florack, B.t. Haar Romeny, J. Koenderink, and M. Viergever, "Families of Tuned Scale-Space Kernels," G. Sandini, ed., Proc. Second European Conf. Computer Vision, pp. 19-23.Berlin: Springer-Verlag, 1992.
[25] J. Daugman, "Uncertainty Relation for Resolution in Space, Spatial Frequency, and Orientation Optimized by Two-Dimensional Visual Cortical Filters," J. Optical Soc. Am. A, vol. 2, no. 7, pp. 1,160-1,169, 1985.
[26] A.C. Bovik,M. Clark,, and W.S. Geisler,“Multichannel texture analysis using localized spatial filters,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, pp. 55-73, 1990.
[27] I. Fogel and D. Sagi, "Gabor Filters as Texture Discriminators," Biological Cybernetics, vol. 61, pp. 103-113, 1989.
[28] B.W. Lindgren, Statistical Theory, 3rd ed.New York: Macmillan Publishing, 1976.
[29] T. Hofmann, J. Puzicha, and J.M. Buhmann, "Unsupervised Segmentation of Textured Images by Pairwise Data Clustering," Proc. Int'l Conf. Image Processing Lausanne, 1996.
[30] T. Hofmann, J. Puzicha, and J. Buhmann, "A Deterministic Annealing Framework for Unsupervised Texture Segmentation," Technical Report IAI-TR-96-2, Institut für Informatik III, 1996.
[31] J. Puzicha, T. Hoffman, and J.M. Buhmann, “Non-Parametric Similarity Measures for Unsupervised Texture Segmentation and Image Retrieval,” Proc. Computer Vision and Pattern Recognition, 1997.
[32] T.-S. Lee, D. Mumford, and A. Yuille, "Texture Segmentation by Minimizing Vector-Valued Energy-Functionals: The Coupled Membrane Model," Proc. Second European Conf. Computer Vision, G. Sandini, ed., pp. 165-183, 1992.
[33] S. Kirkpatrick, C. Gelatt, and M. Vecchi, "Optimization by Simulated Annealing," Science, vol. 220, no. 4,598, pp. 671-680, 1983.
[34] V. Cerny, "Thermodynamical Approach to the Travelling Salesman Problem," J. Optimization Theory and Applications, vol. 45, pp. 41-51, 1985.
[35] E. Jaynes, "Information Theory and Statistical Mechanics," Physical Rev., vol. 106, no. 4, pp. 620-630, 1957.
[36] J. Besag, "On the Statistical Analysis of Dirty Pictures," J. Royal Statistical Soc., Series B, vol. 48, pp. 25-37, 1986.
[37] B. Hajek, "Cooling Schedules for Optimal Annealing," Mathematics of Operation Research, vol. 13, pp. 311-324, 1988.
[38] J. Puzicha, T. Hofmann, and J. Buhmann, "Deterministic Annealing: Fast Physical Heuristics for Real Time Optimization of Large Systems," Proc. 15th IMACS World Congress on Scientific Computation, Modelling and Applied Mathematics, 1997.
[39] J. Hopfield and D. Tank, "Neural Computation of Decisions in Optimisation Problems," Biological Cybernetics, vol. 52, pp. 141-152, 1985.
[40] J. Zhang, "The Convergence of Mean Field Procedures for MRF's," IEEE Trans. Image Processing, vol. 5, no. 12, pp. 1,662-1,665, 1991.
[41] P. Brodatz, Textures: A Photographic Album for Artists and Designers.New York: Dover Publications, 1966.
[42] B.S. Manjunath and W.Y. Ma, “Texture Features for Browsing and Retrieval of Image Data,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 8, pp. 837-842, Aug. 1996
[43] R. Navarro, O. Nestares, J. Portilla, and A. Tabernero, "Several Experiments on Texture Analysis, Coding and Synthesis by Gabor Wavelets," Tech. Rep. 52, Instituto de Optica Daza de Valdes de Madrid, 1994.
[44] T. Hofmann, J. Puzicha, and J. Buhmann, "An Optimization Approach to Unsupervised Hierarchical Texture Segmentation," Proc. IEEE Int'l Conf. Image Processing, pp. 213-217, 1997.
[45] J. Puzicha and J. Buhmann, "Multiscale Annealing for Real-Time Unsupervised Texture Segmentation," Technical Report IAI-97-4, Institut für Informatik III (a short version appeared in Proc. ICCV '98, pp. 267-273), 1997.
[46] J. Buhmann, W. Burgard, A. Cremers, D. Fox, T. Hofmann, F. Schneider, I. Strikos, and S. Thrun, "The Mobile Robot RHINO," AI Magazine, vol. 16, no. 1, 1995.

Index Terms:
Image segmentation, pairwise clustering, deterministic annealing, EM algorithm, Gabor filters.
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann, "Unsupervised Texture Segmentation in a Deterministic Annealing Framework," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 20, no. 8, pp. 803-818, Aug. 1998, doi:10.1109/34.709593
Usage of this product signifies your acceptance of the Terms of Use.