Weighted finite transducers in image processing
✍ Scribed by Karel Culik II; Ivan Friš
- Book ID
- 104184529
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 940 KB
- Volume
- 58
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We survey the use of weighted finite-state transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for hidden Markov models (HMMs), context-dependency, pronunciation dictionaries, grammars, and alternative recognition outputs. Furthermore, general tr
From common consumer products such as cell phones and MP3 players to more sophisticated projects such as human-machine interfaces and responsive robots, speech technologies are now everywhere. Many think that it is just a matter of time before more applications of the science of speech become inesca
Weighted finite automata (WFA) define real functions, in particular, grayness functions of graytone images. Inference algorithm that converts an arbitrary function (graytone image) into a WFA that can regenerate it is given in [7]. In this paper we define the theoretical construct of Cooperating Dis