A Sequential Thinning Algorithm For Multi-Dimensional Binary Patterns
Himanshu Jain, Archana Praveen Kumar

TL;DR
This paper introduces a simple, adaptable sequential thinning algorithm for multi-dimensional binary patterns, effectively producing skeletons in 2D and 3D images with validated results and comparisons to existing methods.
Contribution
A new easy-to-understand and modifiable sequential thinning algorithm for multi-dimensional binary patterns is proposed, demonstrating effectiveness in 2D and 3D applications.
Findings
Effective thinning of 2D and 3D patterns demonstrated
Algorithm shows very good results compared to state-of-the-art methods
Proven validity through experimental testing
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDigital Image Processing Techniques · Computational Geometry and Mesh Generation · Handwritten Text Recognition Techniques
