Edge Detection and Segmentation of Textured Plane Images

  • R. Azencott
  • C. Graffrigne
  • C. Labourdette
Conference paper
Part of the Lecture Notes in Statistics book series (LNS, volume 74)


We use a Markov framework for finding edges and for partitioning scenes into homogeneous regions. The images are airplane images with a fine resolution. They have been chosen according to the presence of textures, some of these textures being macro-textures. We are working in a supervised context, and we assume the existence of samples for each of the textures.

Segmenting these textures, and due to their resolution, the problem of edge detection proves to be very important. The definition of edges between textures may not always be straightforward since these edges are sometimes materialized by fences, or roads, but some other times, they are only implicit. We use a statistical definition of the edges, and then, after positioning them, we extract informations for the segmentation. The use of these informations improves greatly the results.

At the same time, one of our main purpose is to keep the computation time within reasonable bounds. This was done by selecting carefully the model energy.


Simulated Annealing Energy Function Edge Detection Pattern Anal Markov Random Field 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R. Azencott, “Markov random fields and image analysis,” Proceedings of AFCET, Antices, France, 1987.Google Scholar
  2. [2]
    J. Besag, “On the statistical analysis of dirty pictures, ” J. Roy. Statist. Soc., series B, vol. 48, pp. 259–302, 1986.MathSciNetMATHGoogle Scholar
  3. [3]
    F. S. Cohen and D. B. Cooper, “Simple parallel hierarchical and relaxation algorithms for segmenting noncausal Markovien random fields,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-9, pp. 195–219, 1987.CrossRefGoogle Scholar
  4. [4]
    D. B. Cooper and F. P. Sung, “Multiple-window parallel adaptative boundary finding in computer vision,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-5, pp. 299–316, 1983.CrossRefGoogle Scholar
  5. [5]
    R. W. Conners, M. M. Trivedi and C. A. Harlow, “Segmentation of a high-resolution urban scene using texture operators,” Computer Vision, Graphics and Image Proc. 25, pp. 273–310, 1984.CrossRefGoogle Scholar
  6. [6]
    H. Derin and H. Elliott, “Modeling and segmentation of noisy and textured images using Gibbs random fields,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-9, pp. 39–55, 1987.CrossRefGoogle Scholar
  7. [7]
    A. Gagalowicz and C. Graffigne, “Blind texture segmentation,” Proceedings of the 9th International Conference on Pattern Recognition, Rome, Italy, 1988.Google Scholar
  8. [8]
    S. Geman and D. Geman, “Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images,” IEEE Trans. on Pattern Anal. Machine Intell., vol. PAMI-6, no 6 November 1984.Google Scholar
  9. [9]
    S. Geman, D. Geman and C. Graffigne, “Locating texture and object boundaries,” Pattern Recognition Theory and Applications, P. A. Devijver and J. Kittler, Eds. Heidelberg, Springer-Verlag, 1987.Google Scholar
  10. [10]
    S. Geman, D. Geman, C. Graffigne and P. Dong, “Boundary detection by constrained optimization,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-12, pp. 609–628, 1990.Google Scholar
  11. [11]
    S. Geman and C. Graffigne, “Markov random field image models and their applications to computer vision,” in Proc. Int. Congr. Mathematicians, 1986, A. M. Gleason, Ed. Amer. Math. Soc., Providence, RI, 1987.Google Scholar
  12. [12]
    C. Graffigne, “Application des statistiques au traitement d’images,” These de troisième cycle, Université Paris-Sud, France, 1986.Google Scholar
  13. [13]
    C. Graffigne, “Experiments in texture analysis and segmentation,” Ph.D. dissertation, Division of Applied Mathematics, Brown Univ., 1987.Google Scholar
  14. [14]
    U. Grenander, “Tutorial in pattern theory,” Division Applied Mathematics, Brown Univ., Lecture Notes, 1984.Google Scholar
  15. [15]
    R. M. Haralick, K. Shanmugam and I. Denstein, “Textural features for image classification,” IEEE Trans. Syst., Man, Cybern., vol. 6, pp. 610–621, 1973.CrossRefGoogle Scholar
  16. [16]
    R. L. Kashyap and K. Eom, “Texture boundary detection based on the long correlation model,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-2, pp. 58–67, 1989.CrossRefGoogle Scholar
  17. [17]
    N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller and E. Teller, “Equations of state calculations by fast computing machines,” J. Chem. Phys., vol. 21, pp. 1087–1091, 1953.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • R. Azencott
    • 1
  • C. Graffrigne
    • 1
  • C. Labourdette
    • 1
  1. 1.Laboratoire de Statistiques AppliquéesUniversité Paris-SudOrsay CedexFrance

Personalised recommendations