𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Image Representation using Distributed Weighted Finite Automata

✍ Scribed by Y. Sivasubramanyam; Kamala Krithivasan

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
245 KB
Volume
46
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

✦ Synopsis

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 Distributed Weighted Finite Automata with n-components(n-WFA) and study the power of this construct in various modes of acceptance. We give an inference algorithm and the de-inference algorithm for the n-WFA.

📜 SIMILAR VOLUMES

Unification and extension of weighted fi
Unification and extension of weighted finite automata applicable to image compression
✍ Zhuhan Jiang; Olivier de Vel; Bruce Litow 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 503 KB

Weighted ÿnite automata (WFA), including the linear WFA due to Culik and Kari and the acyclic WFA due to Hafner, have been under investigation over the years for their applications to image compression. We shall in this work ÿrst examine in great details the underlying WFA structure and propose the

Classification of spatiotemporal hemodyn
Classification of spatiotemporal hemodynamics from brain perfusion MR images using expectation-maximization estimation with finite mixture of multivariate gaussian distributions
✍ Yu-Te Wu; Yen-Chun Chou; Wan-Yuo Guo; Tzu-Chen Yeh; Jen-Chuen Hsieh 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 1024 KB

## Abstract The ability to cluster different perfusion compartments in the brain is critical for analyzing brain perfusion. This study presents a method based on a mixture of multivariate Gaussians (MoMG) and the expectation‐maximization (EM) algorithm to dissect various perfusion compartments from