This Article 
 Bibliographic References 
 Add to: 
Image Segmentation with Directed Trees
February 1980 (vol. 2 no. 2)
pp. 185-191
P. M. Narendra, Systems and Research Center, Honeywell, Inc., Minneapolis, MN 55413.
M. Goldberg, Department of Electrical Engineering, University of Ottawa, Ottawa, Ont., Canada.
This correspondence presents a simple algorithm to detect and label homogeneous areas in an image, using directed trees for region labeling. The scheme constructs directed trees with the image points as nodes, guided by an edge value computed at every point. These directed trees segment the image into disjoint regions. Because of a valley seeldng property of the tree construction procedure, the boundaries separating the resultant segments pass through the center of the edges. The algorithm thus performs wel1 with thick and wide edges of varying height, because no thresholding of the edge image is involved. The properties of the resultant segments are stated in terms of the edge image. The algorithm is shown to be simple, efficient, and effective for detecting homogeneous segments in the presence of noise. Results of application in the algorithm to segment a LANDSAT multispectral scene of an agricultural area are included.
P. M. Narendra, M. Goldberg, "Image Segmentation with Directed Trees," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 2, no. 2, pp. 185-191, Feb. 1980, doi:10.1109/TPAMI.1980.4766999
Usage of this product signifies your acceptance of the Terms of Use.