Skip to main content

Local Operations: Edging

  • Chapter
  • First Online:
Handbook of Image Processing and Computer Vision

Abstract

This chapter describes the boundary extraction algorithms based on local operators in the spatial domain and filtering techniques in the frequency domain. In the early stages of the vision process, some intrinsic characteristics are extracted from the image that are relevant to identify the objects of the scene. These elementary characteristics, called low level, are used by the visual system to isolate the objects of the scene, perceived as relatively homogeneous regions with respect to one or more of the following attributes: gray level (intensity), color, texture, distance, motion, nature of the material, surface condition of objects, etc. In analogy to visual perception, for the artificial system, the acquired image of the scene presents itself groups of regions with abrupt discontinuities evaluated among themselves that can be assessed on the basis of some of the attributes indicated above. In this chapter, we are interested in the analysis and search of image pixels where these discontinuities occur, which are typically associated with the edges of the objects, that is, boundary zones between regions of the image with different attributes, or, more in general, for the discontinuity of reflectance and different illuminations of objects. All these causes make the edge extraction operation not easy, considering also the intrinsic noise of the image pixels. The operation of extracting the edges is still today a fundamental task for the analysis of the images. In this chapter, the most common algorithms will be described to determine the edges with local operators known in the literature as Local Edge Detector—LED. These algorithms assign a value to each pixel automatically evaluated as an edge element, but no information is generated to link the various edge pixels (link edge) together to form the edge segments. Other algorithms will be described in the following to link together the edge pixels which belong to the same contour. The LED algorithms are local operators that determine local variations through a direct analysis of the gray-level values of the image or through local variations of the derivatives of the intensity function. These local discontinuities near the edges can be of various types. A brief description of these discontinuities and a graphical representation on the edge profile is given.

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 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 249.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    We will see later that the gradient \(\nabla f\) does not depend on how the coordinate axes are oriented.

  2. 2.

    In geometry and physics, the versor of an axis or of a vector is a unit vector indicating its direction.

References

  1. J. Canny, A computational approach to edge detection. IEEE Trans. Pattern Anal. Mach. Intell. 8(6), 679–698 (1986)

    Article  Google Scholar 

  2. D. Marr, S. Ullman, Directional selectivity and its use in early visual processing, in Proceedings of the Royal Society of London. Series B, Biological Sciences, vol. 211 (1981), pp. 151–180

    Google Scholar 

  3. R.M. Haralick, Digital step edges from zero-crossings of second directional derivatives. IEEE Trans. Pattern Anal. Mach. Intell. 6(1), 58–68 (1984)

    Article  Google Scholar 

  4. R.M. Haralick, L. Watson, A facet model for image data. Comput. Graph. Image Process. 15, 113–129 (1981)

    Article  Google Scholar 

  5. Ron Kimmel, Alfred M. Bruckstein, On regularized laplacian zero crossings and other optimal edge integrators. Int. J. Comput. Vis. 53(3), 225–243 (2003)

    Article  Google Scholar 

  6. T. Lindeberg, Edge detection and ridge detection with automatic scale selection. Int. J. Comput. Vis. 30(2), 117–154 (1998)

    Article  Google Scholar 

  7. D. Marr, Vision. A Computational Investigation into the Human Representation and Processing of Visual Information, 1st edn. (The MIT Press, 2010). ISBN 978-0262514620

    Google Scholar 

  8. E. Marr, D.; Hildreth, Theory of edge detection, in Proceedings of the Royal Society of London. Series B, Biological Sciences, vol. 207 (1167) (1980), pp. 187–217

    Google Scholar 

  9. R. Deriche, Using canny’s criteria to derive a recursively implemented optimal edge detector. Int. J. Comput. Vis. 1, 167–187 (1987)

    Article  Google Scholar 

  10. T. Young, On the theory of light and colors, in Lectures in Natural Philosophy, vol. 2 (613) (Joseph Johnson, London, 1807)

    Google Scholar 

  11. S.E. Umbaugh, Digital Image Processing and Analysis: Human and Computer Vision Applications with CVIPtools, 2nd edn. (CRC Press, Boca Raton, 2010). ISBN 9-7814-3980-2052

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Arcangelo Distante .

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Distante, A., Distante, C. (2020). Local Operations: Edging. In: Handbook of Image Processing and Computer Vision. Springer, Cham. https://doi.org/10.1007/978-3-030-42374-2_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-42374-2_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-42373-5

  • Online ISBN: 978-3-030-42374-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics