Abstract
A new thinning algorithm for binary images, based on the safe-point testing and mid-crack code tracing, is presented in this paper. Thinning is treated as the deletion of nonsafe border pixels from the contour to the center of the object layer-by-layer. The deletion is determined by masking a 3 x 3 weighted template and by the use of look-up tables. The resulting skeleton does not require cleaning or pruning. The obtained skeleton possesses single-pixel thickness and preserves the object's connectivity. The algorithm is very simple and efficient since only boundary pixels are processed at each iteration and look-up tables are used.
Original language | English (US) |
---|---|
Pages (from-to) | 370-378 |
Number of pages | 9 |
Journal | IEEE Transactions on Systems, Man and Cybernetics |
Volume | 25 |
Issue number | 2 |
DOIs | |
State | Published - Feb 1995 |
All Science Journal Classification (ASJC) codes
- General Engineering