Skip to main content

Brightness-contrast diffusion and the grouping of missing angles

  • Edges and Contours
  • Conference paper
  • First Online:
Book cover Computer Analysis of Images and Patterns (CAIP 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 719))

Included in the following conference series:

  • 139 Accesses

Abstract

We present a framework for contour fragment grouping. The contour fragments extracted from an image by an appropriate edge-detection procedure are assumed to be attributed with an estimate of brightness contrast. Based on this brightness contrast along detected contour fragments, we reconstruct a smooth (weak membrane) intensity function under the boundary conditions imposed by the contour fragments. This reconstructed intensity function subsequently serves as a potential field φ in a framework of different possible contour grouping processes. In this paper we treat the general problem of grouping two straight line contour fragments building an arbitrary (missing) angle. We solve the grouping problem in closed form a specific grouping process within the suggested framework.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature

References

  1. K.Ottenberg, A Framework for Contour Grouping via Brightness Contrast Diffusion, submitted to CVGIP:Image Understanding.

    Google Scholar 

  2. A. Blake and A. Zisserman, Visual Reconstruction; The MIT Press, Cambridge, 1987.

    Google Scholar 

  3. D. Terzopoulos, The role of constraints and discontinuities in visible — surface reconstruction, in Proceedings 8th International Joint Conference on Artificial Intelligence, Karlsruhe, Germany, August 1983, pp. 1073–1077.

    Google Scholar 

  4. D. Terzopoulos, Regularization of Inverse Visual Problems Involving Discontinuities, IEEE Transactions on Pattern Analysis and machine Intelligence, 8(4), 1986, pp.413–424.

    Google Scholar 

  5. D. Terzopoulos, The Computation of Visible Surface Representations, IEEE Transactions on Pattern Analysis and machine Intelligence, 10(4), 1988, pp.417–438.

    Google Scholar 

  6. D. Geiger and F. Girosi, Parallel and Deterministic Algorithms for MRFs: Surface Reconstruction, IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(5), 1991, pp. 401–412.

    Google Scholar 

  7. N. Nordstroem, Biased Anisotropic Diffusion — A Unified Regularization and Diffusion Approach to Edge Detection, Image and Vision Computing, 8(4), 1990, pp.318–327.

    Google Scholar 

  8. D. Geiger and A. Yuille, A Common Framework for Image Segmentation, International Journal of Computer Vision, 6(3), 1991, pp. 227–243.

    Google Scholar 

  9. C. Caratheodory, Conformal Representation, Cambridge, 1932.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Dmitry Chetverikov Walter G. Kropatsch

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ottenberg, K. (1993). Brightness-contrast diffusion and the grouping of missing angles. In: Chetverikov, D., Kropatsch, W.G. (eds) Computer Analysis of Images and Patterns. CAIP 1993. Lecture Notes in Computer Science, vol 719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57233-3_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-57233-3_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57233-6

  • Online ISBN: 978-3-540-47980-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics