Text recognition using two-dimensional stochastic models

Image analysis – Pattern recognition – Feature extraction

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

382228, G06K 950, G06K 962

Patent

active

057871981

ABSTRACT:
Pseudo two-dimensional hidden Markov models (HMMs) are used to represent text elements, such as characters or words. Observation vectors for each text element are based on pixel maps obtained by optical scanning. A character is represented by a pseudo two-dimensional HMM having a number of superstates, with each superstate having at least one state. Text elements are compared with such models by using the Viterbi algorithm, first in connection with the states in each superstate, then the superstates themselves, to calculate the probability that a particular model represents the text element. Parameters for the models are generated by training routines. Probabilities can be adjusted to compensate for changes in scale, translations, slant, and rotation.
An embodiment is also disclosed for identifying keywords in a body of text. A first pseudo two-dimensional HMM is created for the words that may appear in the text. Each word in the text is compared with both models, again using the Viterbi algorithm, to calculate probabilities that the model represents the subject word. If the probability for the keyword is greater than that for the extraneous words, the subject word is identified as being the keyword. Preprocessing steps for reducing the number of words to be compared can be added.

REFERENCES:
patent: 4155072 (1979-05-01), Kawa
patent: 4227177 (1980-10-01), Moshier
patent: 4754489 (1988-06-01), Bokser
patent: 4783804 (1988-11-01), Juang et al.
patent: 4805225 (1989-02-01), Clark
patent: 4977599 (1990-12-01), Bahl et al.
patent: 5020112 (1991-05-01), Chou
patent: 5105470 (1992-04-01), Will
patent: 5199077 (1993-03-01), Wilcox et al.
patent: 5321773 (1994-06-01), Kopec et al.
patent: 5438630 (1995-08-01), Chen et al.
J. Wilpon, et al., "Automatic Recognition of Key words in Unconstrained Speech Using Hidden Markov Models", IEEE Trans. Acoust. Speech Signal Processing, vol. 38, pp. 1870-1878, Nov. 1990.
E. Levin and R. Pieraccini, "Dynamic Planar Warping for Optical Character Recognition", IEEE, ICASSP'92, vol. 3, pp. 149-152.
H. Baird, "Global-to-local layout Analysis", Proc. of the IAPR Workshop on Syntactic and Structural Pattern Recognition, France, Sep. 1988.
S. Srihari and G. Zack, "Document Image Analysis", Proc. of the 8th Int. Conf. on Pattern Recognition, Paris, Oct, 1986.
T. Pavlidis, "A Vectorizer and Feature Extractor for Document Recognition" Computer Vision, Graphics and Image Processing, vol. 35, pp. 11-127, 1986.
L. Rabiner, "A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition", Proc. of the IEEE, vol. 77, pp. 257-286, Feb. 1989.
L. Rabiner, et al., "A Segmental k-Means Training Procedure for Connected Word Recognition Based on Whole Word Reference Patterns", AT&T Tech. J., vol. 65, pp. 21-36, May 1986.
C. Bose and S. Kuo, "Connected and Degraded Text Recognition Using Hidden Markov Model", Proc. of the 11th Int. Conf. on Pattern Recognition, 1992.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Text recognition using two-dimensional stochastic models does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Text recognition using two-dimensional stochastic models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Text recognition using two-dimensional stochastic models will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-29573

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.