Download Slide 1 - Journal of Vision

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Debye–Hückel equation wikipedia , lookup

Equations of motion wikipedia , lookup

Bernoulli's principle wikipedia , lookup

Euler equations (fluid dynamics) wikipedia , lookup

Schrödinger equation wikipedia , lookup

Exact solutions in general relativity wikipedia , lookup

Calculus of variations wikipedia , lookup

Differential equation wikipedia , lookup

Partial differential equation wikipedia , lookup

Dirac equation wikipedia , lookup

Schwarzschild geodesics wikipedia , lookup

Transcript
From: Speed versus accuracy in visual search: Optimal performance and neural architecture
Journal of Vision. 2015;15(16):9. doi:10.1167/15.16.9
Figure Legend:
SPRT for heterogeneous visual search and its spiking network implementation. (a) SPRT for heterogeneous visual
search is implemented by a five-layer network. It has two global circuits: One computes the global log likelihood ratio
S(Xt) (Equation 10) from local circuits that compute log likelihood ratios (Equation 11), and the other estimates scene
complexity Qϕ(Xt) (Equation 25) via gain control. Qϕ(Xt) feeds back to the local circuit at each location. (b) The local
circuit that computes the log likelihood ratio . Spike trains Xt from V1/V2 orientation-selective neurons are converted to
log likelihood for task-relevant orientations ℒθ (Equation 12). The log likelihoods of the distractor ℒD (second line of
Equation
9) under
every putative CDD
are
compiledfor
together,
sent
(blue outgoing
arrow) to Copyright
the global©circuit,
and
Date
of download:
5/13/2017
The
Association
Research
in Vision
and Ophthalmology
2017. All
rights reserved.
inhibited (green incoming arrow) by the CDD estimate Q (details in Equation 25). (c) Orientation tuning curves