<?xml version="1.0" encoding="UTF-8"?> <article key="pdf/6492" mdate="2011-06-28 00:00:00"> <author>Anastasia Rita Widiarti</author> <title>Comparing Hilditch, Rosenfeld, ZhangSuen,and Nagendraprasad WangGupta Thinning</title> <pages>563 - 567</pages> <year>2011</year> <volume>5</volume> <number>6</number> <journal>International Journal of Computer and Information Engineering</journal> <ee>https://publications.waset.org/pdf/6492</ee> <url>https://publications.waset.org/vol/54</url> <publisher>World Academy of Science, Engineering and Technology</publisher> <abstract>This paper compares Hilditch, Rosenfeld, Zhang Suen, dan Nagendraprasad Wang Gupta (NWG) thinning algorithms for Javanese character image recognition. Thinning is an effective process when the focus in not on the size of the pattern, but rather on the relative position of the strokes in the pattern. The research analyzes the thinning of 60 Javanese characters. Timewise, ZhangSuen algorithm gives the best results with the average process time being 0.00455188 seconds. But if we look at the percentage of pixels that meet onepixel thickness, Rosenfelt algorithm gives the best results, with a 99.98 success rate. From the number of pixels that are erased, NWG algorithm gives the best results with the average number of pixels erased being 84.12. It can be concluded that the Hilditch algorithm performs least successfully compared to the other three algorithms.</abstract> <index>Open Science Index 54, 2011</index> </article>