Abstract
In this paper an algorithm is given for generating linked edge boundaries between adjacent regions of different gray levels. The paper consists of two parts. In the first part one-dimensional edge semantics are examined in detail, and a one-dimensional edge detector is proposed whose output is not just a local edge point assertion but a data structure. This data structure contains alternative interpretations of edge cross-sections as global gray level transition regions of variable widths. In the second part, an algorithm is presented for linking together edge hypotheses to form global edges. Edges are treated as variable width regions, and the edge linking procedure is really a region grower. Edge linking is a parallel process on all the edges in pairs of adjacent scan lines, and contextual information in the direction of the scan lines is used to resolve ambiguous linking situations. The procedure relies heavily upon a one-dimensional edge detector that defers the formation of local edge interpretations until more informed decisions can be made by the edge linking procedure.
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 callDisclaimer: 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.
