Integrated multi-layer perceptron neural network and novel feature extraction for handwritten Arabic recognition
Bibliographic record
Abstract
Arabic handwritten script recognition presents an energetic area of study. These types of recognitions face several obstacles, such as vast open databases, boundless diversity in individuals' penmanship, and freestyle writing. Thus, Arabic handwriting requires effective techniques to achieve better recognition results. On the other hand, Multilayer Perceptron (MLP) is one of the most common Artificial Neural Networks (ANNs) which deals with various problems efficiently. Therefore, this study introduces a new technique called Block Density and Location Feature (BDLF) with MLP, namely BDLF-MLP, which aims to extract novel features from letter images and estimate the letter's pixel density and its location for each equal-sized block in the image. In other words, BDLF-MLP can deal with various styles of Arabic handwritten, such as overlapping letters. The BDLF-MLP starts with the Block Feature Extraction (BFE) of the image by dividing the image into sixteen parts. After that, it calculates the density and location of each block (i.e., BDLF) by finding the sum of all values inside blocks. Finally, it determines the position of the greatest pixel density to obtain better recognition accuracy. The dataset containing 720 images is used to evaluate the efficiency of the proposed technique. Also, 1440 letters are used for training and testing divided evenly between them. The experiment results illustrate that BDLF-MLP outperformed the other algorithms in the literature with an accuracy of 97.26 %.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".