An inverse problem of constructing birth and death processes {X(t)} on finite state space {0, 1, 2 .... , N} is considered. Given a set of 2N + 1, distinct, nonnegative real numbers one of which is zero, say 0 ~ SO < Zl < 82 < "'" < ZN < SN~ a procedure is established to obtain the birth and death r
An inverse problem in neural processing
✍ Scribed by M. N. Oğuztöreli; T. M. Caelli
- Publisher
- Springer-Verlag
- Year
- 1986
- Tongue
- English
- Weight
- 536 KB
- Volume
- 53
- Category
- Article
- ISSN
- 0340-1200
No coin nor oath required. For personal study only.
✦ Synopsis
Any neural network aimed at the coding sensory events must contain computational properties which generally allow the organism to reconstruct the input signals with some degree of accuracy--else the association between stimulus and response would, at best, be uncertain. In this paper we investigate the problem of reconstructing external input signals to neural networks when the activity profiles of only some of its member cells are known. The evolution and activities of such cells are defined by an earlier formulation of one of us (Oğuztöreli 1979) and, here, we restrict our application to local circuits within the vertebrate retina. Solutions to this inverse coding problem are presented for specific network equations and exemplified with 1, 3, and 5 neuron cases.
📜 SIMILAR VOLUMES