1. UKM Learning and Research Repository
2. Master Thesis / Tesis Master
3. Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat

Title:	Comparative study of algorithms for voronoi diagram construction on thinning of Arabic handwriting
Authors:	Ali Mohammed Massud Mady (P49115)
Supervisor:	Khairuddin Omar, Prof Madya Dr.
Keywords:	Algorithms Voronoi diagram construction Thinning Arabic handwriting Voronoi polygons
Issue Date:	25-Jul-2011
Description:	The Voronoi Diagram (VD) is defined as a rediscovered mathematical concept from the 19th century. It is one of the most fundamental and useful constructions defined by irregular lattices. In this research, a comparative study of three VD algorithms is presented, and implemented on the thinning of Arabic handwriting. The objectives of this research are i) to study three construction algorithms of VD, which are the divideand- conquer algorithm, the half-plane intersection algorithm (as a static algorithm), and the incremental algorithm (as a dynamic algorithm); ii) to apply the three VD algorithms chosen above on thinning of Arabic handwriting; and iii) to compare the three algorithms of VD to find out the fastest and the best in construction. The three algorithms produced the final skeleton with the same number of points, but during the construction of VD, different number of vertices were obtained. Three stages were done in this research. The first stage includes edge detection, contour tracing, and sampling; whereas in the second stage, the VD is constructed using the three chosen algorithms. In the final stage, the medial axis is extracted by using the VD where vertices which are located within the text boundaries are kept and joined. The dataset used in this work consists of 569 handwritten Arabic binary images of Tunisian town names. By using the sampling interval R = 4, 481 generator points and 1362 vertices were obtained by using the divide-and-conquer algorithm, whereas 1401 vertices were obtained by the using half-plane intersection and incremental algorithms. The experimental results show that the divide-and-conquer algorithm was the fastest, while the incremental algorithm was the slowest.,Master/Sarjana
Pages:	59
Call Number:	QA278.2.M33 2011
Publisher:	UKM, Bangi
URI:	https://ptsldigital.ukm.my/jspui/handle/123456789/476145
Appears in Collections:	Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.