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. |
Year | Venue | Field |
---|---|---|
2017 | arXiv: Computer Vision and Pattern Recognition | Multi dimensional,Pattern recognition,Thinning,Computer science,Connected component,Artificial intelligence,Pixel,Sequential algorithm,Binary number,Thinning algorithm |
DocType | Volume | Citations |
Journal | abs/1710.03025 | 0 |
PageRank | References | Authors |
0.34 | 8 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Himanshu Jain | 1 | 0 | 1.01 |
Archana Praveen Kumar | 2 | 0 | 0.34 |