Issue No. 04 - April (1981 vol. 3)

ISSN: 0162-8828

pp: 368-375

Wallace S. Rutkowski , Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD 20742.

Shmuel Peleg , Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD 20742.

Azriel Rosenfeld , FELLOW, IEEE, Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD 20742.

ABSTRACT

Relaxation is applied to the segmentation of closed boundary curves of shapes. The ambiguous segmentation of the boundary is represented by a directed graph structure whose nodes represent segments, where two nodes are joined by an arc if the segments are consecutive along the boundary. A probability vector is associated with each node; each component of this vector provides an estimate of the probability that the corresponding segment is a particular part of the object. Relaxation is used to eliminate impossible sequences of parts, or reduce the probabilities of unlikely ones. In experiments involving airplane shapes, this almost always results in a drastic simplification of the graph with only good interpretations surviving. The approach is also extended to include curve linking and gap filling. A chain coded input image is broken into segments based on a measure of local curvature. Gap completions linking pairs of segments are then proposed and represented in a graph structure. A second graph, whose nodes consist of paths in the above graph, is constructed, and the nodes of the second graph are probabilistically classified as various object parts. Relaxation is then applied to increase the probability of mutually supporting classifications, and decrease the probability of unsupported decisions. A modified relaxation process using information about the size, spatial position, and orientation of the object parts yielded a high degree of disambiguation.

INDEX TERMS

CITATION

Wallace S. Rutkowski, Shmuel Peleg, Azriel Rosenfeld, "Shape Segmentation Using Relaxation",

*IEEE Transactions on Pattern Analysis & Machine Intelligence*, vol. 3, no. , pp. 368-375, April 1981, doi:10.1109/TPAMI.1981.4767123