Computational geometry: an introduction
Computational geometry: an introduction
A vectorizer and feature extractor for document recognition
Computer Vision, Graphics, and Image Processing
On the Recognition of Printed Characters of Any Font and Size
IEEE Transactions on Pattern Analysis and Machine Intelligence
On machine recognition of hand-painted Chinese characters by feature relaxation
Pattern Recognition
Thinning Methodologies-A Comprehensive Survey
IEEE Transactions on Pattern Analysis and Machine Intelligence
A knowledge-based thinning algorithm
Pattern Recognition
False stroke detection and elimination for character recognition
Pattern Recognition Letters
Thinning and segmenting handwritten characters by line following
Machine Vision and Applications - Special issue: document image analysis techniques
Structural indexing for character recognition
Computer Vision and Image Understanding
Some Parallel Thinning Algorithms for Digital Pictures
Journal of the ACM (JACM)
Hierarchical flexible matching for recognition of Chinese characters
ICDAR '95 Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2
A line sweep thinning algorithm
ICDAR '95 Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 1) - Volume 1
A Component-Labeling Algorithm Using Contour Tracing Technique
ICDAR '03 Proceedings of the Seventh International Conference on Document Analysis and Recognition - Volume 2
A linear-time component-labeling algorithm using contour tracing technique
Computer Vision and Image Understanding
| Hi-index | 0.16 |
In this article, we propose a new thinning algorithm based on line sweep operation. A line sweep is a process where the plane figure is divided into parallel slabs by lines passing through certain "events." Assuming that the contour of the figure to be thinned has been approximated by polygons, the "events" are then the vertices of the polygons, and the line sweep algorithm searches for pairs of edges lying within each slab. The pairing of edges is useful for detecting both regular and intersection regions. The regular regions can be found at the sites where pairings between edges exist. Intersection regions are those where such relations would cease to exist. A salient feature of our approach is that it finds simultaneously the set of regular regions that attach to the same intersection region. Such a set is thus called an intersection set. The output of our algorithm consists of skeletons as well as intersection sets. Both can be used as features for subsequent character recognition. Moreover, the line sweep thinning algorithm is efficient in computation as compared with a pixel-based thinning algorithm which outputs skeletons only.