Download as pdf or txt
Download as pdf or txt
You are on page 1of 5

CHAOS 18, 033120 共2008兲

Orbit spectral density versus stimulus identity and intensity


Andy G. Lozowskia兲
Department of Electrical and Computer Engineering, Southern Illinois University Edwardsville,
Edwardsville, Illinois 62026, USA
共Received 25 February 2008; accepted 18 July 2008; published online 18 August 2008兲

A concept of orbit spectral density for a one-dimensional iterated function is presented. To compute
orbit spectral density, a method of extracting low-order periodic orbits from the dynamical system
defined by the iterated function is first used. All points of the dynamics are then partitioned among
the periodic orbits according to a distance measure. Partition sizes estimate the density of trajecto-
ries around periodic orbits. Assigning these trajectory densities to the orbit indexes introduces the
orbit spectral density. A practical computational example is presented in the context of a model
olfactory system. © 2008 American Institute of Physics. 关DOI: 10.1063/1.2969069兴

Traditionally in nonlinear system analysis, researchers We introduce a concept of orbit spectral density to quan-
focus not only on signals but also on dynamical systems tify the interval distribution density of a neural signal. The
that produce the signals. From this point of view, signals goal is to provide a suitable signal analysis tool that could be
are trajectories in the phase space and dynamical systems used as one of the methods to classify the information em-
can be characterized by the contents of their phase space. bedded in neural signals. The construction of orbit spectral
For the sake of analyzing neural spiking signals, we pro- density will be presented through an example application to
pose a method to create a dynamical system from signal analyze the identity and intensity of odorant mixes in a
realizations. The dynamical system is a one-dimensional model olfactory system.
iterated function in metric space. We inspect the phase
space of the system for the presence of recurrent points
OLFACTORY SYSTEM MODEL
by tracking backward trajectories. As a result, we find all
periodic orbits up to a given order and use them as cen- In biological neural networks, most sensor neurons per-
ters to partition the phase space according to the metric. form a very simple function. Their role is to detect an input
We introduce the term orbit spectral density, which is a stimulus and react to varying intensity of the stimulus. Neu-
mapping of the periodic orbits onto the size of their par- rons produce spikes at their output encoding the information
titions. Trajectory density distribution in the phase space in a straightforward fashion: the more stimulus is delivered
is reflected in the orbit spectral density. This character- to the sensor neuron, the more frequent is its output firing.
izes signals using the orbit spectrum in metric spaces, In mammalian olfactory systems, the input stimulus is
much as the Fourier magnitude spectrum characterizes delivered by odorant molecules depositing in the mucus in-
signals in linear spaces. side the nasal cavity. The right kind of odorant molecules can
reach sensory neurons embedded in the epithelium causing
them to fire. The probability of a sensory neuron firing is
Neural signals by their nature are sequences of spikes related to the number of stimulant molecules. In general, the
distributed in time. It is possible to assume that the informa- average time interval between the neural spikes decreases
tion, carried by neural signals, is in the time intervals be- with the increase of the stimulant concentration. At a certain
tween the spikes and not their magnitudes or shapes. Apply- concentration level, sensory neurons experience saturation.
ing this assumption may, in reality, introduce some This is when the interspike intervals can no longer decrease
information loss. However, processing of the information because of the refractory limitation. This determines the in-
that is still retained becomes a simpler task. terspike interval minimum.
Another assumption can be made about some neural sig- Another neurophysiological observation is that the de-
nals to further simplify the task. In the case of sensory neu- viation of the interspike intervals as measured at the sensory
output is related to the stimulus concentration as well. Con-
rons, the neurophysiological evidence suggests a lack of tem-
centrated scents will invoke frequent firing with little devia-
poral coding other than simple temporal modulation with the
tion in time distance between the spikes. Low concentrations
stimulus intensity. In other words, the order in which the
of the stimulus, however, cause more spread to the firing
intervals are found in the spiking sequence is not an essential
intervals up to the point of a complete lack of regularity in
feature. All of the information can be compiled into an inter-
the neural activity of the sensor.
val probability distribution function. Its parameters will de-
Many experimental approaches were based on response
pend on the type and intensity of the stimulus.
measurements and fitting of concentration-response curves to
data. Typically, the average interspike interval of the olfac-
a兲
Electronic mail: a.lozowski@ieee.org. tory receptors has an asymptotic dependency on the stimulus

1054-1500/2008/18共3兲/033120/5/$23.00 18, 033120-1 © 2008 American Institute of Physics

Author complimentary copy. Redistribution subject to AIP license or copyright, see http://cha.aip.org/cha/copyright.jsp
033120-2 Andy G. Lozowski Chaos 18, 033120 共2008兲

intensity. We shall use an approximation method introduced pΤ1s

in Ref. 1. In this study, various odorants including camphor 60


共A兲, limonene 共B兲, and isoamyle acetate 共C兲 were inspected
for the relationship as to how the odorant concentration af- 50

fects the firing rate of sensory neurons. Using a change of


40
variables defined in Ref. 2, the firing rate is represented by
the average interspike intervals 具␶典, whereas the odor inten- 30
sity is converted to the odor sparsity s. The odorant sparsity
s is the amount of air used to dissolve 1 mol of the sub- 20
stance. Coordinates 共␶ , s兲 are approximately linearly related
10
to each other,
具␶典 = ␶0 + Gs. 共1兲 Τs
0.1 0.2 0.3 0.4 0.5

The minimum interval ␶0 and temporal modulation gain G FIG. 1. The interspike interval distribution p共␶兲 of a sensor neuron depends
are constant parameters specific to a given sensor type. Using on the odorant sparsity s. Two odorants, A 共thin line兲 and B 共bold line兲, are
the measurement data presented in Ref. 1, parameters ␶0 and shown at three sparsity levels: 100, 200, and 300 Ml/ mol 共left to right兲.
G are calculated for the three example odorants:

Camphor 共A兲 Limonene 共B兲 Isoamyle acetate 共C兲 tribute to the superposition in proportion to their intensities.
The relative concentrations of individual components consti-
G ms ms ms tute the odor identity, whereas the absolute concentrations
0.18 0.71 4.8
Ml/ mol Ml/ mol Ml/ mol determine the odor intensity.
␶0 80 ms 130 ms 100 ms

Equation 共1兲 represents temporal modulation of interpike ORBIT SPECTRAL DENSITY


intervals in the sensor response. This effect is common in a With the help of a computer, a realization of the inter-
class of neural sensors broader than just mammalian olfac- spike interval sequence can be obtained from a given interval
tory system.3 distribution function. A sufficiently large amount of
Details of the workings of the olfactory system are not computer-generated data will adequately represent the inter-
completely known. However, it is clear that the sensory in- val distribution. Suppose A is a finite set of intervals gener-
formation distributed among a myriad of olfactory sensors is ated from the distribution associated with odorant A. In the
represented in a much compacted way further down the bio- same manner, let B and C be finite sets generated from odor-
logical signal processing channel. We will present here one ant B and C distributions, respectively. We represent a mix of
such method of representing temporally modulated spiking odorants by the union of sets A 艛 B 艛 C. The relative concen-
distributions. trations of odorants in the mix are reflected by ratios of set
First, we adopt the Maxwell distribution to describe cardinalities 兩B兩 / 兩A兩 and 兩C兩 / 兩A兩. An example realization of
spiking activity of the neural sensor for a given odorant type. 1000 interspike intervals synthesized for a mix of 共0.2, 0.5,
Maxwell distribution has a suitable threshold to represent the 1兲 mol of odorants A, B, and C is shown in Fig. 2. The plot
minimum spiking interval ␶0. Moreover, both the average is a random permutation of 118 points generated from odor-
value and variance depend on the same parameter ␴. There- ant A distribution, 294 points generated from distribution B,
fore, by making ␴ = 冑␲ / 8共␶0 + Gs兲, the average interspike in- and 588 points from C.
terval 具␶典 and the interval deviation relate to the odorant
sparsity s, just as introduced earlier on. The resulting interval
distribution is defined by the following equation: Τs


1.2
1 2 共 ␶ − ␶ 0兲 2
p共␶兲 = 共␶ − ␶0兲2 exp . 共2兲
␴3 ␲ 2␴ 2 1.0

As shown in Fig. 1, diluting the odorant in more air de- 0.8


creases the resolution of the sensor responses by spreading
the interspike intervals over a broader range of values. Hav- 0.6
ing more spread causes the average to shift toward larger
values since the lower bound on ␶ is fixed. 0.4

Living organisms perceive odors as sensations caused by


0.2
mixtures of odorant molecules. Therefore, in any modeling
attempt, it is essential to consider more than one type of k
stimulus at a time. Various odorant molecules excite different 200 400 600 800 1000
groups of receptors. A superposition of these excitations con-
FIG. 2. A 1000 point realization of interspike intervals generated for a mix
stitutes the odor as detected by the olfactory bulb.4 For the of 共0.2,0.5,1兲 mol of odorants A, B, and C diluted in 100 Ml of air. Corre-
sake of simplicity, we assume that individual excitations con- sponding ordered sequence sort共A 艛 B 艛 C兲 shown in bold.

Author complimentary copy. Redistribution subject to AIP license or copyright, see http://cha.aip.org/cha/copyright.jsp
033120-3 Orbit spectral density Chaos 18, 033120 共2008兲

We will use the term ordered sequence for a realization TΤs

of an odorant or a mix of odorants. For odorant A, ordered


sequence a : 兵1 , 2 , . . . , 兩A兩其 → A is derived from the realization 1.2
as a = sortA, where the ordering operator sort is a simple
sorting ∀i,ji ⬍ j ⇒ ai ⬍ a j. For a mix of odorants, ordered se-
quence r : 兵1 , 2 , . . . , 兩A 艛 B 艛 C兩其 → A 艛 B 艛 C is derived from 1.0

the union r = sort共A 艛 B 艛 C兲 in the same manner.


The ordered sequence can be used to estimate the cumu- 0.8
lative distribution function in ergodic systems. In Fig. 2, the
shape of the overall cumulative distribution function can be
inferred by interpolating the graph. The ordered sequence is 0.6
a very extensive, hence impractical representation of odorant
mix realizations. Instead, we propose using a dynamical sys-
0.4
tem to describe a rule of generating realizations of odorant
mixes. In order to define a dynamical system, let us again
generate a large mix of interspike interval realizations using 0.2
the same system of interval distribution functions. Let A⬘,
B⬘, and C⬘ be the sets of intervals corresponding to odorants
A, B, and C, respectively. Again, the ordered sequence Τs
0.2 0.4 0.6 0.8 1.0 1.2
r⬘ : 兵1 , 2 , . . . , 兩A⬘ 艛 B⬘ 艛 C⬘兩其 → A⬘ 艛 B⬘ 艛 C⬘ is derived.
We now define support for our dynamical system to be a FIG. 3. Transformation T : ⍀ → ⍀ combines two distinct monotonic
set ⍀ = A 艛 B 艛 C 艛 A⬘ 艛 B⬘ 艛 C⬘. This is simply a set of all branches T0 共left兲 and T1 共right兲. Convergence of iterated operation T −1 1
1 ⴰ T 0 from the initial condition ␶1 = 0.7s, extracting periodic orbit 共0,1,1兲
ⴰ T −1 −1
intervals generated by the computer so far. Set ⍀ forms a shown.
complete metric space with a finite number of elements and
the standard metric inherited from the real line. Let
q : 兵1 , 2 , . . . , 兩⍀兩其 → ⍀ be the ordered sequence derived from
the support as q = sort⍀. Elements of this sequence are ␶n+1 = T̃ ␣−1n 共␶n兲. 共5兲
mapped back into ⍀ according to the following transforma-
tion T : ⍀ → ⍀: Note that with probability 1, both T̃ −1 −1
0 and T̃ 1 are contrac-
tion mappings. According to Banach’s fixed point theorem,
for a given address ␣, trajectories generated by iterations 共5兲
T = 兵共qk,rk兲:1 艋 k 艋 兩A 艛 B 艛 C兩其 converge to the same periodic orbit regardless of the initial
艛 兵共qk+兩A艛B艛C兩,rk⬘兲:1 艋 k 艋 兩A⬘ 艛 B⬘ 艛 C⬘兩其. 共3兲 condition ␶1. Thus, the orbit address ␣ solely defines the
orbit trajectory. In Table I, addresses of all distinguishable
Transformation T is in fact a union of two monotonic orbits of period 2, 3, 4, and 5 are listed.
branches T0 and T1, represented by the two terms in Eq. 共3兲. Our overall goal is to provide a basis for characterization
Formally, T0 = T兩T −1共A艛B艛C兲 and T1 = T兩T −1共A⬘艛B⬘艛C⬘兲. of various odorant mixes. Using low-period orbits of a dy-
Transformation T will be iterated to generate trajectories namical system offers the advantage of being independent of
␶i+1 = T共␶i兲 in space ⍀. The domain of T is rather coarse. the details of the receptor spiking activity. The orbits are
Nevertheless, we will be seeking low-order recurrent points identifiable by their address. Their realizations are derived
with property T N共␶兲 ⬇ ␶ and 1 ⬍ N Ⰶ 兩⍀兩. Such points can be from the interspike interval distributions and allow for defin-
very efficiently found by tracking reverse iterations T共␶n+1兲 ing orbit spectral density, for a given realization of interval
= ␶n. Every reverse iteration must select either branch T0 or
T1, for uniqueness. Let us index the two branches of T with
address ␣n 苸 兵0 , 1其. We are seeking N-periodic solutions, TABLE I. Periodic orbits of a two-branch transformation up to the order
therefore N-periodic address sequences are needed: ␣n+N N = 5.
= ␣n. Since cardinalities of domains domT0 and domT1 are
Orbit Address ␣
less than 兩⍀兩, the inverse branch mappings need to be ex-
tended to cover the missing points. This will be done using ␰1 共0,0,0,0,1兲
the nearest neighbor in the domain for approximation, ␰2 共0,0,0,1兲
␰3 共0,0,0,1,1兲
␰4 共0,0,1兲
0 共␶n兲 = ␶n+1 苸 domT0:兩␶n − T0共␶n+1兲兩 = min兩␶n − T0共␶兲兩,
T̃ −1 ␰5 共0,0,1,0,1兲

␰6 共0,0,1,1兲
共4兲 ␰7 共0,1兲
␰8 共0,1,0,1,1兲
1 共 ␶ n兲
T̃ −1 = ␶n+1 苸 domT1:兩␶n − T1共␶n+1兲兩 = min兩␶n − T1共␶兲兩.
␶ ␰9 共0,1,1兲
␰10 共0,0,1,1,1兲
As shown in Fig. 3, starting with an initial condition ␶1 and ␰11 共0,1,1,1兲
共␣1 , ␣2 , . . . , ␣N兲, reverse trajectory ␶n converges to an ␰12 共0,1,1,1,1兲
N-periodic orbit while iterating

Author complimentary copy. Redistribution subject to AIP license or copyright, see http://cha.aip.org/cha/copyright.jsp
033120-4 Andy G. Lozowski Chaos 18, 033120 共2008兲

1.2 




 2 

 


 


1.0

 1.


  


 

0.8 0.5 


 


0.6 0.2

0.1
0.4
0.05

0.2
0.02

0 200 400 600 800 1000 1 2 3 4 5 6 8 9 10 11 12


(a)
FIG. 4. A 1000 point realization of interspike intervals generated for a mix
of 共0.2,0.5,1兲 mol of odorants A, B, and C diluted in 100 Ml of air. The 

 2
intervals are partly ordered with respect to closeness to orbits shown in
 
Table I. 1.

 


 
 



0.5

sequence. Each odorant mix corresponds to a different orbit 
 0.2   
 
 
spectrum. The odor identity and intensity information can be  
deduced from the spectrum, which will be the primary appli- 
 0.1
 

cation of the idea.  0.05
Let us consider a single orbit ␰, one of the orbits in-
cluded in Table I. In the set of all intervals A 艛 B 艛 C shown 0.02
in Fig. 2, some of the intervals are going to be closer to orbit
␰ then to any other orbit from the table. The distance of an 1 2 3 4 5 6 8 9 10 11 12
interval to the orbit is understood as the minimum of the (b)
distances to the solutions of Eq. 共5兲. Let expression
共A 艛 B 艛 C兲兩␰ denote the set of all intervals in A 艛 B 艛 C clos- 


1.


est to orbit ␰. The realization of the interval distribution in
Fig. 2 is now partitioned among all orbits and organized 0.5 


according to sequence ␰1 , ␰2 , . . . , ␰12, which is shown in Fig. 





4. The subsequence of points from Fig. 2 falling into parti- 

 0.2
tion ␰1 is now shown first, then subsequence for ␰2, and so
on. Every orbit occupies certain windows in the interval 0.1
value space. Some orbits are more prevalent than others.
0.05
Expressing distribution density of orbits rather than in-  


dividual intervals will prove more effective in describing

 




 0.02
odorant mixes. The simplest orbit 共0,1兲 from the orbit set is 



selected as a fundamental orbit to serve as the density 


reference. All other orbits can be assigned their relative den- 1 2 3 4 5 6 8 9 10 11 12


(c)
sities as
FIG. 5. Orbit spectral densities W共␰兲 of three odorant mixes: 共0.3,0.5,2兲
兩共A 艛 B 艛 C兲兩␰ 共top兲, 共0.25,0.5,1.5兲 共middle兲, and 共0.2,0.5,1兲 共bottom兲. Each mix comes in
W共␰兲 = . 共6兲 three sparsity levels: 100 共circle兲, 200 共square兲, and 300 Ml/ mol 共diamond兲.
兩共A 艛 B 艛 C兲兩共0,1兲
Number W共␰兲 describes the contribution that orbit ␰ has in
the total density of interval realizations. Therefore, W may be of the orbit spectrum may prove useful in decrypting the
regarded as an orbit spectrum and serve as a representation chemical structure of unknown mixes of known components.
of the underlying distribution features. Lastly, the orbit spectrum appears to preserve its integ-
In Fig. 5, three odorant mixes are compared in terms of rity under various concentration levels. A change of concen-
their orbit spectral densities. The first and the last mix are tration is definitely detectable, but the entire pattern of the
distinctly different odors. We expect the spectra to reflect this spectrum remains identifiable.
difference by comparing each orbital component. This in- There are synchronization systems in which oscillators
deed is the case. are coupled in a network to perform various information pro-
The middle odorant mix is a composition of the first and cessing tasks. When storing information as unstable periodic
the last one shown. Inspecting the spectra, the middle one oscillations,5 such systems do not lock trajectories on a pe-
seems to combine the features of the other two. This property riodic orbit. Instead, the system trajectory visits vicinities of

Author complimentary copy. Redistribution subject to AIP license or copyright, see http://cha.aip.org/cha/copyright.jsp
033120-5 Orbit spectral density Chaos 18, 033120 共2008兲

orbits corresponding to stored bits of information according non-negative number related to a measure of how close one
to the stimulus driving the network. The orbit spectrum scent resembles the other. More importantly, in metric spaces
would be a natural way to represent the information retrieval the existence of scents cancelling other scents, or even the
process in such dynamic behavior. The olfactory cortex is existence of a zero scent, is not required. This fits well with
one of the examples of actual biological systems where the fact that sensory neurons will fire even if no odorant
stimulus-driven synchronization is found.6 molecules are present.
Orbit spectral density may be used to formulate synchro- Orbit spectral density is akin to the magnitude of the
nization of dynamical systems that are physically different Fourier spectrum, which is used extensively to analyze sig-
but have similar topological properties. In Ref. 7, synchroni- nals in Hilbert spaces. Decomposition of neural signals into
zation of coupled uniform piecewise linear Markov maps low-periodic trajectories resembles the description of signals
was considered. About 1013 of such maps are possible all with their harmonic components. We expect the identity of
with the same distribution density of points but different time
odors be present in such a decomposition. At the same time,
realizations. Synchronization of such systems is detectable
diluting the odors in air is a feature suppressed in the orbit
by comparing their invariant density measures. The same can
spectrum. That resembles suppression of phase shifts in the
be accomplished by comparing their orbit spectra instead.
Fourier magnitude spectrum.
FINAL REMARKS 1
J. P. Rospars, P. Lansky, P. Duchamp-Viret, and A. Duchamp, BioSystems
There are other ways to derive a single-dimensional 58, 133 共2000兲.
2
transformation from data, such as those in Ref. 8. In contrast A. G. Lozowski, M. Lysetskiy, and J. M. Zurada, IEEE Trans. Neural
Netw. 15, 1268 共2004兲.
to other methods, we have restricted our mathematical appa- 3
R. W. Friedrich and G. Laurent, Science 291, 889 共2001兲.
ratus to a minimum remaining within the concept of metric 4
T. A. Dickinson, J. White, J. S. Kauer, and D. R. Walt, Trends Biotechnol.
spaces. The main advantage of such an approach is that the 16, 250 共1998兲.
5
represented quantities do not need to be elements of a linear P. Thiran and M. Hasler, Int. J. Circuit Theory Appl. 24, 57 共1996兲.
6
space. In the context of the example olfactory system, the W. J. Freeman, Int. J. Bifurcation Chaos Appl. Sci. Eng. 2, 451 共1992兲.
7
M. Hasler, in Proceedings of the 1997 IEEE International Symposium on
model scents are not vectors. Instead, we represent them as Circuits and Systems, Hong Kong 共IEEE, Piscataway, NJ, 1997兲, pp.
trajectories of a dynamical system in a metric space. In met- 1045–1048.
8
ric spaces, it is natural to describe each pair of scents with a D. Pingel, P. Schmelcher, and F. K. Diakonos, Chaos 9, 357 共2000兲.

Author complimentary copy. Redistribution subject to AIP license or copyright, see http://cha.aip.org/cha/copyright.jsp

You might also like