Issue No. 04 - April (1990 vol. 12)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.50622
<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>
picture processing; interobject distance measure; medial axes; discrete distance maps; minimal point-to-point distances; distance measurement; picture processing
A. Rosenfeld, C. Sher and P. Meer, "The Chain Pyramid: Hierarchical Contour Processing," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 12, no. , pp. 363-376, 1990.