Character Verification Model Improves OCR Accuracy for Visually Similar Characters

arXiv CS · · 2 min read · Engineering & Technology

Read research and analysis on Character Verification Model Improves OCR Accuracy for Visually Similar Characters published by ICANEWS, a global research journal for emerging researchers.

Key Takeaways

  • The CVM framework improves OCR accuracy by 3.95-14.81 percentage points.
  • It achieves an 87.3% correction rate for visually similar character errors.
  • The false-correction rate of the CVM is 2.3%.

Why This Matters

The CVM addresses a critical challenge in OCR by specifically correcting visually ambiguous characters, which can improve accuracy in applications relying on non-lexical data like serial numbers or license plates. Its modular design allows integration into existing OCR systems, enhancing their performance without requiring fundamental changes.

Overview

Optical character recognition (OCR) systems encounter persistent challenges in distinguishing visually similar characters, leading to errors in the digitization of text. This issue affects critical applications. While existing methods such as image preprocessing and word-level post-processing address certain OCR limitations, they do not specifically target character-level visual ambiguity. The Character Verification Model (CVM) is introduced as a character-level post-processing framework designed to verify and correct ambiguous characters in OCR outputs. This model utilizes specialized binary classifiers that are trained on character pairs that are visually confusable, including examples such as 'O'/'0', 'Z'/'2', and 'S'/'5'.

Research Context

Current OCR methodologies face an inherent limitation concerning visually similar characters. This property, intrinsic to certain character pairs, restricts the accuracy of even advanced OCR models. Preprocessing techniques primarily focus on enhancing image quality, while word-level post-processing typically corrects spelling errors by leveraging dictionary validation. However, these approaches do not address the specific problem of character-level visual ambiguity. The CVM addresses this gap by operating independently of dictionary validation, which broadens its applicability to non-lexical data types such as serial numbers, alphanumeric codes, and license plates.

Approach

The Character Verification Model (CVM) employs a post-processing framework at the character level. Its core mechanism involves specialized binary classifiers. These classifiers are trained specifically on character pairs identified as visually confusable. The framework's modular design allows for integration with existing OCR pipelines without necessitating modifications to the underlying recognition models. This independent operational capability, separate from dictionary validation, enables its use across a range of data where lexical context is absent.

Findings

Experiments were conducted using three distinct OCR engines: Tesseract, EasyOCR, and TrOCR. The evaluation also incorporated ten different fonts, varying in complexity from low to high. The CVM demonstrated improvements in accuracy ranging from 3.95 to 14.81 percentage points. Specifically, the model achieved an 87.3% correction rate for errors involving visually similar characters. The associated false-correction rate was measured at 2.3%.

Why This Matters

The described approach offers a method to enhance the reliability of text digitization in applications where character-level accuracy is critical, particularly for data that lacks lexical context. Its ability to integrate with existing OCR systems without requiring modifications to core recognition models streamlines adoption. This is relevant for domains processing alphanumeric codes, serial numbers, and license plates, where visual ambiguity can lead to errors.

Research Information

Institution
arXiv CS
Original Study
View Publication
Source
arXiv CS

About ICANEWS

ICANEWS is a global research journal for emerging researchers, publishing student and emerging researcher work across all fields.