Some new heuristics for thinning binary handprinted characters for OCR
暂无分享,去创建一个
A standard thinning algorithm which consists of a matrix matching scheme used in conjunction with a connectivity measure is briefly described. Several new heuristics are introduced to obviate some of the common shortcomings of thinning algorithms when applied to handprinted data.
[1] Gabriella Sanniti di Baja,et al. A thinning algorithm based on prominence detection , 1981, Pattern Recognit..
[2] Azriel Rosenfeld,et al. Some Parallel Thinning Algorithms for Digital Pictures , 1971, JACM.
[3] Ernst E. Triendl. Skeletonization of noisy handdrawn symbols using parallel operations , 1970, Pattern Recognit..
[4] C. J. Hilditch,et al. Linear Skeletons From Square Cupboards , 1969 .
[5] Stefano Levialdi,et al. More about a thinning algorithm , 1980 .