International Journal of Applied Mathematics and Computer Science · 2016 · 23 citations · 10 references
ArtsComputer ScienceComputer VisionDigital ImagingMachine VisionData ReductionDigital Image ProcessingImage AnalysisImage PreprocessingImage ProcessingOptical Character RecognitionHandwritten Character RecognitionImage ReductionSkeletonization
Abstract The K3M thinning algorithm is a general method for image data reduction by skeletonization. It had proved its feasibility in most cases as a reliable and robust solution in typical applications of thinning, particularly in preprocessing for optical character recognition. However, the algorithm had still some weak points. Since then K3M has been revised, addressing the best known drawbacks. This paper presents a modified version of the algorithm. A comparison is made with the original one and two other thinning approaches. The proposed modification, among other things, solves the main drawback of K3M, namely, the results of thinning an image after rotation with various angles.
10
A fast parallel algorithm for thinning digital patterns
Tingwei Zhang, Ching Y. Suen · Communications of the ACM · 1984 · 2.7K citations · Full text
Parallel thinning with two-subiteration algorithms
Richard Hall · Communications of the ACM · 1989 · 441 citations · Full text
Programming pattern recognition
G. P. Dinneen · 1955 · 115 citations