By Topic

Image Segmentation with Directed Trees

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Narendra, P.M. ; Systems and Research Center, Honeywell, Inc., Minneapolis, MN 55413. ; Goldberg, M.

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.

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:PAMI-2 ,  Issue: 2 )