Please use this identifier to cite or link to this item: https://repository.sustech.edu/handle/123456789/4834
Title: Solving Problems of Thinned Handwritten Arabic words by Zhang and Suen Algorithms
Other Titles: ‫حل المشكلات ‫الىاتجة مه ترقيق الكلمات العربية المكتوبة‬ ‫بإستخدام بخوارزمية زاوق و سون‬‬
Authors: Mergani, Waleed Ali
Supervisor - Mohammed Alhafiz Mustafa
Keywords: Thinned Handwritten
Arabic words
Algorithms
Zhang and Suen Algorithms
Issue Date: 1-Jun-2013
Publisher: Sudan University of Science and Technology
Citation: Mergani,Waleed Ali.Solving Problems of Thinned Handwritten Arabic words by Zhang and Suen Algorithms/ Waleed Ali Mergani؛ Mohammed Alhafiz Mustafa .-Khartoum : sudan university of science and technology, computer science,2013.-54p:ill;28cm.-M.Sc.
Abstract: The aim of this study is to solve the artificial loops problem resulting from the Thinning process on Arabic names handwriting. The main idea of the proposed solution is to find a threshold for the artificial loop radius this threshold is used to differentiate artificial loops from real ones. The proposed solution has been applied on a suitable and representative subset of SUST- ARG names dataset. To find this threshold opening process has been applied with different radius values on binary images. Those values ranging between 1 pixel and line width of the word where the line width has been estimated using a proposed algorithm, then Zhang and Suen thinning algorithm has been applied. The thesis experiments find that using radius value of 2 pixels gives best result in term of solving artificial loops as well as identify very small numbers of real loops as artificial loops.
Description: Thesis
URI: http://repository.sustech.edu/handle/123456789/4834
Appears in Collections:Masters Dissertations : Computer Science and Information Technology

Files in This Item:
File Description SizeFormat 
Solving Problems of Thinned ....pdf
  Restricted Access
Research5.17 MBAdobe PDFView/Open Request a copy


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