z-logo
open-access-imgOpen Access
PENERAPAN METODE BACKRPOPAGATION UNTUK IDENTIFIKASI HURUF HIJAIYAH TULISAN TANGAN
Author(s) -
Ariesta Damayanti,
pujiatus syahara
Publication year - 2018
Publication title -
jsi : jurnal sistem informasi e-journal
Language(s) - English
Resource type - Journals
ISSN - 2355-4614
DOI - 10.36706/jsi.v10i1.5135
Subject(s) - backpropagation , computer science , artificial intelligence , pattern recognition (psychology) , preprocessor , artificial neural network , feature extraction , feature (linguistics) , handwriting , object (grammar) , image (mathematics) , computer vision , linguistics , philosophy
Hijaiyah letters are Arabic spelling letters that are the original language of the Qur'an. Just like other types of letters, the hijaiyah has certain shapes and characteristics that will form a certain pattern. By using the concept of artificial neural networks, can dibanguun a system that can recognize the pattern by doing the previous training. One of the most commonly used meotodes in artificial neural network paradigms is the crawling or backpropagation buffer. This hijaiyah letters identification system is built using the handwritten hijaiyah image data of 150 images. The feature or feature taken from the image is the binary value of the letter pattern and the number of objects contained in the letters. Prior to the feature extraction process, the image first passes the preprocessing stage consisting of color binerization, object widening, cropping, and resizing. The result obtained by backpropagation method is the system is able to recognize handwriting hijaiyah pattern well. All training data have been correctly identified, while as many as 150 test data can be identified as 77 letters with an accuracy of 51.33%. This accuracy value is obtained with the architectural arrangement of the number of hidden layer neurons = 60, minimum error = 0.001 and maximum iteration = 10000.keyword:backpropagation, biner, hijaiyah, , pattern, preprocessing

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here