Abstract
We analyze the behavior of most common thinning algorithms on printed Gujarati text and handwritten numerals. We are focusing mostly on two types of algorithms: The first is serial thinning and second is parallel thinning. Thinning is more crucial when we focusing on structural feature-based character recognition. Thinned character reduced complication of the shape of the character. This analysis focuses on the actual result we get after applying serial and parallel thinning algorithms. Total five algorithms are used for experiments and applied on small, medium, big size of character data and on skewed character data. The results are useful where we designing classifiers for Gujarati text.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Hilditch CJ (1969) Linear skeletons from square cupboards. In: Meltzer B, Michie D (eds) Machine Intelligence, vol 4. Elsevier, New York: Amar, pp 403–420
Zhang TY, Suen CY (1984) A fast parallel algorithm for thinning digital patterns. Commun ACM 27(6):236–239
Lu HE, Wang PSP (1985) An improved fast parallel algorithm for thinning digital patterns. Proceedings of the IEEE conference on computer vision and pattern recognition, pp 364–367
Stentifod FWM, Mortimer RG (1983) Some new heuristics for thinning binary handprinted characters for OCR. IEEE Trans Syst Man Cybern SMC-13(1)
Wang PSP, Hui L, Fleming Jr T (1986) Further improved fast parallel thinning algorithm for digital patterns. In: Wang PSP (ed) Computer vision, image processing and communication systems and applications, pp 37–40
Holt CM, Stewert A, Client M, Perrot RH (1987) An improved parallel thinning algorithm. CACM 30(2):156–160
Chin RT, Wan HK, Stover DL, Iverson RD (1987) A one pass thinning algorithm and its parallel implementation. Comput Vision, Graph Image Process 40(1):30–40
Pal S, Bhattacharyaa P (1989) A preserving one pass parallel thinning algorithm. Indian Institute of Management, Calcutta, Working paper series No 123(89)
Guo Z, Hall RW (1989) Parallel thinning with two subitration algorithm. CACM, 32(3):359–373
Chen CH, DeCurtins JL (1993) Word recognition in a segmentation-free approach to OCR. Proceedings of the second international conference on document analysis and recognition, pp 573–576. IEEE (1993)
Kardos Peter (2011) Sufficient conditions for order-independency in sequential thinning. Acta Cybernetica 20:87–100
Khalid S (2010) A universal algorithm for image skeletonization and a review of thinning techniques. Int J Apply Math Comput Sci 20(2):317–335
Kalles D, Morries DT (1993) A novel fast and reliable thinning algorithm. Image Vis Comput 11(9):588–603
Tarabek P (2008) Performance measurements of thinning algorithms. J Info Control Manag Syst 6(2)
Lam L, Lee SW, Suen CY (1992) Thinning methodologies-a comprehensive survey. IEEE Trans Pattern Anal Mach Intell 14(9)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Suthar, S.B., Goradia, R.S., Dalwadi, B.N., Patel, S.M., Patel, S. (2018). Performance Scrutiny of Thinning Algorithms on Printed Gujarati Characters and Handwritten Numerals. In: Mishra, D., Nayak, M., Joshi, A. (eds) Information and Communication Technology for Sustainable Development. Lecture Notes in Networks and Systems, vol 9. Springer, Singapore. https://doi.org/10.1007/978-981-10-3932-4_27
Download citation
DOI: https://doi.org/10.1007/978-981-10-3932-4_27
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-3931-7
Online ISBN: 978-981-10-3932-4
eBook Packages: EngineeringEngineering (R0)