Skip to main content

Part of the book series: NATO ASI Series ((NATO ASI F,volume 30))

Abstract

This paper attempts to provide a theoretical basis for probabilistic relaxation. First the problem of a formal specification is addressed. An approach to determining support functions is developed based on a formula for combining contextual evidence derived in the paper. A method of developing relaxation labelling schemes using these support functions is briefly described.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Rosenfeld, A., R.A. Hummel and S.W. Zucker, “Scene labeling by relaxation operations,”IEEE SMC, SMC-6, pp. 420–433, 1976.

    Google Scholar 

  2. Waltz, D.L., “Understanding line drawings of scenes with shadows” in The Psychology of Computer Vision, ed. P.H. Winston, McGraw-Hill, New York, 1975.

    Google Scholar 

  3. Kittler, J. and J. Hlingworth, “A review of relaxation labelling algorithms,” Image and Vision Computing, 3, pp. 206–216, 1985.

    Article  Google Scholar 

  4. []Kittler, J., “Compatibility and support functions in probabilistic relaxation,” Proc. 8th ICPR, Paris, xxx 1986.

    Google Scholar 

  5. Haralick, R.M., “An interpretation for probabilistic relaxation,” CGVIP, 22, pp. 388–395, 1983.

    Google Scholar 

  6. Peleg, S., “A new probabilistic relaxation scheme,” IEEE PAMI, PAMI-2, pp. 362–369, 1980.

    Google Scholar 

  7. Kittler, J. and J. Föglein, “On compatibility and support functions in probabilistic relaxation,” CVGIP, 1986.

    Google Scholar 

  8. Kirby, R.L., “A product rule relaxation method,” CGIP, 13, pp. 158–189, 1980.

    Google Scholar 

  9. Zucker, S.W. and J.L. Mohammed, “Analysis of probabilistic labeling processes,” Proc. IEEE PRIP Conf, Chicago, pp. 307–312, 1978.

    Google Scholar 

  10. Brayer, J.M., P.H. Swain and K.S. Fu, “Modelling of earth resources satellite data,” in Applications of Syntactic Pattern Recognition, K.S. Fu, ed., New York, Springer, 1982.

    Google Scholar 

  11. Kittler, J. and J. Föglein, “Contextual classification of multispectral pixel data,” Image and Vision Computing, 2, pp. 13–29, 1984.

    Article  Google Scholar 

  12. Faugeras, O.D. and M. Berthod, “Improving consistency and reducing ambiguity in stochastic labeling: an optimization approach,” IEEE PA MI, PAMI—3, pp. 412–424, 1981.

    Google Scholar 

  13. Hummel, R.A. and S.W. Zucker, “On the foundations of relaxation labeling processes,” IEEE PAMI, PAMI-5, pp. 267–287, 1983.

    Google Scholar 

  14. Illingworth, J. and J. Kittler, “Optimisation algorithms in probabilistic relaxation labelling” (in this volume).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kittler, J. (1987). Relaxation Labelling. In: Devijver, P.A., Kittler, J. (eds) Pattern Recognition Theory and Applications. NATO ASI Series, vol 30. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83069-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-83069-3_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-83071-6

  • Online ISBN: 978-3-642-83069-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics