Finding local maxima in a pseudo-Euclidean distance transform
Computer Vision, Graphics, and Image Processing
Efficient shape representation by minimizing the set of centres of maximal discs/spheres
Pattern Recognition Letters
Note on the multiscale representation of 2D and 3D shapes
Graphical Models and Image Processing
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
Medial axis for chamfer distances: computing look-up tables and neighbuorhoods in 2D or 3D
Pattern Recognition Letters
Use of medial axis transforms for computing normals at boundary points
Pattern Recognition Letters
Weighted distances based on neighbourhood sequences
Pattern Recognition Letters
Finding a minimum medial axis of a discrete shape is NP-hard
Theoretical Computer Science
Medial axis LUT computation for chamfer norms using H-polytopes
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
| Hi-index | 0.00 |
In this paper, some methods for representing objects using path-based distances are considered. The representations can be used as anchor points when extracting medial representations of the objects. The distance transform (DT) is obtained by labeling each object element with the distance to the background. By local operations on the DT, different sets of anchor points can be obtained. We present two different methods based on local operations and prove that the representations are reversible, when this is the case. The methods are defined for weighted distances based on neighborhood sequences, which includes for example the well known cityblock and chessboard distances.