# Thinning Methodologies - A Comprehensive Survey

@article{Lam1992ThinningM, title={Thinning Methodologies - A Comprehensive Survey}, author={Louisa Lam and Seong-Whan Lee and Ching Yee Suen}, journal={IEEE Trans. Pattern Anal. Mach. Intell.}, year={1992}, volume={14}, pages={869-885} }

A comprehensive survey of thinning methodologies is presented. A wide range of thinning algorithms, including iterative deletion of pixels and nonpixel-based methods, is covered. Skeletonization algorithms based on medial axis and other distance transforms are not considered. An overview of the iterative thinning process and the pixel-deletion criteria needed to preserve the connectivity of the image pattern is given first. Thinning algorithms are then considered in terms of these criteria and…

## Figures and Tables from this paper

## 1,868 Citations

### Comparative Survey of Thinning Algorithms

- Computer Science
- 2009

The goal of this paper is to introduce the most common thinning methodologies and propose a method to evaluate their performance, especially in the field of signature recognition, and take into account various properties of a thinned skeleton and compares them to those of an ideal reference image.

### Depth-based thinning: A new non-iterative skeletonization algorithm for 2D digital images

- Computer Science2014 9th IEEE Conference on Industrial Electronics and Applications
- 2014

An improved thinning algorithm that uses the depth of each point to find the deepest points, only considers the deepestpoints and its neighboring points to determine the point can be deleted and the thinning processing time is decreased, and the skeleton is smooth, clear and continuous.

### A Sequential Thinning Algorithm For Multi-Dimensional Binary Patterns

- Computer ScienceArXiv
- 2017

A sequential algorithm that is very easy to understand and modify based on application to perform the thinning of multi-dimensional binary patterns to prove the validity of the procedure.

### Hybrid thinning through reconstruction

- Computer ScienceProceedings of 3rd International Conference on Document Analysis and Recognition
- 1995

The authors present a novel approach to detecting ambiguous regions in a thinned image which uses the reconstructability properties of appropriate thinning algorithms to reverse the thinning process and automatically detect those pixels which may have resulted from more then one stroke in the image.

### New Iterative Algorithms for Thinning Binary Images

- Computer Science2010 3rd International Conference on Emerging Trends in Engineering and Technology
- 2010

Two new iterative algorithms for thinning binary images are proposed by using two operations: edge detection and subtraction and repeatedly conditionally eroding the pixels until a one pixel thick pattern is obtained.

### K3M: A universal algorithm for image skeletonization and a review of thinning techniques

- Computer ScienceInt. J. Appl. Math. Comput. Sci.
- 2010

A new thinning algorithm is proposed that presents interesting properties in terms of processing quality and algorithm clarity, enriched with examples, which makes it useful and versatile for a variety of applications.

### A Comparative Study of Iterative Thinning Algorithms for BMP Images

- Computer Science
- 2011

Four iterativeallel thinning algorithms namely the Fast Parallel Thinning Algorithm (FPTA), Guo & Hall’s parallel thinning Al algorithm (GHPTA), Robust Parallel Thinning Algorithm for binary images (RPTA), and Preprocessing ThinningAlgorithms for Handwritten Character Recognition (PPTA) have been implemented in C Language and evaluated.

### An Efficient Quick Thinning Algorithm

- Computer Science2008 Congress on Image and Signal Processing
- 2008

A new thinning algorithm that thins symbols to their central lines with high speed and rotation invariant and has good effect on preserving the topology of symbols and letters is addressed.

### COMPARISON OF THINNING ALGORITHMS FOR VECTORIZATION OF ENGINEERING DRAWINGS

- Computer Science
- 2016

The comparison of nine known iterative parallel thinning algorithms with one proposed and their performance evaluation on sets of the engineering drawings are presented and the results are evaluated and compared in regard to suitability to vectorization of theengineering drawings.

## References

SHOWING 1-10 OF 177 REFERENCES

### A maximum algorithm for thinning digital patterns

- Computer Science[1988 Proceedings] 9th International Conference on Pattern Recognition
- 1988

An approach to thinning is presented that deletes pixels without using iterative transformations and makes the skeleton closer to the medial axis and makes it more convenient to reconstruct the original pattern.

### A fast parallel algorithm for thinning digital patterns

- EngineeringCACM
- 1984

A fast parallel thinning algorithm is proposed in this paper. It consists of two subiterations: one aimed at deleting the south-east boundary points and the north-west corner points while the other…