Modified region decomposition method and optimal depth decision tree in the recognition of non-uniform sized characters - An experimentation with Kannada characters

P. Nagabhushan, Radhika M. Pai

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

In contrast to English alphabets, some characters in Indian languages such as Kannada, Hindi, Telugu may have either horizontal or vertical or both the extensions making it difficult to enclose every such character in a standard rectangular grid as done quite often in character recognition research. In this work, an improved method is proposed for the recognition of such characters (especially Kannada characters), which can have spread in vertical and horizontal directions. The method uses a standard sized rectangle which can circumscribe standard sized characters. This rectangle can be interpreted as a two-dimensional, 3×3 structure of nine parts which we define as bricks. This structure is also interpreted as consecutively placed three row structures of three bricks each or adjacently placed three column structures of three bricks each. It is obvious that non-uniform sized characters cannot be contained within the standard rectangle of nine bricks. The work presented here proposes to take up such cases. If the character has horizontal extension, then the rectangle is extended horizontally by adding one column structure of three bricks at a time, until the character is encapsulated. Likewise, for vertically extended characters, one row structure is added at a time. For the characters which are smaller than the standard rectangle, one column structure is removed at a time till the character fits in the shrunk rectangle. Thus, the character is enclosed in a rectangular structure of m×n bricks where m≥3 and n≥1. The recognition is carried out intelligently by examining certain selected bricks only instead of all mn bricks. The recognition is done based on an optimal depth logical decision tree developed during the Learning phase and does not require any mathematical computation.

Original languageEnglish
Pages (from-to)1467-1475
Number of pages9
JournalPattern Recognition Letters
Volume20
Issue number14
Publication statusPublished - 12-1999

Fingerprint

Decision trees
Brick
Decomposition
Character recognition

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

@article{0d7e126006da4302a0c7eac02ad4c257,
title = "Modified region decomposition method and optimal depth decision tree in the recognition of non-uniform sized characters - An experimentation with Kannada characters",
abstract = "In contrast to English alphabets, some characters in Indian languages such as Kannada, Hindi, Telugu may have either horizontal or vertical or both the extensions making it difficult to enclose every such character in a standard rectangular grid as done quite often in character recognition research. In this work, an improved method is proposed for the recognition of such characters (especially Kannada characters), which can have spread in vertical and horizontal directions. The method uses a standard sized rectangle which can circumscribe standard sized characters. This rectangle can be interpreted as a two-dimensional, 3×3 structure of nine parts which we define as bricks. This structure is also interpreted as consecutively placed three row structures of three bricks each or adjacently placed three column structures of three bricks each. It is obvious that non-uniform sized characters cannot be contained within the standard rectangle of nine bricks. The work presented here proposes to take up such cases. If the character has horizontal extension, then the rectangle is extended horizontally by adding one column structure of three bricks at a time, until the character is encapsulated. Likewise, for vertically extended characters, one row structure is added at a time. For the characters which are smaller than the standard rectangle, one column structure is removed at a time till the character fits in the shrunk rectangle. Thus, the character is enclosed in a rectangular structure of m×n bricks where m≥3 and n≥1. The recognition is carried out intelligently by examining certain selected bricks only instead of all mn bricks. The recognition is done based on an optimal depth logical decision tree developed during the Learning phase and does not require any mathematical computation.",
author = "P. Nagabhushan and Pai, {Radhika M.}",
year = "1999",
month = "12",
language = "English",
volume = "20",
pages = "1467--1475",
journal = "Pattern Recognition Letters",
issn = "0167-8655",
publisher = "Elsevier",
number = "14",

}

TY - JOUR

T1 - Modified region decomposition method and optimal depth decision tree in the recognition of non-uniform sized characters - An experimentation with Kannada characters

AU - Nagabhushan, P.

AU - Pai, Radhika M.

PY - 1999/12

Y1 - 1999/12

N2 - In contrast to English alphabets, some characters in Indian languages such as Kannada, Hindi, Telugu may have either horizontal or vertical or both the extensions making it difficult to enclose every such character in a standard rectangular grid as done quite often in character recognition research. In this work, an improved method is proposed for the recognition of such characters (especially Kannada characters), which can have spread in vertical and horizontal directions. The method uses a standard sized rectangle which can circumscribe standard sized characters. This rectangle can be interpreted as a two-dimensional, 3×3 structure of nine parts which we define as bricks. This structure is also interpreted as consecutively placed three row structures of three bricks each or adjacently placed three column structures of three bricks each. It is obvious that non-uniform sized characters cannot be contained within the standard rectangle of nine bricks. The work presented here proposes to take up such cases. If the character has horizontal extension, then the rectangle is extended horizontally by adding one column structure of three bricks at a time, until the character is encapsulated. Likewise, for vertically extended characters, one row structure is added at a time. For the characters which are smaller than the standard rectangle, one column structure is removed at a time till the character fits in the shrunk rectangle. Thus, the character is enclosed in a rectangular structure of m×n bricks where m≥3 and n≥1. The recognition is carried out intelligently by examining certain selected bricks only instead of all mn bricks. The recognition is done based on an optimal depth logical decision tree developed during the Learning phase and does not require any mathematical computation.

AB - In contrast to English alphabets, some characters in Indian languages such as Kannada, Hindi, Telugu may have either horizontal or vertical or both the extensions making it difficult to enclose every such character in a standard rectangular grid as done quite often in character recognition research. In this work, an improved method is proposed for the recognition of such characters (especially Kannada characters), which can have spread in vertical and horizontal directions. The method uses a standard sized rectangle which can circumscribe standard sized characters. This rectangle can be interpreted as a two-dimensional, 3×3 structure of nine parts which we define as bricks. This structure is also interpreted as consecutively placed three row structures of three bricks each or adjacently placed three column structures of three bricks each. It is obvious that non-uniform sized characters cannot be contained within the standard rectangle of nine bricks. The work presented here proposes to take up such cases. If the character has horizontal extension, then the rectangle is extended horizontally by adding one column structure of three bricks at a time, until the character is encapsulated. Likewise, for vertically extended characters, one row structure is added at a time. For the characters which are smaller than the standard rectangle, one column structure is removed at a time till the character fits in the shrunk rectangle. Thus, the character is enclosed in a rectangular structure of m×n bricks where m≥3 and n≥1. The recognition is carried out intelligently by examining certain selected bricks only instead of all mn bricks. The recognition is done based on an optimal depth logical decision tree developed during the Learning phase and does not require any mathematical computation.

UR - http://www.scopus.com/inward/record.url?scp=0033334080&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033334080&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0033334080

VL - 20

SP - 1467

EP - 1475

JO - Pattern Recognition Letters

JF - Pattern Recognition Letters

SN - 0167-8655

IS - 14

ER -