2016
DOI: 10.9734/bjmcs/2016/20376
|View full text |Cite
|
Sign up to set email alerts
|

Recognition of Typewritten Characters Using Hidden Markov Models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2017
2017

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…In evolution if the process in the HMM is a first order Markov Chain, the probabilities of the system in particular state s (t) at time t depends on its state at s (t-1) [86,87,91,92] . The probability of the HMM being in state s j at time t having generated the first t emission that is the partial probability αj (t) [86,87,92]: This is the algorithm that produces the most probable sequence of hidden states given some observations [90,93]. It applies viterbi algorithm, which is also a trellis algorithm.…”
Section: Evolutionmentioning
confidence: 99%
See 1 more Smart Citation
“…In evolution if the process in the HMM is a first order Markov Chain, the probabilities of the system in particular state s (t) at time t depends on its state at s (t-1) [86,87,91,92] . The probability of the HMM being in state s j at time t having generated the first t emission that is the partial probability αj (t) [86,87,92]: This is the algorithm that produces the most probable sequence of hidden states given some observations [90,93]. It applies viterbi algorithm, which is also a trellis algorithm.…”
Section: Evolutionmentioning
confidence: 99%
“…Using the auxiliary quantity, an estimated version á ij of a ij can now be calculated by [87,91,92]:…”
Section: Learningmentioning
confidence: 99%