Machine extraction of meaningful features from the digitized representation of an image (picture, scene etc.) is of great interest to investigators working in such diverse fields as robotic vision, scene analysis, pattern recognition, and automatic part identification in manufacturing processes. The authors describe in detail their algorithms for implementing different segmentation strategies. These are a label propagation segmentation scheme (using the region growing algorithm) and a linked pyramid segmentation scheme. The two techniques are analyzed and compared with respect to their ability to satisfactorily segment a wide class of images (scenes, radiographs, machine parts etc.); computational overheads; memory overheads; and sensitivity to additive noise (Gaussian). In addition to the critical analysis and evaluation of the two techniques, the authors introduce the following enhancements: new predicates (similarity criteria) that are applicable to a broad class of images; incorporation of impulse noise suppression; hierarchical two-level processing to refine segmentation by label propagation; and use of a weighting function to improve the segmentation process.
[1]
Azriel Rosenfeld,et al.
Image Smoothing and Segmentation by Multiresolution Pixel Linking: Further Experiments and Extensions
,
1982,
IEEE Transactions on Systems, Man, and Cybernetics.
[2]
Theodosios Pavlidis,et al.
A hierarchical data structure for picture processing
,
1975
.
[3]
Arvinder Singh. Sethi.
Segmentation of biomedical images by multiresolution pixel linking.
,
1984
.
[4]
Azriel Rosenfeld,et al.
Region Extraction by Averaging and Thresholding
,
1975,
IEEE Transactions on Systems, Man, and Cybernetics.
[5]
Azriel Rosenfeld,et al.
Segmentation and Estimation of Image Region Properties through Cooperative Hierarchial Computation
,
1981,
IEEE Transactions on Systems, Man, and Cybernetics.