Abstract
Non-pixel-based skeletonization techniques show many advantages over traditional pixel-based methods such as thinning. These advantages include superior efficiency and faster processing time. Using a constrained Delaunay triangulation, an algorithm is presented here that improves upon non-pixel-based methods, through an adaptive selection of contour points. The proposed algorithm uses a new measure for skeletonization error, and aims to reduce this error across entire images, while retaining the significant properties that make a non-pixel-based technique so successful. Results show that the proposed method is computationally efficient, robust against noise, and produces a skeleton that is confirmed by a human's perception of the image.
Original language | English |
---|---|
Title of host publication | Proceedings of the Third International Conference on Information Technology and Applications: ICITA 2005 |
Publisher | IEEE Computer Society |
Number of pages | 6 |
ISBN (Print) | 0769523161 |
Publication status | Published - 2005 |
Event | International Conference on Information Technology and Applications - Duration: 1 Jul 2017 → … |
Conference
Conference | International Conference on Information Technology and Applications |
---|---|
Period | 1/07/17 → … |
Keywords
- Delaunay triangulation
- algorithms
- image processing
- non-pixel based
- skeletonization