Skip to main content

Relaxation and Optimization for Stochastic Labelings

  • Conference paper
Digital Image Processing

Part of the book series: NATO Advanced Study Institutes Series ((ASIC,volume 77))

  • 269 Accesses

Abstract

This paper contains a survey of a new family of parallel iterative algorithms that allow for using context to improve the results obtained in separately classifying the units of a global set. The essential characteristic of these methods is that they transform the general exponential context problem in a tractable polynomial one, by looking for a continuous (stochastic) labeling rather than a discrete one.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berthod, M., and Faugeras, O.D.: Using context in the global recognition of a set of objects: an optimization approach. Proc. of IFIP Congress, Tokyo, pp. 695–698, 1980.

    Google Scholar 

  2. Berthod, M., and Faugeras, O.D.: Etiquetage par optimisation et application. 2ème congrès A.F.C.E.T.-IRIA de Reconnaissance des Formes et Intelligence Artificielle. Toulouse, pp. 267–275, Septembre 1979.

    Google Scholar 

  3. Davis, L., and Rosenfeld, A.: Applications of relaxation, 2: spring loaded template matching. Proceedings of the 3rd I.J.C.P.R., San Diego, 1976.

    Google Scholar 

  4. Davis, L., and Rosenfeld, A.: Curve segmentation by relaxation labeling. I.E.E.E. Trans-on Comp. 26, pp. 1053–1057, 1977.

    Article  Google Scholar 

  5. Davis, L., and Rosenfeld, A.: Noise cleaning by iterated local averaging. I.E.E.E. Trans-on S.M.C., 8, pp. 705–710, 1978.

    Google Scholar 

  6. Davis, L., Rosenfeld, A.: Iterative histogram modification. I.E.E.E. Trans-on S.M.C., 8, pp. 300–302, 1978.

    Google Scholar 

  7. Davis, L.: Shape matching using relaxation techniques. I.E.E.E. Trans-on P.A.M.I., Vol. 1, n°1, pp. 60–72, January 1979.

    MATH  Google Scholar 

  8. Eklundh, J.L., Yamamoto, M., Rosenfeld, A.: Relaxation methods in multispectral pixel classification. To be published in I.E.E.E. Trans-on P.A.M.I., 1980

    Google Scholar 

  9. Faugeras, O. and Berthod, M.: Scene labeling: an optimization approach. Proceedings of the I.E.E.E. Conf. on Pattern Recognition and Image. Processing, Chicago, pp. 318–326, 1979.

    Google Scholar 

  10. Faugeras, O.: Decomposition and decentralization techniques in relaxation labeling. To be published in Computer Graphics and Image Processing, 1980.

    Google Scholar 

  11. Faugeras, O., and Berthod, M.: Improving consistency and producing ambiguity in stochastic labeling: an optimization approach. To be published in I.E.E.E. Trans-on P.A.M, I., 1980.

    Google Scholar 

  12. Faugeras, O., and Price, K.: Semantic description of aerial images using stochastic labeling. 5th I.J.C.P.R., Miami, 1980.

    Google Scholar 

  13. Haralick, R.M.: Structural pattern recognition, homomorphonisms and arrangements. Pattern recognition, Vol. 10, pp. 223–236, 1978.

    Article  MathSciNet  MATH  Google Scholar 

  14. Haralick, R., Kartus, J.: Arrangements homomorphisms and discrete relaxation. I.E.E.E. Trans-on S.M.C., 8, pp. 600–612, August 1978.

    MathSciNet  MATH  Google Scholar 

  15. Haralick, R., and Shapiro, L.: The consistent labeling problem: Part I. I.E.E.E. Trans-on P.A.M.I., 1, n°2, pp. 173–183, April 1979.

    MATH  Google Scholar 

  16. Haralick, R., and Shapiro, L.: The consistent labeling problem: Part II. I.E.E.E. Trans-on P.A.M.I., 2, n°3, pp. 193–203, 1979.

    Google Scholar 

  17. Heyes, K.: Reading handwritten words using hierarchical relaxation. T.R. 783, Computer Science Center, Univ. of Maryland, College Park, 1979.

    Google Scholar 

  18. Lev, A., Zucker, S.W., and Rosenfeld, A.: Iterative enhancement of noisy images. I.E.E.E. Trnas-on S.M.C., 7, pp. 435–442, 1977.

    Google Scholar 

  19. Peleg, S.: Iterative histogram modification: 2. I.E.E.E. Trans-on S.M.C., 8, pp. 555–556, 1978.

    Google Scholar 

  20. Peleg, S., and Rosenfeld, A.: Determining compatibility coefficients for curve enhancement relaxation processes. I.E.E.E. Trans-on S.M.C., 8, pp. 548–554, July 1978.

    Google Scholar 

  21. Peleg, S. and Rosenfeld, A.: Breaking substitution ciphers using a relaxation algorithm. TR-271. Comp. Science Center, Univer. of Maryland, College Park, MD, January 1979.

    Google Scholar 

  22. Peleg, S.: A new probabilistic relaxation scheme. Proceedings of the I.E.E.E. Conf. on Pattern Recognition and Image Processing, Chicago, pp. 337–343, 1979.

    Google Scholar 

  23. Rosenfeld, A., Hummel, R., and Zucker, S.: Scene labeling by relaxation operations. I.E.E.E. Trans-on S.M.C.,6, pp. 420–433, 1976.

    MathSciNet  MATH  Google Scholar 

  24. Schachter, B.J., Len, A., Zucker, S.W., and Rosenfeld, A.: An application of relaxation methods to edge reinforcement. I.E.E.E. Trans-on S.M.C., 7, pp. 813–816, 1977.

    Google Scholar 

  25. Toussaint, G.: The use of context in pattern recognition. Invited address, Proceedings of the I.E.E.E. Conf. on Pattern Recognition and Image Processing, Chicago, 1977.

    Google Scholar 

  26. Ullmann, S.: Relaxation and constrained optimization by local processors. Computer Graphics and Image Processing, 10, pp. 115–125, 1979.

    Article  Google Scholar 

  27. Zucker, S., Hummel, R., and Rosenfeld, A.: An application of relaxation to line and curve enhancement. I.E.E.E. Trans-on Computer, c-26, pp. 393–403, 922,929, 1977.

    Google Scholar 

  28. Zucker, S.W., Krishnamurthy, E.V., and Haar, R.: Relaxation Processes for scene labeling: convergence, speed and stability. I.E.E.E. Trans-on S.M.C., 8, pp; 41–48. January 1978.

    MATH  Google Scholar 

  29. Zucker, S.W., Mohammed, J.L.: Analysis of probabilistic relaxation labeling processes. I.E.E.E. Conf. on Image Processing and Pattern Recognition, Chicago, pp. 307–312, 1978.

    Google Scholar 

  30. Zucker, S.W., Leclerc, Y.G., and Mohammed, J.L.: Continuous relaxation and local maximum selection: conditions for equivalence. TR. 78–15 T, Computer Vision and Graphics Laboratory, Mac Gill Univ., Montreal, Canada, 1978.

    Google Scholar 

  31. Zucker, S.W., and Mohammed, J.L.: A hierarchical relaxation system for line labeling and grouping. Proceedings of the I.E.E.E. Conf. on Pattern Recognition and Image Processing, Chicago, pp. 410–415, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1981 D. Reidel Publishing Company

About this paper

Cite this paper

Berthod, M. (1981). Relaxation and Optimization for Stochastic Labelings. In: Simon, J.C., Haralick, R.M. (eds) Digital Image Processing. NATO Advanced Study Institutes Series, vol 77. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-8543-8_15

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-8543-8_15

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-009-8545-2

  • Online ISBN: 978-94-009-8543-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics