A Gaussian filter of variable width was used to create smoothed versions of the boundary. Multiple resolution skeletons . Unfortunately, the MAT according to its original definition tends to overemphasize boundary details. Due to this property, the task to determine the correct correspondences between medial axis components at distinct levels of detail becomes a very difficult problem. It is non trivial to determine which of the branches are spurious and which correspond to significant subregions.
Most algorithms use some deviation of morphological thinning.
Often, spurious branches are eliminated based upon some approximate property of the bounding contour, or based upon some property of the branch itself. Multiple resolution skeletons . 1.1 Algorithms for Skeletonization Most implementations for computing the skeleton to date use discrete space concepts that only approximate Blum s definition. No context found.