
Mathematical Morphology
by John Goutsias, Henk J. A. M. Heijmans
258 pages· 2000· ISBN 9781586030568
About
This book contains contributions that on the one hand represent modern developments in the area of mathematical morphology, and on the other hand may be of particular interest to an audience of (theoretical) computer scientists. The introductory chapter summarizes some basic notions and concepts of mathematical morphology. In this chapter a novice reader learns, among other things, that complete lattice theory is generally accepted as the appropriate algebraic framework for mathematical morphology. In the following chapter it is explained that, for a number of cases, the complete lattice framework is too limited, and that one should, instead, work on (complete) inf-semilattices. Other chapters discuss granulometries, analytical aspects of mathematical morphology and the geometric character of mathematical morphology. Also, connectivity, the watershed transform and a formal language for morphological transformations are being discussed. This book has many interesting things to offer to researches in computer science, mathematics, physics, electrical engineering and other disciplines.
Discuss Mathematical Morphology with other readers
Join or start a book club for Mathematical Morphology on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Mathematical Morphology?
Sign up free on Readfeed, then browse public clubs or start your own club with Mathematical Morphology as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Mathematical Morphology with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Mathematical Morphology with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.