A Hybrid System for Handwritten Character Recognition with High Robustness
Bibliographic record
Abstract
In the past few decades, the offline recognition of handwritten Indic scripts has received much attention of researchers. Although an intensive research has been reported for various Indic languages, limited research work is carried out for handwritten Odia, Bangla character recognition owing to their complex shapes and the unavailability of the standard datasets. This paper proposes an automated model for recognizing both handwritten of Odia characters and numerals, along with Bangla numerals with maximum optimization efficiency. The proposed model primarily deals with feature optimization parameters which mainly comprises of three parts. Firstly, the fast discrete curvelet transform (FDCT) is used to derive multidirectional features from the character images. Secondly, PCA along with LDA is used to reduce the dimension of the feature vector. The features are finally subjected to both least-squares support vector machine (LS-SVM), and random forest (RF) for classification. The effectiveness of proposed model is evaluated over three benchmark datasets such as Odia handwritten character, Bangla numeral and Odia handwritten numeral. The efficacy of proposed model achieves superiority as compared to state-of-art techniques. The discriminatory prospective of FDCT along with PCA and LDA features is establish more suitable than its counterparts.
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.001 |
| 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.005 | 0.004 |
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".