Skip to main content Accessibility help
×
Hostname: page-component-7479d7b7d-pfhbr Total loading time: 0 Render date: 2024-07-10T03:23:51.588Z Has data issue: false hasContentIssue false

7 - Mathematical Morphology

from Part II - Preprocessing

Published online by Cambridge University Press:  25 October 2017

Wesley E. Snyder
Affiliation:
North Carolina State University
Hairong Qi
Affiliation:
University of Tennessee
Get access

Summary

I think the universe is pure geometry – basically, a beautiful shape twisting around and dancing over space-time.

– Antony Garrett Lisi

Introduction

In this chapter, a study of shape begins. Throughout the remainder of this book we will continue to look at shape in many different ways. Here, the topic is introduced at the pixel level, providing some simple, local operations that modify shapes, changing connectivity, and providing nonlinear ways to treat noise.

  • • (Section 7.2) Binary morphology changes the shape of binary objects. We define the two basic morphological operators, dilation and erosion, on the basis of which two other operators, opening and closing, can be derived. We also discuss some interesting properties of these morphological operators and their applications in noise removal and edge linking.

  • • (Section 7.3) We extend the discussion to grayscale morphology and define the dilation and erosion operations when the objects are not described in binary values. We progress from grayscale morphology using flat structuring elements to the use of grayscale structuring elements.

  • • (Section 7.4) As one of the most important applications of morphological operations, we discuss the distance transform (DT) and different ways to compute the DT.

  • Morphological operations may be considered as either the result of set operations, or the result of composition of functions. Both these approaches are described in this chapter, in order to provide the student with the insight to see similarities and suitability. We will find that set-theoretic ways of thinking about morphology are most appropriate for binary images, and functional notation is more convenient for grayscale images. In section 7.5, an application example of combining dilation, erosion, and distance transform for the purpose of edge linking is provided to illustrate the power of these operations.

    Binary Morphology

    In this section, we first introduce two basic morphological operators, dilation and erosion. We then define opening and closing, two operators that are developed based on dilation and erosion. We also discuss interesting properties of these operators and their applications in solving computer vision problems.

    Type
    Chapter
    Information
    Publisher: Cambridge University Press
    Print publication year: 2017

    Access options

    Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

    References

    [7.1] C., Arcelli, L., Cordella, L., and S., Levialdi. Parallel thinning of binary pictures. Electron. Letters, (11): 1975.Google Scholar
    [7.2] H., Breu, J., Gil, D., Kirkpatrick, and M., Werman. Linear time Euclidian distance transform algorithms. IEEE Trans. Pattern Anal. and Machine Intel., 17 (5), 1995.Google Scholar
    [7.3] C., Huang and O., Mitchell. A euclidian distance transform using grayscale morphology decomposition. IEEE Trans. Pattern Anal. and Machine Intel., 16 (4), 1994.Google Scholar
    [7.4] W., Snyder, M., Hsiao, K., Boone, M., Hudacko, and B., Groshong. Closing gaps in edges and surfaces. Image and Vision Computing, October 1992.
    [7.5] H., Tagare, F., Vos, C., Jaffe, and J., Duncan. Arrangement: A spatial relation between parts for evaluating similarity of tomographic section. IEEE Trans. Pattern Anal. and Machine Intel., 17 (9), 1995.Google Scholar
    [7.6] R., van den Boomgaard and A., Smeulders. The morphological structure of images: The differential equations of morphological scale-space. IEEE Trans. Pattern Anal. and Machine Intel., 16 (11), 1994.Google Scholar

    Save book to Kindle

    To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

    Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

    Find out more about the Kindle Personal Document Service.

    Available formats
    ×

    Save book to Dropbox

    To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

    Available formats
    ×

    Save book to Google Drive

    To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

    Available formats
    ×