Abstract
A new method using gray-scale morphological erosion is proposed to obtain the morphological skeleton of a discrete binary image. The full morphological skeleton is the union of a finite number of skeleton subsets. We also show that gray-scale erosion in this method can be replaced by a simpler operation to further improve computation time. Two efficient algorithms based on the proposed approach are presented.
Original language | English (US) |
---|---|
Pages (from-to) | 689-695 |
Number of pages | 7 |
Journal | Pattern Recognition Letters |
Volume | 14 |
Issue number | 8 |
DOIs | |
State | Published - Aug 1993 |
Keywords
- Euclidean
- Morphology
- chessboard
- city-block
- dilation
- erosion
- skeleton
ASJC Scopus subject areas
- Software
- Signal Processing
- Computer Vision and Pattern Recognition
- Artificial Intelligence