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.