Abstract
This paper presents a segmentation method, the flat zone approach, that avoids some limitations of the watershed-plus-markers method. The watershed-plus-markers approach, which is the traditional segmentation technique in mathematical morphology, has two inherent problems: (1) the possible separation of a piecewise-constant region of the input image into several regions in the output partition, and (2) the problem of obtaining markers (connected components of pixels signaling significant regions) for features that are one or two pixels wide. These problems are related to the limited resolution power (for feature extraction) of gradient operators. The flat zone approach extends the region marker concept (to contain the entire (and not part of) regions) and requires neither the computation of a gradient function nor the modification of the support of the input image in order to increase the size of the features. Our approach works on the graph formed by the image flat zones (or piecewise-constant regions). This fact ensures that the input image regions are not broken and can consider all input flat zones regardless their size. An inclusion relationship between the flat zones of the input image and the regions of the output partition is imposed. That is, a flat zone segmentation method is a region (flat zone) merging method and behaves like a connected operator. Our method is robust (in the sense that it is invariant under certain intensity value transformations) and uses a hierarchical waiting queue algorithm that makes it extremely efficient.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.