Common 2-dimensional skeletonization algorithm of binary matrices, based on ≤8 thinning steps, corresponding to all or some from 8 directions with the step 45 degree.
A skeletal implementation of the
Ready classifier of pixel of 2-dimensional
The simplest algorithm of multidimensional skeletonization of binary matrices, based on sequential
Algorithm of 2-dimensional skeletonization of binary matrices based on 8 thinning steps, corresponding to 8 directions with the step 45 degree, based on analysis of 3x3 aperture.
Algorithm of 2-dimensional skeletonization of binary matrices based on 4 thinning steps, corresponding to 4 directions with the step 90 degree, based on analysis of 3x5 aperture.
Classifier of pixels of skeletons (bit matrices, generated by skeletonization algorithms), separating them into "nodes", "branch pixels" and other groups.
Scanner of skeletons (bit matrices, generated by skeletonization algorithms), allowing to scan a skeleton, find and traverse all its structural elements like nodes and branches.
Stronger version of
Weaker version of
Style of interpretation of non-negative results while detecting pixel types of the skeleton.
Algorithms of skeletonization of binary
2- or n-dimensional
This package contains several skeletonization classes,
Every iteration of these iterative processors makes all particles (matrix areas, filled by unit elements)
little smaller, but saves connectivity of particles
ErodingSkeleton, which does not provide saving connectivity).
After finishing all iterations, the resulting matrix, called skeleton,
usually contains thin "lines", called skeleton branches, which connect different
skeleton nodes (points of intersection of these lines).
SkeletonScanner allows to detect and analyse
the structure of skeleton.
AlgART Laboratory 2007–2014