Fusion of RNCNN-BRHA for Recognition of Telugu Word from Handwritten Text
Bibliographic record
Abstract
With the increasing proliferation of digital pictures, word retrieval (WR) algorithms have been intensively investigated. In general, WR service is relatively costly in terms of computing and storage resources. However, retrieving telugu words from handwritten text is difficult due to the wide range of curves and strokes in handwritten words. Deep learning for handwritten word identification from photos is an ongoing research topic with promising results. In this paper, thinning the words is performed, which helps in extraction of sharp features. After performing thinning operation for given input word, features are extracted using residual network (RN) structure in CNN, BRISK and HARRIS algorithms to identify the word from the handwritten text. These three are combined and termed as RNCNN-BRHA model. The features are evaluated to check the performance of proposed RNCNN-BRHA technique in retrieval of telugu words. The CNN utilized has various innovative features, such as the utilization of several completely linked branches. When applied to all regularly used handwriting recognition criteria, our technique surpasses all current algorithms by a wide margin. The PSNR value obtained using the proposed model is 26.94 which is far better compared to techniques like hilditch algorithm and morphological operation.
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.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
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".