Scribd
Upload
39 views10 pages

Text Detection and Recognition

The document discusses text detection and recognition from images using stroke width transform (SWT). SWT involves 3 steps: 1) applying SWT to group pixels into letter candidates based on similar stroke width, 2) finding letter candidates by applying rules to component properties, 3) grouping letter candidates into text regions by removing false candidates using rules about spacing, size ratios between letters. Feature vectors are then extracted from segmented text for training a recognition model, including histogram projections and zero crossing histograms.

Uploaded by

Kumar Gaurav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
39 views10 pages

Text Detection and Recognition

The document discusses text detection and recognition from images using stroke width transform (SWT). SWT involves 3 steps: 1) applying SWT to group pixels into letter candidates based on similar stroke width, 2) finding letter candidates by applying rules to component properties, 3) grouping letter candidates into text regions by removing false candidates using rules about spacing, size ratios between letters. Feature vectors are then extracted from segmented text for training a recognition model, including histogram projections and zero crossing histograms.

Uploaded by

Kumar Gaurav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

Introduction

Text Detection and Recognition

Problem Domain and Assumptions


Given an RGB image , I have to give the text present in
it.
Text detected can be either on a dark background or a
dark text on a light background.

Stroke Width Transform


It can be broken down into 3 steps: SWT, grouping
pixels into letter candidates based on their stroke width
and finally grouping letter candidates into regions of
text.
A stroke in the image is a continuous band of nearly
constant width.

SWT

Flowchart

Finding letter candidates


This is done by first grouping pixels with similar stroke
width and then applying several rules to distinguish the
letter candidates like variance of stroke width within a
component must not be too big, aspect ration of a
component must not be within a small range, ignore
components whose size is too large or too small.

Grouping letter candidates into text


regions
This is mainly removing false letter candidates.
Some set of rules like two letter candidates should have
similar stroke width, ratio between height and width of
letters should be less than 2.5, distance between letters
must not exceed three times the width of wider one.

Results

Results

Recognition
Divided into 3 parts:
1) Segmentation
2) Feature Vector
3) Training
Coding for Segmentation and feature vector done.
Features taken:
4) Histogram Projection based on mean distance
5) Histogram Projection based on pixel value
6) Vertical zero crossing
7) Horizontal Zero crossing

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy