Computational geometry: an introduction
Computational geometry: an introduction
Thinning Methodologies-A Comprehensive Survey
IEEE Transactions on Pattern Analysis and Machine Intelligence
Detection of 3-D Simple Points for Topology Preserving Transformations with Application to Thinning
IEEE Transactions on Pattern Analysis and Machine Intelligence
On digital distance transforms in three dimensions
Computer Vision and Image Understanding
2D Grey-level Skeleton Computation: A Discrete 3D Approach
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
Image Analysis and Mathematical Morphology
Image Analysis and Mathematical Morphology
2D grey-level convex hull computation: a discrete 3D approach
SCIA'03 Proceedings of the 13th Scandinavian conference on Image analysis
| Hi-index | 0.00 |
2D grey-level images are interpreted as 3D binary images, where the grey-level plays the role of the third coordinate. In this way, algorithms devised for 3D binary images can be used to analyse 2D grey-level images. Here, we present three such algorithms. The first algorithm smoothes a 2D grey-level image by flattening its geometrical and grey-level peaks while simultaneously filling in geometrical and grey-level valleys, regarded as non significant in the problem domain. The second algorithm computes an approximation of the convex hull of a 2D grey-level object, by building a covering polyhedron closely fitting the corresponding object in a 3D binary image. The result obtained is convex both from the geometrical and grey-level points of view. The third algorithm skeletonizes a 2D grey-level object by skeletonizing the top surface of the object in the corresponding 3D binary image.