# Consistent Recovery of Sensory Stimuli Encoded with MIMO Neural Circuits

Authors: Aurel A. Lazar; Eftychios A. Pnevmatikakis
Journal: Computational Intelligence and Neuroscience
 (2010)

---

## Abstract

We consider the problem of reconstructing finite energy stimuli encoded with a population of spiking leaky integrate-and-fire neurons. The reconstructed signal satisfies a consistency condition: when passed through the same neuron, it triggers the same spike train as the original stimulus. The recovered stimulus has to also minimize a quadratic smoothness optimality criterion. We formulate the reconstruction as a spline interpolation problem for scalar as well as vector valued stimuli and show that the recovery has a unique solution. We provide explicit reconstruction algorithms for stimuli encoded with single as well as a population of integrate-and-fire neurons. We demonstrate how our reconstruction algorithms can be applied to stimuli encoded with ON-OFF neural circuits with feedback. Finally, we extend the formalism to multi-input multi-output neural circuits and demonstrate that vector-valued finite energy signals can be efficiently encoded by a neural population provided that its size is beyond a threshold value. Examples are given that demonstrate the potential applications of our methodology to systems neuroscience and neuromorphic engineering.


---

## Body

## 1. Introduction

Formal spiking neuron models, such as integrate-and-fire (IAF) neurons, encode information in the time domain [1]. Assuming that the input is bandlimited with a known bandwidth, a perfect recovery of the stimulus from the train of spikes is possible provided that the spike density is above the Nyquist rate [2]. Using results from frame theory [3] and statistics [4], these findings were extended to (i) bandlimited stimuli encoded with a population of IAF neurons with receptive fields modeled as linear filterbanks [5], (ii) multivariate (e.g., space-time) bandlimited stimuli encoded with a population of IAF neurons with Gabor spatiotemporal receptive fields [6], and (iii) sensory stimuli encoded with a population of leaky integrate-and-fire (LIF) neurons with random thresholds [7].These results are based on the key insight that neural encoding of a stimulus with a population of LIF neurons is akin to taking a set of measurements on the stimulus. These measurements or encodings can be represented as projections (inner products) of the stimulus on a set of sampling functions. Stimulus recovery therefore calls for the reconstruction of the encoded stimuli from these inner products. These findings have shown that sensory information can be faithfully encoded into the spike trains of a neural ensemble and can serve as a theoretical basis for modeling of sensory systems (e.g., auditory, vision) [8].In this paper we investigate the problem of reconstructing scalar and vector stimuli from a population of spike trains on a finite time horizon. The encoding circuits considered are either single-input multi-output or multi-input multi-output (MIMO). The increasing availability of multi-neuron population recordings has led to a paradigm shift towards population-centric approaches of neural coding and processing. Examples of MIMO models in systems neuroscience include extensive investigations of spike train transformations between neuron populations [9] as well as the analysis of the causal relationships between neurons in a population [10]. In neuromorphic engineering MIMO models have been used for brain-machine interfaces [11], as well as silicon retinas and related hardware applications [12].The stimuli considered in this paper have finite energy and are defined on a finite time horizon. Even though restricted to finite time intervals, finite energy signals have infinite degrees of freedom. Consequently, the formal stimulus recovery is ill-defined. We cast the stimulus reconstruction problem in the abstract spline theory [13] and recover the stimulus as the unique solution to an interpolation spline problem. Splines serve as a valuable mathematical tool for interpolation problems, and their applications arise in many areas such as data smoothing in statistics [4], computer graphics [14], and digital signal processing [15].Through the formulation of the interpolation spline problem, the reconstructed signal will give the same measurements as the original one. We show that this leads to a signal recovery that isconsistent in the sense that the reconstructed signal triggers exactly the same spike train when passed through the same neuron as the original stimulus. The reconstructed signal is also required to achieve a maximum degree of smoothness gauged by a quadratic criterion. This condition ensures that the problem has a unique optimal solution.A preliminary version of some of the ideas presented here appears in [16]. The analysis was based on results arising in generalized sampling [17]. Here the theory is presented in a more general setting using the spline theoretic framework, and all proofs are included. We apply our theoretical results to stimuli encoded with a number of spiking neural circuits of interest. These include populations of integrate-and-fire neurons with linear receptive fields that arise in hearing, ON-OFF neural circuits with feedback that arise in vision and multi-input multi-output (MIMO) neural circuits that arise in olfaction.Formally, MIMO neural circuits encodeM-dimensional vector-valued finite energy stimuli into the spike trains of a population of N neurons. Their architecture consists of an N×M linear, time invariant filtering kernel that feeds into an ensemble of N neurons. For this novel neural circuit we formulate and solve the problem of optimal consistent recovery and also discuss some of the key conditions that the filtering kernel has to satisfy in order to get a good reconstruction.The paper is organized as follows. Section2 formulates the problem of consistent reconstruction on a finite time horizon as a spline interpolation problem and presents its general solution. In Section 3 the reconstruction problem is addressed for stimuli encoded with a population of LIF neurons. Section 4 presents general MIMO neural encoding circuits and the corresponding optimal consistent stimulus reconstruction. A neuroscience inspired example is presented where the filtering kernel performs arbitrary (but known) delays and scalings to input stimuli akin to simple synaptic models. Finally Section 5 concludes our work.


## 2. Encoding with LIF Neurons and Consistent Stimulus Recovery

In this section we formulate and solve the problem of optimal consistent reconstruction for the simple case of a stimulus encoded with a single LIF neuron. We show how the spiking of an LIF neuron can be associated with a series of projections in the generalL2 space. We impose intuitive constraints on the desired reconstructed signal and show that the reconstruction algorithm can be reduced to a spline interpolation problem.


### 2.1. Neural Encoding with Single LIF Neurons

Letu=u(t),t∈[0,T], be a signal (or stimulus) of finite length and energy, that is, u∈L2([0,T]). In what follows we assume that the stimulus u is the input to a Leaky Integrate-and-Fire (LIF) neuron. Throughout this paper (tk),k=1,2,…,n, denotes the set of recorded spikes. As in the case of bandlimited signals [5], neuron encoding can be associated with the projection (measurement) of the stimulus on a set of functions. By applying the t-transform [2], we can determine both the sampling functions and the projections of the stimulus on these functions using only the knowledge of the spike times.Assume that the encoder is an LIF neuron, with thresholdδ, capacitance C, resistance R, and constant bias b. The membrane potential of the LIF neuron is governed by the differential equation(1)CdV(t)dt=-V(t)R+u(t)+b
with the initial condition V(0)=0 and reseting conditions(2)V(tk)=δ⇒limt→tk+V(t)=0
for all t∈[0,T], and k=1,2,…,n. By solving the differential equation in each interspike interval, the t-transform of the LIF neuron is given by(3)∫tktk+1(u(s)+b)exp(-tk+1-sRC)ds=Cδ
for all k,k=1,2,…,n-1. The t-transform can be rewritten as(4)Lku=qk,
where Lk:L2([0,T])↦ℝ is a linear functional given by(5)Lku=∫tktk+1u(s)exp(-tk+1-sRC)ds,(6)qk=Cδ-bRC(1-exp(-tk+1-tkRC))
for all k=1,2,…,n-1. Therefore, we have the following result.Lemma 1.
Thet-transform of the LIF neuron can be written in inner-product form as
(7)〈u,ϕk〉=qk,
where
(8)ϕk(t)=exp(-tk+1-tRC)1[tk,tk+1](t),
and 〈·,·〉:L2([0,T])×L2([0,T])↦ℝ is the standard L2 inner product restricted to the domain [0,T] for all k=1,2,…,n-1.Remark 2.
The inner products or projections〈u,ϕk〉,k=1,2,…,n-1, in (7) represent a set of measurements or encodings of the signal u on [0,T]. Since (ϕk) and (qk),k=1,2,…,n-1, in (6) can be readily derived from the knowledge of the spike times and the neuron parameters, the signal encodings are available to an observer reading the spike times (tk),k=1,2,…,n-1.


### 2.2. Consistent Stimulus Recovery

The problem of stimulus reconstruction calls for estimating the signalu given the set of spikes (tk),k=1,2,…,n. This problem is, for the class of stimuli u∈L2([0,T]), ill-defined. (Signals that lie in a L2 space have, in general, infinite degrees of freedom and thus cannot be perfectly recovered by a finite number of observations.) A remedy is provided by introducing a set of constraints on the recovery. The first constraint considered here requires the reconstructed signal û to generate the same spikes as the original stimulus. The second constraint requires choosing among the reconstructed stimuli the one with the maximum degree of smoothness. The latter is formulated as an optimization criterion.Definition 3.
A reconstructionû of u based on the spike times (tk),k=1,2,…,n, is said to be consistent if û triggers exactly the same spike train as the original stimulus u.Remark 4.
As before, assume that at time 0 the membrane potential of the LIF neuron is set to the resting potential 0. Then the consistency condition above is equivalent with(9)〈u,ϕk〉=〈û,ϕk〉
for all k,k=1,2,…,n-1.Definition 5.
A consistent reconstructionû that minimizes the quadratic criterion
(10)∥Ju∥=(∫0T(d2uds2)2ds)1/2
is called the optimal consistent reconstruction ofu.Remark 6.
∥Ju∥ is the norm of the second derivative of the reconstructed stimulus.Lemma 7.
The optimal consistent reconstructionû solves the  spline interpolation  problem
(11)û=argmin〈u,ϕk〉=qk∥d2udt2∥,
where ∥·∥ is the standard L2-norm restricted to the interval [0,T].Proof.
It follows directly from Definitions3 and 5.Remark 8.
An introduction to splines and the general solution to spline interpolation problems is presented in the AppendixA.Theorem 9.
The optimal consistent reconstruction is unique and is given by(12)û(t)=d0+d1t+∑k=1n-1ckψk(t),
where
(13)ψk(t)=(ϕk*|·|3)(t)=∫tktk+1|t-s|3exp(-tk+1-sRC)ds,
where * denotes the convolution, and |·| denotes the absolute value. With c=[c1,c2,…,cn-1]T, d=[d0,d1] and q=[q1,q2,…,qn-1]T the coefficients c and d satisfy the matrix equations
(14)[GprpT00rT00][cd0d1]=[q00].
Moreover G is an (n-1)×(n-1) matrix, and pandr are column vectors with entries given by
(15)[p]k=〈ϕk,1〉,[r]k=〈ϕk,t〉,[G]kl=〈ϕk,ψl〉,
where all the inner products are restricted to the interval [0,T].Proof.
The proof follows from Theorem4 in Appendix A. Note that the function |·|3 is up to a multiplicative constant Green's function for the second-order iterated Laplacian. (See Lemma 5 in Appendix B).
The representation functions (13) can be explicitly given in analytical form as
(16)ψk(t)(RC)4={f(tk+1-tRC)-f(tk-tRC)×exp(-tk+1-tkRC),t≤tk,12exp(-tk+1-tRC)+f(tk+1-tRC)+f(tk-tRC)exp(-tk+1-tkRC),tk<t≤tk+1,f(tk-tRC)exp(-tk+1-tkRC)-f(tk+1-tRC),t>tk+1,
where f(x)=x3-3x2+6x-6. The entries of the matrix G are given by
(17)[G]kl(RC)5=[g(tl+1-tk+1RC)-g(tl+1-tkRC)exp(-tk+1-tkRC)-g(tl-tk+1RC)exp(-tl+1-tlRC)+g(tl-tkRC)exp(-tk+1-tkRC-tl+1-tlRC)]·1(k<l)+[6(1-exp(-2(tk+1-tk)RC))-2g(tk+1-tkRC)exp(-tk+1-tkRC)]·1(k=l)+[g(tk+1-tl+1RC)-g(tk+1-tlRC)exp(-tl+1-tlRC)-g(tk-tl+1RC)exp(-tk+1-tkRC)+g(tk-tlRC)exp(-tl+1-tlRC-tk+1-tkRC)]·1(k>l)
with g(x)=x3+6x. Finally
(18)[p]k=RC(1-exp(-tk+1-tkRC))[r]k=(RC)2((tk+1RC-1)-(tkRC-1)exp(-tk+1-tkRC)).Remark 10.
By lettingR→∞, one obtains the representation of the optimal consistent reconstruction for stimuli encoded with the ideal IAF neuron. The parameters and representation functions take a simple form:
(19)limR→∞ϕk(t)=1[tk,tk+1](t),limR→∞qk=Cδ-b(tk+1-tk),limR→∞ψk(t)=∫tktk+1|t-s|3ds={0.25[(t-tk+1)4-(t-tk)4],t≤tk,0.25[(t-tk+1)4+(t-tk)4],tk<t≤tk+1,0.25[(t-tk)4-(t-tk+1)4],t>tk+1,limR→∞[p]k=tk+1-tk,limR→∞[r]k=(tk+1)2-(tk)22,limR→∞[G]kl={0.05[(tk+1-tl+1)5+(tk-tl)5-(tk-tl+1)5-(tk+1-tl)5],k<l,0.1(tk+1-tk)5,k=l,0.05[(tl+1-tk+1)5+(tl-tk)5-(tl-tk+1)5-(tl+1-tk)5],k>l.


### 2.3. Example

The input to an LIF neuron is a bandlimited signal with bandwidth of100 Hz. The neuron encodes the stimulus during the time interval [0,0.2] second. A bias equal to b=3 is also added to the input. The parameters of the LIF neuron are δ=0.8,C=0.01,andR=50. Under these conditions the neuron generated 78 spikes. The recovered signal is shown in Figure 1. In order to quantify the quality of the recovery, we used the signal-to-noise ratio (SNR) defined by(20)SNR=10log10(∥u∥2∥u-û∥2).
In the above SNR definition the noise corresponds to the error between the original and reconstructed signal. The SNR was equal to 47.53 dB.Figure 1
Encoding and reconstruction with a single LIF neuron.


## 2.1. Neural Encoding with Single LIF Neurons

Letu=u(t),t∈[0,T], be a signal (or stimulus) of finite length and energy, that is, u∈L2([0,T]). In what follows we assume that the stimulus u is the input to a Leaky Integrate-and-Fire (LIF) neuron. Throughout this paper (tk),k=1,2,…,n, denotes the set of recorded spikes. As in the case of bandlimited signals [5], neuron encoding can be associated with the projection (measurement) of the stimulus on a set of functions. By applying the t-transform [2], we can determine both the sampling functions and the projections of the stimulus on these functions using only the knowledge of the spike times.Assume that the encoder is an LIF neuron, with thresholdδ, capacitance C, resistance R, and constant bias b. The membrane potential of the LIF neuron is governed by the differential equation(1)CdV(t)dt=-V(t)R+u(t)+b
with the initial condition V(0)=0 and reseting conditions(2)V(tk)=δ⇒limt→tk+V(t)=0
for all t∈[0,T], and k=1,2,…,n. By solving the differential equation in each interspike interval, the t-transform of the LIF neuron is given by(3)∫tktk+1(u(s)+b)exp(-tk+1-sRC)ds=Cδ
for all k,k=1,2,…,n-1. The t-transform can be rewritten as(4)Lku=qk,
where Lk:L2([0,T])↦ℝ is a linear functional given by(5)Lku=∫tktk+1u(s)exp(-tk+1-sRC)ds,(6)qk=Cδ-bRC(1-exp(-tk+1-tkRC))
for all k=1,2,…,n-1. Therefore, we have the following result.Lemma 1.
Thet-transform of the LIF neuron can be written in inner-product form as
(7)〈u,ϕk〉=qk,
where
(8)ϕk(t)=exp(-tk+1-tRC)1[tk,tk+1](t),
and 〈·,·〉:L2([0,T])×L2([0,T])↦ℝ is the standard L2 inner product restricted to the domain [0,T] for all k=1,2,…,n-1.Remark 2.
The inner products or projections〈u,ϕk〉,k=1,2,…,n-1, in (7) represent a set of measurements or encodings of the signal u on [0,T]. Since (ϕk) and (qk),k=1,2,…,n-1, in (6) can be readily derived from the knowledge of the spike times and the neuron parameters, the signal encodings are available to an observer reading the spike times (tk),k=1,2,…,n-1.


## 2.2. Consistent Stimulus Recovery

The problem of stimulus reconstruction calls for estimating the signalu given the set of spikes (tk),k=1,2,…,n. This problem is, for the class of stimuli u∈L2([0,T]), ill-defined. (Signals that lie in a L2 space have, in general, infinite degrees of freedom and thus cannot be perfectly recovered by a finite number of observations.) A remedy is provided by introducing a set of constraints on the recovery. The first constraint considered here requires the reconstructed signal û to generate the same spikes as the original stimulus. The second constraint requires choosing among the reconstructed stimuli the one with the maximum degree of smoothness. The latter is formulated as an optimization criterion.Definition 3.
A reconstructionû of u based on the spike times (tk),k=1,2,…,n, is said to be consistent if û triggers exactly the same spike train as the original stimulus u.Remark 4.
As before, assume that at time 0 the membrane potential of the LIF neuron is set to the resting potential 0. Then the consistency condition above is equivalent with(9)〈u,ϕk〉=〈û,ϕk〉
for all k,k=1,2,…,n-1.Definition 5.
A consistent reconstructionû that minimizes the quadratic criterion
(10)∥Ju∥=(∫0T(d2uds2)2ds)1/2
is called the optimal consistent reconstruction ofu.Remark 6.
∥Ju∥ is the norm of the second derivative of the reconstructed stimulus.Lemma 7.
The optimal consistent reconstructionû solves the  spline interpolation  problem
(11)û=argmin〈u,ϕk〉=qk∥d2udt2∥,
where ∥·∥ is the standard L2-norm restricted to the interval [0,T].Proof.
It follows directly from Definitions3 and 5.Remark 8.
An introduction to splines and the general solution to spline interpolation problems is presented in the AppendixA.Theorem 9.
The optimal consistent reconstruction is unique and is given by(12)û(t)=d0+d1t+∑k=1n-1ckψk(t),
where
(13)ψk(t)=(ϕk*|·|3)(t)=∫tktk+1|t-s|3exp(-tk+1-sRC)ds,
where * denotes the convolution, and |·| denotes the absolute value. With c=[c1,c2,…,cn-1]T, d=[d0,d1] and q=[q1,q2,…,qn-1]T the coefficients c and d satisfy the matrix equations
(14)[GprpT00rT00][cd0d1]=[q00].
Moreover G is an (n-1)×(n-1) matrix, and pandr are column vectors with entries given by
(15)[p]k=〈ϕk,1〉,[r]k=〈ϕk,t〉,[G]kl=〈ϕk,ψl〉,
where all the inner products are restricted to the interval [0,T].Proof.
The proof follows from Theorem4 in Appendix A. Note that the function |·|3 is up to a multiplicative constant Green's function for the second-order iterated Laplacian. (See Lemma 5 in Appendix B).
The representation functions (13) can be explicitly given in analytical form as
(16)ψk(t)(RC)4={f(tk+1-tRC)-f(tk-tRC)×exp(-tk+1-tkRC),t≤tk,12exp(-tk+1-tRC)+f(tk+1-tRC)+f(tk-tRC)exp(-tk+1-tkRC),tk<t≤tk+1,f(tk-tRC)exp(-tk+1-tkRC)-f(tk+1-tRC),t>tk+1,
where f(x)=x3-3x2+6x-6. The entries of the matrix G are given by
(17)[G]kl(RC)5=[g(tl+1-tk+1RC)-g(tl+1-tkRC)exp(-tk+1-tkRC)-g(tl-tk+1RC)exp(-tl+1-tlRC)+g(tl-tkRC)exp(-tk+1-tkRC-tl+1-tlRC)]·1(k<l)+[6(1-exp(-2(tk+1-tk)RC))-2g(tk+1-tkRC)exp(-tk+1-tkRC)]·1(k=l)+[g(tk+1-tl+1RC)-g(tk+1-tlRC)exp(-tl+1-tlRC)-g(tk-tl+1RC)exp(-tk+1-tkRC)+g(tk-tlRC)exp(-tl+1-tlRC-tk+1-tkRC)]·1(k>l)
with g(x)=x3+6x. Finally
(18)[p]k=RC(1-exp(-tk+1-tkRC))[r]k=(RC)2((tk+1RC-1)-(tkRC-1)exp(-tk+1-tkRC)).Remark 10.
By lettingR→∞, one obtains the representation of the optimal consistent reconstruction for stimuli encoded with the ideal IAF neuron. The parameters and representation functions take a simple form:
(19)limR→∞ϕk(t)=1[tk,tk+1](t),limR→∞qk=Cδ-b(tk+1-tk),limR→∞ψk(t)=∫tktk+1|t-s|3ds={0.25[(t-tk+1)4-(t-tk)4],t≤tk,0.25[(t-tk+1)4+(t-tk)4],tk<t≤tk+1,0.25[(t-tk)4-(t-tk+1)4],t>tk+1,limR→∞[p]k=tk+1-tk,limR→∞[r]k=(tk+1)2-(tk)22,limR→∞[G]kl={0.05[(tk+1-tl+1)5+(tk-tl)5-(tk-tl+1)5-(tk+1-tl)5],k<l,0.1(tk+1-tk)5,k=l,0.05[(tl+1-tk+1)5+(tl-tk)5-(tl-tk+1)5-(tl+1-tk)5],k>l.


## 2.3. Example

The input to an LIF neuron is a bandlimited signal with bandwidth of100 Hz. The neuron encodes the stimulus during the time interval [0,0.2] second. A bias equal to b=3 is also added to the input. The parameters of the LIF neuron are δ=0.8,C=0.01,andR=50. Under these conditions the neuron generated 78 spikes. The recovered signal is shown in Figure 1. In order to quantify the quality of the recovery, we used the signal-to-noise ratio (SNR) defined by(20)SNR=10log10(∥u∥2∥u-û∥2).
In the above SNR definition the noise corresponds to the error between the original and reconstructed signal. The SNR was equal to 47.53 dB.Figure 1
Encoding and reconstruction with a single LIF neuron.


## 3. Single-Input Multi-Output Encoding and Consistent Stimulus Recovery

In this section we consider the reconstruction of a stimulus encoded with a population of LIF neurons. We demonstrate that the consistent recovery can be again formulated as a spline interpolation problem and provide the reconstruction algorithm. We also show how the methodology developed in this section can be applied to a simple encoding circuit consisting of two-coupled ON-OFF neurons with feedback.


### 3.1. Encoding with a Population of LIF Neurons

In what follows we consider a neural encoding circuit consisting ofN leaky integrate-and-fire (LIF) neurons. Neuron j has threshold δj, bias bj, resistance Rj, and capacitance Cj for all j=1,2,…,N. After each spike every neuron resets its membrane potential to 0. Let tkj denote the kth spike of neuron j, with k=1,2,…,nj, where nj is the number of spikes that the neuron j generates, j=1,2,…,N.Thet-transform of the population of N LIF neurons is given by(21)∫tkjtk+1j(u(s)+bj)exp(-tk+1j-sRjCj)ds=Cjδj.
Let(22)qkj=Cjδj-bjRjCj(1-exp(-tk+1j-tkjRjCj))
for all j=1,2,…,N. As in the previous section, we have the following.Lemma 11.
Thet-transform of the LIF neuron can be written in inner-product form as
(23)〈u,ϕkj〉=qkj,
where
(24)ϕkj(t)=exp(-tk+1j-tRjCj)1[tkj,tk+1j](t),
and 〈·,·〉:L2([0,T])×L2([0,T])↦ℝ is the standard L2 inner product restricted to the domain [0,T] for all k=1,2,…,n and j=1,2,…,N.


### 3.2. Consistent Stimulus Recovery

Letq be a column vector defined as q=[q1;q2;…;qN]T with qj=[q1j,q2j,…,qnj-1j]T,j=1,2,…,N. The vectors p,r,c have the same dimension and are similarly defined. The matrix G is a block square matrix defined as(25)G=[G11⋯G1N⋮⋱⋮GN1⋯GNN]
with Gij∈ℝni-1×nj-1.The following theorem first appeared in [16]; its proof is presented here for the first time.Theorem 12.
Assume that at time 0 the membrane potential of all neurons is at the rest value 0. The optimal consistent reconstructionû is unique and can be written as
(26)û(t)=d0+d1t+∑j=1N∑k=1nj-1ckjψkj(t),
where
(27)ψkj(t)=(ϕkj*|·|3)(t)=∫tkjtk+1j|t-s|3exp(-tk+1j-sRjCj)ds.
The reconstruction coefficients are given in matrix form by
(28)[cd0d1]=[GprpT00rT00]+·[q00],
where [·]+ denotes the pseudoinverse and
(29)[pj]k=RjCj(1-exp(-tk+1j-tkjRjCj)),[rj]k=(RjCj)2((tk+1jRjCj-1)-(tkjRjCj-1)exp(-tk+1j-tkjRjCj)),[Gij]kl=〈ϕki,ψlj〉.Proof.
The proof is notationally more complex but closely follows the proof of Theorem9. The representation functions (27) can be computed analytically as
(30)ψkj(t)(RjCj)4={f(tk+1j-tRjCj)-f(tkj-tRjCj)×exp(-tk+1j-tkjRjCj),t≤tkj,12exp(-tk+1j-tRjCj)+f(tk+1j-tRjCj)+f(tkj-tRjCj)exp(-tk+1j-tkjRjCj),tkj<t≤tk+1j,f(tkj-tRjCj)exp(-tk+1j-tkjRjCj)-f(tk+1j-tRjCj),t>tk+1j,
where f(x)=x3-3x2+6x-6.


### 3.3. Example: Encoding with an ON-OFF Neuron Pair

We consider an encoding circuit consisting of two interconnected integrate-and-fire neurons with feedback. For simplicity we assume that the IAF neurons are ideal, that is,R1,R2→∞. Figure 2 depicts the circuit. Whenever a spike is generated, the firing neuron is reset and feedback is added to the membrane potential. In addition, the firing of each spike is communicated to the other neuron through cross-feedback. The two neurons in Figure 2 arise as models of ON and OFF bipolar cells in the retina and their connections through the nonspiking horizontal cells [18].Figure 2
Coupled ON-OFF integrate-and-fire neurons.Lettkj denote the kth spike of the jth neuron, k=1,…,nj and j=1,2. The t-transform of the neural circuit amounts to(31)∫tk1tk+11u(s)ds=κ1δ1-b1(tk+11-tk1)+∑l≤k∫tk1tk+11h11(s-tl1)ds-∑l∫tk1tk+11h21(s-tl2)ds1{tl2<tk1},∫tk2tk+12u(s)ds=κ2δ2-b2(tk+11-tk1)-∑l≤k∫tk2tk+12h22(s-tl2)ds+∑l∫tk2tk+12h12(s-tl1)ds1{tl1<tk2}
and can be written in inner product form as(32)〈u,ϕkj〉=qkj,
with qkj the right-hand side of (31) and ϕkj=1[tkj,tk+1j], for all k,k=1,2,…,nj-1, and j,j=1,2. With the t-transform in inner product form, the optimal consistent reconstruction is given by Theorem 12.A simple example consisting of two symmetric neurons with parametersδ1=-δ2=δ, κ1=κ2=κ, and b1=-b2=b is considered here. The cross-feedback is of the form(33)h12(t)=h21(t)=cexp(-αt)((αt)55!-(αt)77!)1[t≥0].
No other feedback is present, that is,  h11=h22=0. The neuron parameters are δ=0.75, κ=0.01, and b=3. In addition, α=1/0.015 sec-1 and c=1/3. Note that the impulse response of the filter has mean value zero. If the mean value is nonzero, the spike density of the ideal IAF neurons can be driven to zero or infinity.The input was chosen to be the temporal contrast of an artificial (positive) input photocurrent. Withv denoting the input photocurrent, the temporal contrast u is defined as(34)u(t)=dlog(v(t))dt=1v(t)dvdt.
Clearly, even when the input bandwidth of the photocurrent v is known, the effective bandwidth of the actual neuron input u cannot be analytically estimated. The input photocurrent was bandlimited with bandwidth 100 Hz and had duration 200 milliseconds. Each neuron generated 75 spikes. The result of the recovery is shown in Figure 3. The SNR is equal to 28.75 dB.Figure 3
Recovery of temporal contrast from an ON-OFF IAF neural pair.


## 3.1. Encoding with a Population of LIF Neurons

In what follows we consider a neural encoding circuit consisting ofN leaky integrate-and-fire (LIF) neurons. Neuron j has threshold δj, bias bj, resistance Rj, and capacitance Cj for all j=1,2,…,N. After each spike every neuron resets its membrane potential to 0. Let tkj denote the kth spike of neuron j, with k=1,2,…,nj, where nj is the number of spikes that the neuron j generates, j=1,2,…,N.Thet-transform of the population of N LIF neurons is given by(21)∫tkjtk+1j(u(s)+bj)exp(-tk+1j-sRjCj)ds=Cjδj.
Let(22)qkj=Cjδj-bjRjCj(1-exp(-tk+1j-tkjRjCj))
for all j=1,2,…,N. As in the previous section, we have the following.Lemma 11.
Thet-transform of the LIF neuron can be written in inner-product form as
(23)〈u,ϕkj〉=qkj,
where
(24)ϕkj(t)=exp(-tk+1j-tRjCj)1[tkj,tk+1j](t),
and 〈·,·〉:L2([0,T])×L2([0,T])↦ℝ is the standard L2 inner product restricted to the domain [0,T] for all k=1,2,…,n and j=1,2,…,N.


## 3.2. Consistent Stimulus Recovery

Letq be a column vector defined as q=[q1;q2;…;qN]T with qj=[q1j,q2j,…,qnj-1j]T,j=1,2,…,N. The vectors p,r,c have the same dimension and are similarly defined. The matrix G is a block square matrix defined as(25)G=[G11⋯G1N⋮⋱⋮GN1⋯GNN]
with Gij∈ℝni-1×nj-1.The following theorem first appeared in [16]; its proof is presented here for the first time.Theorem 12.
Assume that at time 0 the membrane potential of all neurons is at the rest value 0. The optimal consistent reconstructionû is unique and can be written as
(26)û(t)=d0+d1t+∑j=1N∑k=1nj-1ckjψkj(t),
where
(27)ψkj(t)=(ϕkj*|·|3)(t)=∫tkjtk+1j|t-s|3exp(-tk+1j-sRjCj)ds.
The reconstruction coefficients are given in matrix form by
(28)[cd0d1]=[GprpT00rT00]+·[q00],
where [·]+ denotes the pseudoinverse and
(29)[pj]k=RjCj(1-exp(-tk+1j-tkjRjCj)),[rj]k=(RjCj)2((tk+1jRjCj-1)-(tkjRjCj-1)exp(-tk+1j-tkjRjCj)),[Gij]kl=〈ϕki,ψlj〉.Proof.
The proof is notationally more complex but closely follows the proof of Theorem9. The representation functions (27) can be computed analytically as
(30)ψkj(t)(RjCj)4={f(tk+1j-tRjCj)-f(tkj-tRjCj)×exp(-tk+1j-tkjRjCj),t≤tkj,12exp(-tk+1j-tRjCj)+f(tk+1j-tRjCj)+f(tkj-tRjCj)exp(-tk+1j-tkjRjCj),tkj<t≤tk+1j,f(tkj-tRjCj)exp(-tk+1j-tkjRjCj)-f(tk+1j-tRjCj),t>tk+1j,
where f(x)=x3-3x2+6x-6.


## 3.3. Example: Encoding with an ON-OFF Neuron Pair

We consider an encoding circuit consisting of two interconnected integrate-and-fire neurons with feedback. For simplicity we assume that the IAF neurons are ideal, that is,R1,R2→∞. Figure 2 depicts the circuit. Whenever a spike is generated, the firing neuron is reset and feedback is added to the membrane potential. In addition, the firing of each spike is communicated to the other neuron through cross-feedback. The two neurons in Figure 2 arise as models of ON and OFF bipolar cells in the retina and their connections through the nonspiking horizontal cells [18].Figure 2
Coupled ON-OFF integrate-and-fire neurons.Lettkj denote the kth spike of the jth neuron, k=1,…,nj and j=1,2. The t-transform of the neural circuit amounts to(31)∫tk1tk+11u(s)ds=κ1δ1-b1(tk+11-tk1)+∑l≤k∫tk1tk+11h11(s-tl1)ds-∑l∫tk1tk+11h21(s-tl2)ds1{tl2<tk1},∫tk2tk+12u(s)ds=κ2δ2-b2(tk+11-tk1)-∑l≤k∫tk2tk+12h22(s-tl2)ds+∑l∫tk2tk+12h12(s-tl1)ds1{tl1<tk2}
and can be written in inner product form as(32)〈u,ϕkj〉=qkj,
with qkj the right-hand side of (31) and ϕkj=1[tkj,tk+1j], for all k,k=1,2,…,nj-1, and j,j=1,2. With the t-transform in inner product form, the optimal consistent reconstruction is given by Theorem 12.A simple example consisting of two symmetric neurons with parametersδ1=-δ2=δ, κ1=κ2=κ, and b1=-b2=b is considered here. The cross-feedback is of the form(33)h12(t)=h21(t)=cexp(-αt)((αt)55!-(αt)77!)1[t≥0].
No other feedback is present, that is,  h11=h22=0. The neuron parameters are δ=0.75, κ=0.01, and b=3. In addition, α=1/0.015 sec-1 and c=1/3. Note that the impulse response of the filter has mean value zero. If the mean value is nonzero, the spike density of the ideal IAF neurons can be driven to zero or infinity.The input was chosen to be the temporal contrast of an artificial (positive) input photocurrent. Withv denoting the input photocurrent, the temporal contrast u is defined as(34)u(t)=dlog(v(t))dt=1v(t)dvdt.
Clearly, even when the input bandwidth of the photocurrent v is known, the effective bandwidth of the actual neuron input u cannot be analytically estimated. The input photocurrent was bandlimited with bandwidth 100 Hz and had duration 200 milliseconds. Each neuron generated 75 spikes. The result of the recovery is shown in Figure 3. The SNR is equal to 28.75 dB.Figure 3
Recovery of temporal contrast from an ON-OFF IAF neural pair.


## 4. Multi-Input Multi-Output Encoding and Consistent Stimulus Recovery

In this section we present our model of consistent information representation ofM-dimensional vector signals using an N×M-dimensional filtering kernel and an ensemble of N integrate-and-fire neurons (see Figure 4). We assume without loss of generality that the neurons are ideal (nonleaky). Each component filter of the kernel receives input from one of the M component inputs, and its output is additively coupled into a single neuron. Finally, we describe an algorithm for stimulus reconstruction that is based on spline interpolation.Figure 4
Multiple-Input Multiple-Output time encoding machine.


### 4.1. MIMO Model for Neural Encoding

LetLM2=(L2([0,T]))M denote the space of M-dimensional, vector-valued functions of finite energy over the domain [0,T]. The general element of this space is u=[u1,u2,…,uM]T, with ui=ui(t),t∈[0,T], modeling the ith component of the input signal and ui∈L2([0,T]) for all i,i=1,2,…,M. The space LM2 endowed with the inner product and norm defined by(35)〈u,v〉LM2=∑i=1M〈ui,vi〉,∥u∥LM22=∑i=1M∥ui∥2,
respectively, is a Hilbert space. Let H:ℝ↦ℝN×M be a filtering kernel defined as(36)H(t)=[h11(t)h12(t)⋯h1M(t)h21(t)h22(t)⋯h2M(t)⋮⋮⋱⋮hN1(t)hN2(t)⋯hNM(t)].
Filtering the signal u with the kernel H leads to an N-dimensional vector valued signal v defined by(37)v≜H*u=[h11*u1+h12*u2+⋯+h1M*uMh21*u1+h22*u2+⋯+h2M*uM⋮hN1*u1+hN2*u2+⋯+hNM*uM].
Equation (37) can also be written in vector notation as(38)vj=(hj)T*u,j=1,2,…,N,
where hj=[hj1,hj2,…,hjM]T is the filtering vector of the neuron j,j=1,2,…,N. A bias bj is added to the component vj of the signal v, and the sum is passed through an integrate-and-fire neuron with integration constant (capacitance) κj and threshold δj, for all j,j=1,2,…,N (see Figure 4). For simplicity we assume that the IAF neurons are ideal, that is,  Rj→∞. Let tkj denote the kth spike of the neuron j, with k=1,2,…,nj, where nj is the number of spikes generated by neuron j, j=1,2,…,N. The Time Encoding Machine in Figure 4 maps, therefore, the input vector u into the vector time sequence (tkj),j=1,2,…,N,k=1,2,…,nj.Thet-transform for the jth neuron can be written as(39)∫tkjtk+1j(vj(s)+bj)ds=κjδj,
or(40)∑i=1M∫tkjtk+1j(hji*ui)(s)ds=qkj,
where qkj=κjδj-bj(tk+1j-tkj), for all k,k=1,2,…,nj-1, and all j,j=1,2,…,N. Note that, without any loss of generality, after firing all neurons are reset to the zero state. The t-transform (40) can be written in an inner product form as(41)〈u,ϕkj〉=qkj,
where(42)ϕkj=h̃j*1[tkj,tk+1j]=[h̃j1h̃j2⋮h̃jM]*1[tkj,tk+1j]
for all j=1,2,…,N, k=1,2,…,nj-1, and h̃ denotes the involution (time reversal) of h, that is, h̃(t)=h(-t). Note that the impulse response of the filtering kernel H is not restricted to the interval [0,T] and can possibly have infinite support.Remark 13.
An implicit assumption in writing thet-transform in the inner product form (41) is that the sampling functions ϕkj belong to LM2. A sufficient condition for the latter is that all filters are bounded-input bounded-output (BIBO) stable, that is, ∫ℝ|hji(s)|ds<∞ for all i,i=1,2,…,M, and all j,j=1,2,…,N.


### 4.2. Consistent Stimulus Recovery

The optimal consistent reconstruction is given by the solution of the following spline interpolation problem:(43)û=argmin〈u,ϕkj〉=qkj(∑i=1M∥d2uidt2∥2)1/2.
We have the following result.Theorem 14.
Assume that at time 0 the membrane potential of all neurons is at the rest value 0. The optimal consistent reconstructionû is unique and can be written as
(44)û(t)=d0+d1t+∑j=1N∑k=1nj-1ckjψkj(t),
where d0,d1∈ℝM and
(45)ψkj(t)=([h̃j1h̃j2⋮h̃jM]*1[tkj,tk+1j]*|·|3)(t)=[∫tkjtk+1j(h̃j1(·)*|·|3)(t-s)ds∫tkjtk+1j(h̃j2(·)*|·|3)(t-s)ds⋮∫tkjtk+1j(h̃jM(·)*|·|3)(t-s)ds].
With p=[p1;p2;…;pN]T, pj∈ℝ(nj-1)×M, and r similarly defined, the reconstruction coefficients are given in matrix form by
(46)[cd0d1]=[GprpT00rT00]+·[q00],
with
(47)[pj]ki=〈1,ϕkji〉,[rj]ki=〈1,ϕkji〉,[Gij]kl=〈ϕki,ψlj〉,
where the inner products are restricted to the interval [0,T].Proof.
The proof is based on Theorem4.Remark 15.
Note that since the signal reconstruction is set up as a spline interpolation problem, the algorithm presented in Theorem14 above will produce a solution that depends on both the filtering kernel H and the spiking mechanism of the population of neurons. We will briefly mention here conditions of no information loss due to filtering. If ℱ denotes the Fourier transform, we have
(48)(ℱv)(ω)=(ℱH)(ω)·(ℱu)(ω).
The requirement for no information loss implies that ℱH, the filtering kernel in the Fourier domain, has rank M for all frequencies of interest (here for all ω∈ℝ). A trivial necessary condition that comes out of the rank condition is that N≥M; that is, the number of neurons that encode the stimulus must be at least equal to the number of its components. This intuitive argument has important ramifications in experimental neuroscience as it shows that, in general, multivariate stimuli (e.g., video sequences) cannot be efficiently represented by the spike train of a single neuron or a small neural population. Rather, the spike trains from a larger population of neurons that encode the same stimulus needs to be used.


### 4.3. Example: Delay Filter Bank

We present the realization of the recovery algorithm for a filtering kernel that inducesarbitrary, but known, delays, and weights on the stimulus. The kernel models dendritic tree latencies in sensory neurons (motor, olfactory) [8] or, in general, delays and synaptic weights between groups of pre- and postsynaptic neurons. In order to incorporate these delays, we assume that the stimuli are defined on a time window larger than [0,T]. The inner product, however, is restricted to the time interval [0,T].Each filterhji delays the stimulus in time by an arbitrary positive amount αji and scales it by an arbitrary real number wji, for all j=1,2…,N, and all i=1,2,…,M. Consequently, hji=wjiδ(t-αji) and h̃ji=wjiδ(t+αji). From now on let τkji=tkj+αji for all i,i=1,2…,M all j,j=1,2,…,N and all k,k=1,2,…,nj-1.The representation functionsψkj,j=1,2,…,N,k=1,2,…,nj-1, of (45) are given by(49)ψkj(t)=[wj1∫τkj1τk+1j1|t-s|3dswj2∫τkj2τk+1j2|t-s|3ds⋮wjM∫τkjMτk+1jM|t-s|3ds]
for all t∈[0,T]. Note that the general term of (49) can be expressed analytically similarly to (19).The entries of (46) can be computed from (47) as(50)[pj]ki={wji(τk+1ji-τkji),τk+1j<T,wji(T-τkji),τkji<T<τk+1ji,0,T<τkji,[rj]ki={0.5wji((τk+1ji)2-(τkji)2),τk+1j<T,0.5wji(T2-(τkji)2),τkji<T<τk+1ji,0,T<τkji,[Gij]kl=〈ϕki,ψlj〉=∑m=1M〈ϕkim,ψljm〉=∑m=1Mwimwjm∫τkimτk+1imψljm(t)dt‍.Note that the entries ofG can be computed analytically as(51)[Gij]kl=∑m=1Mwimwjm20×[((τk+1im-τljm)5+(τkim-τl+1jm)5-(τkim-τljm)5-(τk+1im-τl+1jm)5)·1(τl+1jm≤τkim)+((τk+1im-τljm)5-(τkim-τl+1jm)5-(τkim-τljm)5-(τk+1im-τl+1jm)5)·1(τljm≤τkim≤τl+1jm≤τk+1im)+((τk+1im-τljm)5-(τkim-τl+1jm)5-(τkim-τljm)5+(τk+1im-τl+1jm)5)·1(τljm≤τkim≤τk+1im≤τl+1jm)+((τk+1im-τljm)5-(τkim-τl+1jm)5+(τkim-τljm)5-(τk+1im-τl+1jm)5)·1(τkim≤τljm≤τl+1jm≤τk+1im)+((τk+1im-τljm)5-(τkim-τl+1jm)5+(τkim-τljm)5+(τk+1im-τl+1jm)5)·1(τkim≤τljm≤τk+1im≤τl+1jm)+(-(τk+1im-τljm)5-(τkim-τl+1jm)5+(τkim-τljm)5+(τk+1im-τl+1jm)5)·1(τk+1im≤τljm)].
The vector-valued signal u(t)=[u1(t),u2(t),u3(t)]T has three bandlimited components (M=3) each with the same bandwidth Ω=2π·100 Hz and time length T=100 millisecond. In total, 9 IAF neurons were used to recover the signal (N=9). The delays were drawn randomly from an exponential distribution with mean 3 millisecond. The biases bj and thresholds δj, j=1,2…,9, were drawn from uniform distributions on the intervals [2.3,3.3] and [0.5,1.5], respectively. Finally, κj=0.01 for all j=1,2,…,9.The recovered stimuli using the spikes from 3, 6, and 9 neurons, respectively, are depicted from top to bottom in Figure5. For each component, the recovered signal converges to the original one.Recovery of the 3-dimensional input vector valued signal. In each row the original (blue) and recovered (green) signals are shown for the indicated number of neurons used for recovery. The columns correspond to each component of the input signal.
(a)(b)(c)(d)(e)(f)(g)(h)(i)Figure6 shows the SNR corresponding to the recovery of each stimulus component when 3,4,…,9 neurons are used. Figure 6 demonstrates that overall, as more neurons are added to the representation of the stimulus, the SNR of all stimulus components increases. An exception is observed in the recovery of the component u3; the addition of a neuron from three to four leads to a decrease of the SNR. Note, however, that the SNR for the recovery of the entire vector-valued stimulus u increases with the addition of the fourth neuron from 7.71 dB to 12.23 dB (data not shown).Figure 6
SNR as a function of the number of neurons.


## 4.1. MIMO Model for Neural Encoding

LetLM2=(L2([0,T]))M denote the space of M-dimensional, vector-valued functions of finite energy over the domain [0,T]. The general element of this space is u=[u1,u2,…,uM]T, with ui=ui(t),t∈[0,T], modeling the ith component of the input signal and ui∈L2([0,T]) for all i,i=1,2,…,M. The space LM2 endowed with the inner product and norm defined by(35)〈u,v〉LM2=∑i=1M〈ui,vi〉,∥u∥LM22=∑i=1M∥ui∥2,
respectively, is a Hilbert space. Let H:ℝ↦ℝN×M be a filtering kernel defined as(36)H(t)=[h11(t)h12(t)⋯h1M(t)h21(t)h22(t)⋯h2M(t)⋮⋮⋱⋮hN1(t)hN2(t)⋯hNM(t)].
Filtering the signal u with the kernel H leads to an N-dimensional vector valued signal v defined by(37)v≜H*u=[h11*u1+h12*u2+⋯+h1M*uMh21*u1+h22*u2+⋯+h2M*uM⋮hN1*u1+hN2*u2+⋯+hNM*uM].
Equation (37) can also be written in vector notation as(38)vj=(hj)T*u,j=1,2,…,N,
where hj=[hj1,hj2,…,hjM]T is the filtering vector of the neuron j,j=1,2,…,N. A bias bj is added to the component vj of the signal v, and the sum is passed through an integrate-and-fire neuron with integration constant (capacitance) κj and threshold δj, for all j,j=1,2,…,N (see Figure 4). For simplicity we assume that the IAF neurons are ideal, that is,  Rj→∞. Let tkj denote the kth spike of the neuron j, with k=1,2,…,nj, where nj is the number of spikes generated by neuron j, j=1,2,…,N. The Time Encoding Machine in Figure 4 maps, therefore, the input vector u into the vector time sequence (tkj),j=1,2,…,N,k=1,2,…,nj.Thet-transform for the jth neuron can be written as(39)∫tkjtk+1j(vj(s)+bj)ds=κjδj,
or(40)∑i=1M∫tkjtk+1j(hji*ui)(s)ds=qkj,
where qkj=κjδj-bj(tk+1j-tkj), for all k,k=1,2,…,nj-1, and all j,j=1,2,…,N. Note that, without any loss of generality, after firing all neurons are reset to the zero state. The t-transform (40) can be written in an inner product form as(41)〈u,ϕkj〉=qkj,
where(42)ϕkj=h̃j*1[tkj,tk+1j]=[h̃j1h̃j2⋮h̃jM]*1[tkj,tk+1j]
for all j=1,2,…,N, k=1,2,…,nj-1, and h̃ denotes the involution (time reversal) of h, that is, h̃(t)=h(-t). Note that the impulse response of the filtering kernel H is not restricted to the interval [0,T] and can possibly have infinite support.Remark 13.
An implicit assumption in writing thet-transform in the inner product form (41) is that the sampling functions ϕkj belong to LM2. A sufficient condition for the latter is that all filters are bounded-input bounded-output (BIBO) stable, that is, ∫ℝ|hji(s)|ds<∞ for all i,i=1,2,…,M, and all j,j=1,2,…,N.


## 4.2. Consistent Stimulus Recovery

The optimal consistent reconstruction is given by the solution of the following spline interpolation problem:(43)û=argmin〈u,ϕkj〉=qkj(∑i=1M∥d2uidt2∥2)1/2.
We have the following result.Theorem 14.
Assume that at time 0 the membrane potential of all neurons is at the rest value 0. The optimal consistent reconstructionû is unique and can be written as
(44)û(t)=d0+d1t+∑j=1N∑k=1nj-1ckjψkj(t),
where d0,d1∈ℝM and
(45)ψkj(t)=([h̃j1h̃j2⋮h̃jM]*1[tkj,tk+1j]*|·|3)(t)=[∫tkjtk+1j(h̃j1(·)*|·|3)(t-s)ds∫tkjtk+1j(h̃j2(·)*|·|3)(t-s)ds⋮∫tkjtk+1j(h̃jM(·)*|·|3)(t-s)ds].
With p=[p1;p2;…;pN]T, pj∈ℝ(nj-1)×M, and r similarly defined, the reconstruction coefficients are given in matrix form by
(46)[cd0d1]=[GprpT00rT00]+·[q00],
with
(47)[pj]ki=〈1,ϕkji〉,[rj]ki=〈1,ϕkji〉,[Gij]kl=〈ϕki,ψlj〉,
where the inner products are restricted to the interval [0,T].Proof.
The proof is based on Theorem4.Remark 15.
Note that since the signal reconstruction is set up as a spline interpolation problem, the algorithm presented in Theorem14 above will produce a solution that depends on both the filtering kernel H and the spiking mechanism of the population of neurons. We will briefly mention here conditions of no information loss due to filtering. If ℱ denotes the Fourier transform, we have
(48)(ℱv)(ω)=(ℱH)(ω)·(ℱu)(ω).
The requirement for no information loss implies that ℱH, the filtering kernel in the Fourier domain, has rank M for all frequencies of interest (here for all ω∈ℝ). A trivial necessary condition that comes out of the rank condition is that N≥M; that is, the number of neurons that encode the stimulus must be at least equal to the number of its components. This intuitive argument has important ramifications in experimental neuroscience as it shows that, in general, multivariate stimuli (e.g., video sequences) cannot be efficiently represented by the spike train of a single neuron or a small neural population. Rather, the spike trains from a larger population of neurons that encode the same stimulus needs to be used.


## 4.3. Example: Delay Filter Bank

We present the realization of the recovery algorithm for a filtering kernel that inducesarbitrary, but known, delays, and weights on the stimulus. The kernel models dendritic tree latencies in sensory neurons (motor, olfactory) [8] or, in general, delays and synaptic weights between groups of pre- and postsynaptic neurons. In order to incorporate these delays, we assume that the stimuli are defined on a time window larger than [0,T]. The inner product, however, is restricted to the time interval [0,T].Each filterhji delays the stimulus in time by an arbitrary positive amount αji and scales it by an arbitrary real number wji, for all j=1,2…,N, and all i=1,2,…,M. Consequently, hji=wjiδ(t-αji) and h̃ji=wjiδ(t+αji). From now on let τkji=tkj+αji for all i,i=1,2…,M all j,j=1,2,…,N and all k,k=1,2,…,nj-1.The representation functionsψkj,j=1,2,…,N,k=1,2,…,nj-1, of (45) are given by(49)ψkj(t)=[wj1∫τkj1τk+1j1|t-s|3dswj2∫τkj2τk+1j2|t-s|3ds⋮wjM∫τkjMτk+1jM|t-s|3ds]
for all t∈[0,T]. Note that the general term of (49) can be expressed analytically similarly to (19).The entries of (46) can be computed from (47) as(50)[pj]ki={wji(τk+1ji-τkji),τk+1j<T,wji(T-τkji),τkji<T<τk+1ji,0,T<τkji,[rj]ki={0.5wji((τk+1ji)2-(τkji)2),τk+1j<T,0.5wji(T2-(τkji)2),τkji<T<τk+1ji,0,T<τkji,[Gij]kl=〈ϕki,ψlj〉=∑m=1M〈ϕkim,ψljm〉=∑m=1Mwimwjm∫τkimτk+1imψljm(t)dt‍.Note that the entries ofG can be computed analytically as(51)[Gij]kl=∑m=1Mwimwjm20×[((τk+1im-τljm)5+(τkim-τl+1jm)5-(τkim-τljm)5-(τk+1im-τl+1jm)5)·1(τl+1jm≤τkim)+((τk+1im-τljm)5-(τkim-τl+1jm)5-(τkim-τljm)5-(τk+1im-τl+1jm)5)·1(τljm≤τkim≤τl+1jm≤τk+1im)+((τk+1im-τljm)5-(τkim-τl+1jm)5-(τkim-τljm)5+(τk+1im-τl+1jm)5)·1(τljm≤τkim≤τk+1im≤τl+1jm)+((τk+1im-τljm)5-(τkim-τl+1jm)5+(τkim-τljm)5-(τk+1im-τl+1jm)5)·1(τkim≤τljm≤τl+1jm≤τk+1im)+((τk+1im-τljm)5-(τkim-τl+1jm)5+(τkim-τljm)5+(τk+1im-τl+1jm)5)·1(τkim≤τljm≤τk+1im≤τl+1jm)+(-(τk+1im-τljm)5-(τkim-τl+1jm)5+(τkim-τljm)5+(τk+1im-τl+1jm)5)·1(τk+1im≤τljm)].
The vector-valued signal u(t)=[u1(t),u2(t),u3(t)]T has three bandlimited components (M=3) each with the same bandwidth Ω=2π·100 Hz and time length T=100 millisecond. In total, 9 IAF neurons were used to recover the signal (N=9). The delays were drawn randomly from an exponential distribution with mean 3 millisecond. The biases bj and thresholds δj, j=1,2…,9, were drawn from uniform distributions on the intervals [2.3,3.3] and [0.5,1.5], respectively. Finally, κj=0.01 for all j=1,2,…,9.The recovered stimuli using the spikes from 3, 6, and 9 neurons, respectively, are depicted from top to bottom in Figure5. For each component, the recovered signal converges to the original one.Recovery of the 3-dimensional input vector valued signal. In each row the original (blue) and recovered (green) signals are shown for the indicated number of neurons used for recovery. The columns correspond to each component of the input signal.
(a)(b)(c)(d)(e)(f)(g)(h)(i)Figure6 shows the SNR corresponding to the recovery of each stimulus component when 3,4,…,9 neurons are used. Figure 6 demonstrates that overall, as more neurons are added to the representation of the stimulus, the SNR of all stimulus components increases. An exception is observed in the recovery of the component u3; the addition of a neuron from three to four leads to a decrease of the SNR. Note, however, that the SNR for the recovery of the entire vector-valued stimulus u increases with the addition of the fourth neuron from 7.71 dB to 12.23 dB (data not shown).Figure 6
SNR as a function of the number of neurons.


## 5. Discussion

The methodology of interpolating splines presented here applies to the deterministic case where the input stimulus and the LIF neurons have low noise levels. It ties in naturally with theoretical results that show that neural encoding of bandlimited signals leads to perfect signal reconstruction if Nyquist-type rate conditions are satisfied [5].In neuromorphic engineering applications the noise levels can be kept low. Neuronal spike trains, however, often exhibit strong variability in response to identical inputs due to various noise sources. For stimuli encoded with neural circuits the problem of optimal reconstruction can be formulated as a smoothing spline problem [4]. This case is presented analytically in [7] for a slightly less general setup, where the signals belong to a Reproducing Kernel Hilbert Space [19]. A reconstruction of stimuli encoded with LIF neurons using both smoothing and interpolating splines offers an additional alternative. Thus, the methodology of spline theory provides a general framework for the optimal reconstruction of signals on a finite time horizon.The methodology presented here can be applied to the reconstruction of stimuli encoded with neurons that belong to other model classes of interest. An example is provided by neuron models with level crossing spiking mechanisms and feedback that have been investigated in [16]. More generally, the t-transform of any neuron model with piecewise linear dynamics can be described by a set of linear projections. Neurons with linear dynamics have been shown to express complex spiking behaviors [20–22].The MIMO architecture presented here consists of a linear, time-invariant filtering kernel that is separated from the neural spiking mechanism. By relaxing the time-invariance property and embedding spike-triggered reseting mechanisms at the level of the filtering kernel, more complex transformations can be modeled. Consequently dendritic trees incorporating compartmental neuron models and spike backpropagation [23] can be analyzed with the methodology advanced in this paper. The aforementioned architectures will be the subject of future research.



---

*Source: 469658-2009-09-22.xml*