Abstract
After a brief discussion of the extension of mathematical morphology to complete lattices, the space of gray-level functions is considered and the concept of a threshold set is introduced. It is shown how one can use binary morphological operators and thresholding techniques to build a large class of gray-level morphological operators. Particular attention is given to the class of so-called flat operators, i.e. operators which commute with thresholding. It is also shown how to define dilations and erosions with nonflat structuring elements if the gray-level set is finite. It is reported that mere truncation yields wrong results.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
