One dimensional representation of two dimensional information for HMM based handwritten recognition

1998-10-07
In this study, we introduce a new set of one-dimensional discrete, constant length features to represent two dimensional shape information for HMM (Hidden Markov Model), based handwritten optical character recognition problem. The proposed feature set embeds the two dimensional information into a sequence of one-dimensional codes, selected from a code book. It provides a consistent normalization among distinct classes of shapes, which is very convenient for HMM based shape recognition schemes. The new feature set is used in a handwritten optical character recognition scheme, where a sequence of segmentation and recognition stages is employed. The normalization parameters, which maximize the recognition I ate, are dynamically, estimated in the training stage of HMM. The proposed character recognition system is tested on both a locally generated cursively handwritten data and isolated number digits of NIST database. The experimental results indicate high recognition rates.

Suggestions

Higher order approximate dynamic models for layered composites
Yalcin, Omer Fatih; Mengi, Yalcin; Turhan, Dogan (Elsevier BV, 2007-05-01)
Based on a higher order dynamic approximate theory developed in the present study for anisotropic elastic plates, two dynamic models, discrete and continuum models (DM and CM), are proposed for layered composites. Of the two models, CM is more important, which is established in the study of periodic layered composites using smoothing operations. CM has the properties: it contains inherently the interface and Floquet conditions and facilitates the analysis of the. composite, in particular, when the number of...
Coarse-to-Fine Isometric Shape Correspondence by Tracking Symmetric Flips
Sahillioğlu, Yusuf; Yemez, Y. (2013-02-01)
We address the symmetric flip problem that is inherent to multi-resolution isometric shape matching algorithms. To this effect, we extend our previous work which handles the dense isometric correspondence problem in the original 3D Euclidean space via coarse-to-fine combinatorial matching. The key idea is based on keeping track of all optimal solutions, which may be more than one due to symmetry especially at coarse levels, throughout denser levels of the shape matching process. We compare the resulting den...
Continuous dimensionality characterization of image structures
Felsberg, Michael; Kalkan, Sinan; Kruger, Norbert (Elsevier BV, 2009-05-04)
Intrinsic dimensionality is a concept introduced by statistics and later used in image processing to measure the dimensionality of a data set. In this paper, we introduce a continuous representation of the intrinsic dimension of an image patch in terms of its local spectrum or, equivalently, its gradient field. By making use of a cone structure and barycentric co-ordinates, we can associate three confidences to the three different ideal cases of intrinsic dimensions corresponding to homogeneous image patche...
Software metamaterials: Transformation media based multi-scale techniques for computational electromagnetics
Ozgun, Ozlem; Kuzuoğlu, Mustafa (2013-03-01)
This paper presents computational models employing special transformation-based media-which we call software metamaterials-for the purpose of enhancing the ability of numerical modeling methods for solving multi-scale electromagnetic boundary value problems involving features with multiple length or frequency scales or both. The multi-scale problems, in general, suffer from difficulties in mesh generation and the number of unknowns due to certain meshing requirements dictated by the fine features of the pro...
Low-Level Hierarchical Multiscale Segmentation Statistics of Natural Images
Akbaş, Emre (2014-09-01)
This paper is aimed at obtaining the statistics as a probabilistic model pertaining to the geometric, topological and photometric structure of natural images. The image structure is represented by its segmentation graph derived from the low-level hierarchical multiscale image segmentation. We first estimate the statistics of a number of segmentation graph properties from a large number of images. Our estimates confirm some findings reported in the past work, as well as provide some new ones. We then obtain ...
Citation Formats
N. Arica and F. T. Yarman Vural, “One dimensional representation of two dimensional information for HMM based handwritten recognition,” 1998, p. 948, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/62702.