This Article 
 Bibliographic References 
 Add to: 
Feature Analysis Using Line Sweep Thinning Algorithm
February 1999 (vol. 21 no. 2)
pp. 145-158

Abstract—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.

[1] L. Lam, S.W. Lee, and C.Y. Suen, “Thinning Methodologies: A Comprehensive Survey,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, pp. 869-885, 1992.
[2] T. Pavlidis, “A Vectorizer and Feature Extractor for Document,” Computer Vision, Graphics, and Image Procesing, vol. 35, pp. 111-127, 1986.
[3] S.A. Mahmoud, I. AbuHaiba, and R.J. Green, "Skeletonization of Arabic Characters Using Clustering Based Skeletonization Algorithm (CBSA)," Pattern Recognition, vol. 24, no. 5, pp. 453-464, 1991.
[4] B. Li and C.Y. Suen, "A Knowledge-Based Thinning Algorithm," Pattern Recognition, vol. 24, no. 12, pp. 1,211-1,221, 1991.
[5] H. Nishida, T. Suzuki, and S. Mori, "Thin Line Representation From Contour Representation of Handprinted Characters," Proc. Int'l Workshop Frontiers in Handwriting Recognition, pp. 27-68,Bonas, France,23-27 Sept. 1991.
[6] IEEE Std. 610.12-1990, Standard Glossary of Software Engineering Terminology, IEEE Press, Piscataway, N.J., 1990.
[7] F.P. Preparata and M.I. Shamos, Computational Geometry. Springer-Verlag, 1985.
[8] T. Pavlidis, "Scan Conversion of Regions Bounded by Parabolic Splines," IEEE Computer Graphics and Applications, vol. 5, pp. 47-53, 1985.
[9] F. Chang, Y.C. Chen, H.S. Don, W.L. Hsu, and C.I. Kao, "Stroke Segmentation as a Basis for Structural Matching of Chinese Characters," Proc. Second Int'l Conf. Document Analysis and Recognition, pp. 35-40,Sukuba, Japan, 1993.
[10] F. Chang and Y.P. Cheng, "Graphical Representation of Characters via Decomposition Method," Proc. Int'l Conf. Computer Processing Oriental Languages, pp. 435-440,Korea, 1994.
[11] F. Chang, Y.P. Cheng, T. Pavlidis, and T.Y. Shuai, "A Line Sweep Thinning Algorithm," Proc. Third Int'l Conf. Document Analysis and Recognition, pp. 227-230,Montreal, Canada, 1995.
[12] S.L. Xie and M. Suk, "On Machine Recognition of Hand-Printed Chinese Characters by Feature Relaxation," Pattern Recognition, vol. 21, no. 1, pp. 1-7, 1988.
[13] S. Kahan,T. Pavlidis,, and H. S. Baird,“On the Recognition of Printed Characters of Any Font and Size,” IEEE-PAMI, vol. 9, no. 2, pp. 274-288, 1987.
[14] F.H. Cheng, W.H. Hsu, and M.C. Kuo, "Recognition of Handprinted Chinese Characters via Stroke Relaxation," Pattern Recognition, vol. 26, no. 4, pp. 579-593, 1993.
[15] F. Chang, Y.P. Cheng, and Y.S. Huang, "Hierarchical Flexible Matching for Recognition of Chinese Characters," Proc. Third Int'l Conf. Document Analysis and Recognition,Montreal, 1995.
[16] F. Chang, Y.C. Lu, and T. Pavlidis, "Line Sweep Thinning Algorithm: A Complete Technical Report," TR-IIS-97-011, Institute of Information Science, Academia Sinica, Taipei, Taiwan, 1997. Postscript file is available at
[17] R. Stefanelli and A. Rosenfeld, "Some Parallel Thinning Algorithms for Digital Pictures," J. ACM, vol. 18, no. 2, pp. 255-264, 1971.
[18] S. Lee and J.C. Pan, “Offline Tracing and Representation of Signatures,” IEEE Trans. Systems, Man, and Cybernetics, vol. 22, no. 4, pp. 755-771, 1992.
[19] S.W. Lu and H. Xe, "False Stroke Detection and Elimination for Character Recognition," Pattern Recognition Letters, vol. 13, pp. 745-755, 1992.
[20] A. Marcelli, N. Likhareva, and T. Pavlidis, "Structural Indexing for Character Recognition," Computer Vision and Image Understanding, vol. 66, no. 3, pp. 330-346, 1997.
[21] M. Sakauchi and Y. Ohsawa, "The AI-MUDAMS: The Drawing Processor Based on the Multidimensional Pattern Data Structure," IEEE Computer Society Workshop Computer Architecture for Pattern Analysis and Image Database Management, pp. 154-161, 1985.
[22] W. Lu, Y. Ohsawa, and M. Sakauchi, "A Database Capture System for Mechanical Drawing Using an Efficient Multi-Dimensional Graphical Data Structure," Proc. Ninth ICPR, pp. 266-269, 1988.
[23] Y. Suen and S.P. Wang, eds., "Thinning Methodologies for Pattern Recognition," special issue, Int'l J. Pattern Recognition and Artificial Intelligence, vol. 7, no. 5, 1993.

Index Terms:
Line sweep, thinning, line sweep thinning algorithm, path, junction, regular region, singular region, intersection set, feature analysis, character recognition.
Fu Chang, Ya-Ching Lu, Theo Pavlidis, "Feature Analysis Using Line Sweep Thinning Algorithm," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 21, no. 2, pp. 145-158, Feb. 1999, doi:10.1109/34.748823
Usage of this product signifies your acceptance of the Terms of Use.