Measuring the sizes of concavities
暂无分享,去创建一个
A concavity in a region R is a simply-connected region S whose boundary is composed of a boundary B to R and the chord K of B. Three measures of the size of S are studied: the area of S; the maximum distance of B from K; and the maximum distance of K from B. Relationships among these measures are established. It is shown that only the last measure guarantees (when its value is high) that S contains a large 'block' of the complement of R, so that S is 'detectable' if R is coarsely digitized. Similarly, if the last measure is large relative to the length of K, S is 'locally detectable' if R is digitized to a suitable degree of coarseness. Local detectability of S at a coarse level of digitization corresponds, intuitively, to S being visually conspicuous.
[1] B. G. Batchelor. Shape Descriptors for Labeling Concavity Trees , 1980, Cybern. Syst..
[2] Wallace S. Rutkowski. Shape Segmentation Using Arc/Chord Properties , 1981 .
[3] B. G. Batchelor,et al. Hierarchical Shape Description Based upon Convex Hulls of Concavities , 1980, Cybern. Syst..
[4] Azriel Rosenfeld,et al. How a Digital Computer can Tell whether a Line is Straight , 1982 .
[5] Azriel Rosenfeld,et al. Digital Picture Processing , 1976 .