A Sequential Thinning Algorithm For Multi-Dimensional Binary Patterns
This work addresses the need for adaptable thinning algorithms in image processing applications, but it appears incremental as it builds on existing methods with modifications for ease of use.
The paper tackled the problem of thinning multi-dimensional binary patterns to produce skeletons while retaining connectivity and structural properties, proposing a sequential algorithm that is easy to understand and modify, and it showed very good results in tests on 2D and 3D patterns with comparisons to state-of-the-art methods proving its validity.
Thinning is the removal of contour pixels/points of connected components in an image to produce their skeleton with retained connectivity and structural properties. The output requirements of a thinning procedure often vary with application. This paper proposes a sequential algorithm that is very easy to understand and modify based on application to perform the thinning of multi-dimensional binary patterns. The algorithm was tested on 2D and 3D patterns and showed very good results. Moreover, comparisons were also made with two of the state-of-the-art methods used for 2D patterns. The results obtained prove the validity of the procedure.