The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (1990 vol.12)
pp: 363-376
ABSTRACT
<p>A novel hierarchical approach toward fast parallel processing of chain-codable contours is presented. The environment, called the chain pyramid, is similar to a regular nonoverlapping image pyramid structure. The artifacts of contour processing on pyramids are eliminated by a probabilistic allocation algorithm. Building of the chain pyramid is modular, and for different applications new algorithms can be incorporated. Two applications are described: smoothing of multiscale curves and gap bridging in fragmented data. The latter is also employed for the treatment of branch points in the input contours. A preprocessing module allowing the application of the chain pyramid to raw edge data is also described. The chain pyramid makes possible fast, O(log(image/sub -/size)), computation of contour representation in discrete scale-space.</p>
INDEX TERMS
picture processing; interobject distance measure; medial axes; discrete distance maps; minimal point-to-point distances; distance measurement; picture processing
CITATION
P. Meer, C.A. Sher, A. Rosenfeld, "The Chain Pyramid: Hierarchical Contour Processing", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.12, no. 4, pp. 363-376, April 1990, doi:10.1109/34.50622
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool