Multiresolution skeletonization in binary pyramids

A multiresolution skeletonization algorithm is presented. The underlying data structure is a binary AND-pyramid. Notwithstanding the fact that the AND-pyramid is likely to break pattern connectedness at lower resolution levels, the algorithm generates connected skeletons at all resolution levels. It can most conveniently be implemented on a parallel SIMD architecture, but efficient MIMD and sequential implementations are also possible. A hierarchy among skeleton branches at various resolutions levels is also introduced.

[1]  Gabriella Sanniti di Baja,et al.  A One-Pass Two-Operation Process to Detect the Skeletal Pixels on the 4-Distance Transform , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Gabriella Sanniti di Baja,et al.  Geometric Properties of the Union of Maximal Neighborhoods , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Stephen M. Pizer,et al.  Hierarchical Shape Description Via the Multiresolution Symmetric Axis Transform , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Martin D. Levine,et al.  Multiple Resolution Skeletons , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Gunilla Borgefors,et al.  Parallel distance transforms on pyramid machines: Theory and implementation , 1990, Signal Process..

[6]  Gabriella Sanniti di Baja,et al.  A Multiresolution Shape Description Algorithm , 1993, CAIP.

[7]  Gunilla Borgefors,et al.  Distance transformations in digital images , 1986, Comput. Vis. Graph. Image Process..