This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Morphologically Constrained GRFs: Applications to Texture Synthesis and Analysis
February 1999 (vol. 21 no. 2)
pp. 99-113

Abstract—A new class of Gibbs random fields (GRFs) is proposed capable of modeling geometrical constraints in images by means of mathematical morphology. The proposed models, known as morphologically constrained GRFs, model images by means of their size density. Since the size density is a multiresolution statistical summary, morphologically constrained GRFs explicitly incorporate multiresolution information into image modeling. Important properties are studied and their implication to texture synthesis and analysis is discussed. For morphologically constrained GRFs to be useful in practice, it is important that an efficient technique is available for fitting these models to real data. It is shown that, at low enough temperatures and under a natural condition, the maximum-likelihood estimator of the morphologically constrained GRF parameters can be approximated by means of an important tool of mathematical morphology known as the pattern spectrum. Therefore, statistical inference can be easily implemented by means of mathematical morphology. This allows the design of a computationally simple morphological Bayes classifier which produces excellent results in classifying natural textures.

[1] S. Geman and D. Geman, "Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, pp. 721-741, 1984.
[2] D. Geman and G. Reynolds, "Constrained Restoration and the Recovery of Discontinuities," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, pp. 367-383, 1992.
[3] I.M. Elfadel and R.W. Picard, "Gibbs Random Fields, Cooccurrences, and Texture Modeling," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, pp. 24-37, 1994.
[4] U. Grenander and M.I. Miller, "Representations of Knowledge in Complex Systems (With Discussion)," J. Royal Statistical Society, Series B, vol. 56, pp. 549-603, 1994.
[5] E. Levitan, M. Chan, and G.T. Herman, "Image-Modeling Gibbs Priors," Graphical Models and Image Processing, vol. 57, pp. 117-130, 1995.
[6] S.C. Zhu, Y. Wu, and D. Mumford, “Filters Random Fields and Maximum Entropy(Frame)—Towards a Unified Theory for Texture Modeling,” Int'l J. Computer Vision, vol. 27, no. 2, pp. 107-126, 1998.
[7] G. Matheron, Random Sets and Integral Geometry.New York: John Wiley, 1975.
[8] J. Serra, Image Analysis and Mathematical Morphology.New York: Academic Press, 1982.
[9] H.J.A.M. Heijmans, Morphological Image Operators.New York: Academic Press, 1994.
[10] D. Schonfeld and J. Goutsias, "Optimal Morphological Pattern Restoration From Noisy Binary Images," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 1, pp. 14-29, Jan. 1991.
[11] F. Chen and P.A. Kelly, "Algorithms for Generating and Segmenting Morphologically Smooth Binary Images," Proc. 26th Conf. Information Sciences and Systems, pp. 902-906,Princeton, N.J., 1992.
[12] F. Chen, "Robust and Morphologically Constrained Image Segmentation," PhD thesis, Department of Electrical and Computer Engineering, Univ. of Massachusetts at Amherst, 1994.
[13] B. Luo, A.D.J. Cross, and E.R. Hancock, Corner Detection via Topographic Analysis of Vector-Potential Pattern Recognition Letters, pp. 635-650, 1999.
[14] F. Chen and P.A. Kelly, "Robust and Morphological Processing for Small Object Detection," Proc. 28th Conf. Information Sciences and Systems, vol. 1, pp. 72-77,Princeton, N.J., 1994.
[15] P. Maragos, "Pattern Spectrum and Multiscale Shape Representation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, pp. 701-716, 1989.
[16] P. Delfiner, "A Generalization of the Concept of Size," J. Microscopy, vol. 95, pp. 203-216, 1971.
[17] K. Sivakumar and J. Goutsias, "Discrete Morphological Size Distributions and Densities: Estimation Techniques and Applications," J. Electronic Imaging, vol. 6, pp. 31-53, 1997.
[18] K. Sivakumar, "Morphological Analysis of Random Fields: Theory and Applications," PhD thesis, Department of Electrical and Computer Engineering, The Johns Hopkins Univ., 1997.
[19] G.R. Cross and A.K. Jain, "Markov Random Field Texture Models," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 5, pp. 25-39, 1983.
[20] K. Sivakumar and J. Goutsias, "Morphologically Constrained Discrete Random Sets," D. Jeulin, ed., Advances in Theory and Applications of Random Sets, pp. 49-66.Singapore: World Scientific, 1997.
[21] C.J. Geyer, "Practical Markov Chain Monte Carlo (With Discussion)," Statistical Science, vol. 7, pp. 473-511, 1992.
[22] B. Gidas, "Metropolis-Type Monte Carlo Simulation Algorithms and Simulated Annealing," J.L. Snell, ed., Topics in Contemporary Probability and Its Applications, pp. 159-232.Boca Raton, Fla.: CRC Press, 1995.
[23] J. Goutsias and D. Schonfeld, "Morphological Representation of Discrete and Binary Images," IEEE Trans. Signal Processing, vol. 39, pp. 1,369-1,379, 1991.
[24] Z. Zhou and A.N. Venetsanopoulos, "Analysis and Implementation of Morphological Skeleton Transforms," Circuits, Systems and Signal Processing, vol. 11, pp. 253-280, 1992.
[25] 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.
[26] B. Gidas, "Parameter Estimation for Gibbs Distributions From Fully Observed Data," R. Chellappa and A. Jain, eds., Markov Random Fields: Theory and Applications, pp. 471-498.New York: Academic Press, 1993.
[27] R.S. Ellis, Entropy, Large Deviations, and Statistical Mechanics.New York: Springer-Verlag, 1985.
[28] P.J. Bickel and K.A. Doksum, Mathematical Statistics.Oakland, Calif.: Holden-Day, 1977.
[29] C.J. Geyer and E.A. Thompson, "Constrained Monte Carlo Maximum Likelihood for Dependent Data (With Discussion)," J. Royal Statistical Society, Series B, vol. 54, pp. 657-699, 1992.
[30] C.J. Geyer, "On the Convergence of Monte Carlo Maximum Likelihood Calculations," J. Royal Statistical Society, Series B, vol. 56, pp. 261-274, 1994.
[31] R.L. Kashyap, R. Chellappa, and A. Khotanzad, "Texture Classification Using Features Derived From Random Field Models," Pattern Recognition Letters, vol. 1, pp. 43-50, 1982.
[32] R. Chellappa and S. Chatterjee, "Classification of Textures Using Gaussian Markov Random Fields," IEEE Trans. Acoustics, Speech, and Signal Processing, vol. 33, pp. 959-963, 1985.
[33] P. Brodatz, Textures: A Photographic Album for Artists and Designers.New York: Dover, 1966.
[34] E.R. Dougherty, J.T. Newell, and J.B. Pelz, "Morphological Texture-Based Maximum-Likelihood Pixel Classification Based on Local Granulometric Moments," Pattern Recognition, vol. 25, pp. 1,181-1,198, 1992.
[35] Y. Chen and E.R. Dougherty, "Gray-Scale Morphological Granulometric Texture Classification," Optical Engineering, vol. 33, pp. 2,713-2,722, 1994.
[36] K. Sivakumar and J. Goutsias, "MAP Estimation of a Class of Morphologically Constrained Gibbs Random Fields," Proc. IEEE Int'l Conf. Image Processing,Chicago, 1998.
[37] M.N.M. van Lieshout, "Size Distributions in Stochastic Geometry," Tech. Rep. PNA-R9715, CWI, Amsterdam, The Netherlands, 1997.
[38] M.N.M. van Lieshout, "Size-Based Random Closed Sets," H.J.A.M. Heijmans and J.B.T.M. Roerdink, eds., Mathematical Morphology and Its Applications to Image Processing, pp. 291-298.Dordrecht, The Netherlands: Kluwer, 1998.

Index Terms:
Gibbs random fields, mathematical morphology, Metropolis algorithm, Monte Carlo simulation, morphological constraints, size density, statistical inference, texture synthesis and analysis.
Citation:
Krishnamoorthy Sivakumar, John Goutsias, "Morphologically Constrained GRFs: Applications to Texture Synthesis and Analysis," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 21, no. 2, pp. 99-113, Feb. 1999, doi:10.1109/34.748817
Usage of this product signifies your acceptance of the Terms of Use.