Alan A. Stocker

dblp:s/AAStocker · also Alan Stocker · DBLP profile ↗
← Back
23ranked-venue papers
6as first author
4since 2021 · last 2025
0000-0002-2041-1515ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 18 · 5 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 7 · 1 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
10 papers
Representation and self-supervised learning · 40% Probabilistic and Bayesian machine learning · 24% Multi-agent systems · 12%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 87% Computational social science and digital humanities · 13%
Theoretical computer science
1 paper
Information theory · 100%

Topics — the 19 heaviest of 23, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › computational neuroscience
neural coding
0.322013
Optimal Neural Population Codes for High-dimensional Stimulus Variables · NIPS 2013
"Optimal Neural Tuning Curves for Arbitrary Stimulus Distributions: Discrimax, Infomax and Minimum $L_p$ Loss" · NIPS 2012
Knowledge, reasoning and agents › Multi-agent systems
bounded rationality
0.212016
Human Decision-Making under Limited Time · NIPS 2016
Bioinformatics and computational biology
computational neuroscience
0.212016
Efficient Neural Codes under Metabolic Constraints · NIPS 2016
Bioinformatics and computational biology › computational neuroscience
neural coding
0.212016
Efficient Neural Codes under Metabolic Constraints · NIPS 2016
Information theory › neural coding
efficient coding
0.212016
Efficient Neural Codes under Metabolic Constraints · NIPS 2016
Computer vision › Video understanding and tracking
cue integration
0.212013
Optimal integration of visual speed across different spatiotemporal frequency channels · NIPS 2013
Machine learning › Representation and self-supervised learning › computational neuroscience › neural coding
population codes
0.212013
Optimal Neural Population Codes for High-dimensional Stimulus Variables · NIPS 2013
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference
0.112012
Efficient coding provides a direct link between prior and likelihood in perceptual Bayesian inference · NIPS 2012
Machine learning › Representation and self-supervised learning › computational neuroscience › neural coding
efficient coding
0.112012
Efficient coding provides a direct link between prior and likelihood in perceptual Bayesian inference · NIPS 2012
Machine learning › Learning theory
information theory
0.112012
"Optimal Neural Tuning Curves for Arbitrary Stimulus Distributions: Discrimax, Infomax and Minimum $L_p$ Loss" · NIPS 2012
Machine learning › Representation and self-supervised learning
mutual information maximization
0.112012
"Optimal Neural Tuning Curves for Arbitrary Stimulus Distributions: Discrimax, Infomax and Minimum $L_p$ Loss" · NIPS 2012
Computational social science and digital humanities › cognitive science
human decision-making
0.112016
Human Decision-Making under Limited Time · NIPS 2016
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
decision making under uncertainty
0.012007
A Bayesian Model of Conditioned Perception · NIPS 2007
Image and video processing › motion estimation
optical flow
0.011998
Computation of Smooth Optical Flow in a Feedback Connected Analog Network · NIPS 1998
Emerging computing paradigms
analog computing
0.011998
Computation of Smooth Optical Flow in a Feedback Connected Analog Network · NIPS 1998
Computer vision › Video understanding and tracking › motion analysis
motion discrimination
0.012005
Sensory Adaptation within a Bayesian Framework for Perception · NIPS 2005
Computer vision › 3D vision
motion perception
0.012004
Constraining a Bayesian Model of Human Visual Speed Perception · NIPS 2004
Integrated circuit design › analog and mixed-signal circuits
analog VLSI
0.012002
Classifying Patterns of Visual Motion - a Neuromorphic Approach · NIPS 2002
Emerging computing paradigms
neuromorphic computing
0.012002
Classifying Patterns of Visual Motion - a Neuromorphic Approach · NIPS 2002

Methods — techniques the papers use, named apart from their topics

histogram equalization · 0.8statistical mechanics · 0.5information theory · 0.5psychophysics · 0.2mutual information maximization · 0.2learning rule · 0.2l2 reconstruction error · 0.2divisive normalization · 0.2bayesian inference · 0.2cramer-rao lower bound · 0.1feedback-connected analog network · 0.0winner-take-all · 0.0optical flow · 0.0
YearPublicationVenuePosition
2025 Noisy template matching: A mechanistic model of approximate number perception
Long Ni, Chuyan Qu, Alan A. Stocker, Elizabeth M. Brannon
CogSci3
2025 Adaptation optimizes sensory encoding for future stimuli
abstract
Sensory neurons continually adapt their response characteristics according to recent stimulus history. However, it is unclear how such a reactive process can benefit the organism. Here, we test the hypothesis that adaptation actually acts proactively in the sense that it optimally adjusts sensory encoding for future stimuli. We first quantified human subjects' ability to discriminate visual orientation under different adaptation conditions. Using an information theoretic analysis, we found that adaptation leads to a reallocation of coding resources such that encoding accuracy peaks at the mean orientation of the adaptor while total coding capacity remains constant. We then asked whether this characteristic change in encoding accuracy is predicted by the temporal statistics of natural visual input. Analyzing the retinal input of freely behaving human subjects showed that the distribution of local visual orientations in the retinal input stream indeed peaks at the mean orientation of the preceding input history (i.e., the adaptor). We further tested our hypothesis by analyzing the internal sensory representations of a recurrent neural network trained to predict the next frame of natural scene videos (PredNet). Simulating our human adaptation experiment with PredNet, we found that the network exhibited the same change in encoding accuracy as observed in human subjects. Taken together, our results suggest that adaptation-induced changes in encoding accuracy prepare the visual system for future stimuli.
Jiang Mao, Constantin A. Rothkopf, Alan A. Stocker
PLoS Comput. Biol.3
2025 A linear perception-action mapping accounts for response range-dependent biases in heading estimation from optic flow
abstract
Accurate estimation of heading direction from optic flow is a crucial aspect of human spatial perception. Previous psychophysical studies have shown that humans are typically biased in their heading estimates, but the reported results are inconsistent. While some studies found that humans generally underestimate heading direction (center bias), others observed the opposite, an overestimation of heading direction (peripheral bias). We conducted three psychophysical experiments showing that these conflicting findings may not reflect inherent differences in heading perception but can be attributed to the different sizes of the response range that participants were allowed to utilize when reporting their estimates. Notably, we show that participants' heading estimates monotonically scale with the size of the response range, leading to underestimation for small and overestimation for large response ranges. Additionally, neither the speed profile of the optic flow pattern nor the response method (mouse vs. keyboard) significantly affected participants' estimates. Furthermore, we introduce a Bayesian heading estimation model that can quantitatively account for participants' heading reports. The model assumes efficient sensory encoding of heading direction according to a prior inferred from human heading discrimination data. In addition, the model assumes a response mapping that linearly scales the perceptual estimate with a scaling factor that monotonically depends on the size of the response range. This simple perception-action model accurately predicts participants' estimates both in terms of mean and variance across all experimental conditions. Our findings underscore that human heading perception follows efficient Bayesian inference; differences in participants reported estimates can be parsimoniously explained as differences in mapping percept to probe response.
Ling-Hao Xu, Alan A. Stocker
PLoS Comput. Biol.3
2021 Categorical judgments do not modify sensory representations in working memory
abstract
Categorical judgments can systematically bias the perceptual interpretation of stimulus features. However, it remained unclear whether categorical judgments directly modify working memory representations or, alternatively, generate these biases via an inference process down-stream from working memory. To address this question we ran two novel psychophysical experiments in which human subjects had to reverse their categorical judgments about a stimulus feature, if incorrect, before providing an estimate of the feature. If categorical judgments indeed directly altered sensory representations in working memory, subjects' estimates should reflect some aspects of their initial (incorrect) categorical judgment in those trials. We found no traces of the initial categorical judgment. Rather, subjects seemed to be able to flexibly switch their categorical judgment if needed and use the correct corresponding categorical prior to properly perform feature inference. A cross-validated model comparison also revealed that feedback may lead to selective memory recall such that only memory samples that are consistent with the categorical judgment are accepted for the inference process. Our results suggest that categorical judgments do not modify sensory information in working memory but rather act as top-down expectations in the subsequent sensory recall and inference process.
Long Luu, Alan A. Stocker
PLoS Comput. Biol.2
2016 Human Decision-Making under Limited Time
abstract
Abstract Subjective expected utility theory assumes that decision-makers possess unlimited computational resources to reason about their choices; however, virtually all decisions in everyday life are made under resource constraints---i.e. decision-makers are bounded in their rationality. Here we experimentally tested the predictions made by a formalization of bounded rationality based on ideas from statistical mechanics and information-theory. We systematically tested human subjects in their ability to solve combinatorial puzzles under different time limitations. We found that our bounded-rational model accounts well for the data. The decomposition of the fitted model parameter into the subjects' expected utility function and resource parameter provide interesting insight into the subjects' information capacity limits. Our results confirm that humans gradually fall back on their learned prior choice patterns when confronted with increasing resource limitations.
Pedro A. Ortega, Alan A. Stocker
NIPS2
2016 Efficient Neural Codes under Metabolic Constraints
abstract
Neural codes are inevitably shaped by various kinds of biological constraints, \emph{e.g.} noise and metabolic cost. Here we formulate a coding framework which explicitly deals with noise and the metabolic costs associated with the neural representation of information, and analytically derive the optimal neural code for monotonic response functions and arbitrary stimulus distributions. For a single neuron, the theory predicts a family of optimal response functions depending on the metabolic budget and noise characteristics. Interestingly, the well-known histogram equalization solution can be viewed as a special case when metabolic resources are unlimited. For a pair of neurons, our theory suggests that under more severe metabolic constraints, ON-OFF coding is an increasingly more efficient coding scheme compared to ON-ON or OFF-OFF. The advantage could be as large as one-fold, substantially larger than the previous estimation. Some of these predictions could be generalized to the case of large neural populations. In particular, these analytical results may provide a theoretical basis for the predominant segregation into ON- and OFF-cells in early visual processing areas. Overall, we provide a unified framework for optimal neural codes with monotonic tuning curves in the brain, and makes predictions that can be directly tested with physiology experiments.
Xue-Xin Wei, Alan A. Stocker, Daniel D. Lee
NIPS3
2016 Efficient Neural Codes That Minimize Lp Reconstruction Error
abstract
The efficient coding hypothesis assumes that biological sensory systems use neural codes that are optimized to best possibly represent the stimuli that occur in their environment. Most common models use information-theoretic measures, whereas alternative formulations propose incorporating downstream decoding performance. Here we provide a systematic evaluation of different optimality criteria using a parametric formulation of the efficient coding problem based on the [Formula: see text] reconstruction error of the maximum likelihood decoder. This parametric family includes both the information maximization criterion and squared decoding error as special cases. We analytically derived the optimal tuning curve of a single neuron encoding a one-dimensional stimulus with an arbitrary input distribution. We show how the result can be generalized to a class of neural populations by introducing the concept of a meta-tuning curve. The predictions of our framework are tested against previously measured characteristics of some early visual systems found in biology. We find solutions that correspond to low values of [Formula: see text], suggesting that across different animal models, neural representations in the early visual pathways optimize similar criteria about natural stimuli that are relatively close to the information maximization criterion.
Alan A. Stocker, Daniel D. Lee
Neural Comput.2
2016 Mutual Information, Fisher Information, and Efficient Coding
abstract
Fisher information is generally believed to represent a lower bound on mutual information (Brunel & Nadal, 1998), a result that is frequently used in the assessment of neural coding efficiency. However, we demonstrate that the relation between these two quantities is more nuanced than previously thought. For example, we find that in the small noise regime, Fisher information actually provides an upper bound on mutual information. Generally our results show that it is more appropriate to consider Fisher information as an approximation rather than a bound on mutual information. We analytically derive the correspondence between the two quantities and the conditions under which the approximation is good. Our results have implications for neural coding theories and the link between neural population coding and psychophysically measurable behavior. Specifically, they allow us to formulate the efficient coding problem of maximizing mutual information between a stimulus variable and the response of a neural population in terms of Fisher information. We derive a signature of efficient coding expressed as the correspondence between the population Fisher information and the distribution of the stimulus variable. The signature is more general than previously proposed solutions that rely on specific assumptions about the neural tuning characteristics. We demonstrate that it can explain measured tuning characteristics of cortical neural populations that do not agree with previous models of efficient coding.
Xue-Xin Wei, Alan A. Stocker
Neural Comput.2
2015 Causal reasoning in a prediction task with hidden causes
Pedro A. Ortega, Daniel D. Lee, Alan A. Stocker
CogSci3
2014 Characterizing the Impact of Category Uncertainty on Human Auditory Categorization Behavior
abstract
Categorization is an important cognitive process. However, the correct categorization of a stimulus is often challenging because categories can have overlapping boundaries. Whereas perceptual categorization has been extensively studied in vision, the analogous phenomenon in audition has yet to be systematically explored. Here, we test whether and how human subjects learn to use category distributions and prior probabilities, as well as whether subjects employ an optimal decision strategy when making auditory-category decisions. We asked subjects to classify the frequency of a tone burst into one of two overlapping, uniform categories according to the perceived tone frequency. We systematically varied the prior probability of presenting a tone burst with a frequency originating from one versus the other category. Most subjects learned these changes in prior probabilities early in testing and used this information to influence categorization. We also measured each subject's frequency-discrimination thresholds (i.e., their sensory uncertainty levels). We tested each subject's average behavior against variations of a Bayesian model that either led to optimal or sub-optimal decision behavior (i.e. probability matching). In both predicting and fitting each subject's average behavior, we found that probability matching provided a better account of human decision behavior. The model fits confirmed that subjects were able to learn category prior probabilities and approximate forms of the category distributions. Finally, we systematically explored the potential ways that additional noise sources could influence categorization behavior. We found that an optimal decision strategy can produce probability-matching behavior if it utilized non-stationary category distributions and prior probabilities formed over a short stimulus history. Our work extends previous findings into the auditory domain and reformulates the issue of categorization in a manner that can help to interpret the results of previous research within a generative framework.
Adam M. Gifford, Yale E. Cohen, Alan A. Stocker
PLoS Comput. Biol.3
2013 Optimal integration of visual speed across different spatiotemporal frequency channels
abstract
How does the human visual system compute the speed of a coherent motion stimulus that contains motion energy in different spatiotemporal frequency bands? Here we propose that perceived speed is the result of optimal integration of speed information from independent spatiotemporal frequency tuned channels. We formalize this hypothesis with a Bayesian observer model that treats the channel activity as independent cues, which are optimally combined with a prior expectation for slow speeds. We test the model against behavioral data from a 2AFC speed discrimination task with which we measured subjects' perceived speed of drifting sinusoidal gratings with different contrasts and spatial frequencies, and of various combinations of these single gratings. We find that perceived speed of the combined stimuli is independent of the relative phase of the underlying grating components, and that the perceptual biases and discrimination thresholds are always smaller for the combined stimuli, supporting the cue combination hypothesis. The proposed Bayesian model fits the data well, accounting for perceptual biases and thresholds of both simple and combined stimuli. Fits are improved if we assume that the channel responses are subject to divisive normalization, which is in line with physiological evidence. Our results provide an important step toward a more complete model of visual motion perception that can predict perceived speeds for stimuli of arbitrary spatial structure.
Matjaz Jogan, Alan A. Stocker
NIPS2
2013 Optimal Neural Population Codes for High-dimensional Stimulus Variables
abstract
How does neural population process sensory information? Optimal coding theories assume that neural tuning curves are adapted to the prior distribution of the stimulus variable. Most of the previous work has discussed optimal solutions for only one-dimensional stimulus variables. Here, we expand some of these ideas and present new solutions that define optimal tuning curves for high-dimensional stimulus variables. We consider solutions for a minimal case where the number of neurons in the population is equal to the number of stimulus dimensions (diffeomorphic). In the case of two-dimensional stimulus variables, we analytically derive optimal solutions for different optimal criteria such as minimal L2 reconstruction error or maximal mutual information. For higher dimensional case, the learning rule to improve the population code is provided.
Alan A. Stocker, Daniel D. Lee
NIPS2
2012 Bayesian Inference with Efficient Neural Population Codes
Xue-Xin Wei, Alan A. Stocker
ICANN (1)2
2012 "Optimal Neural Tuning Curves for Arbitrary Stimulus Distributions: Discrimax, Infomax and Minimum $L_p$ Loss"
abstract
In this work we study how the stimulus distribution influences the optimal coding of an individual neuron. Closed-form solutions to the optimal sigmoidal tuning curve are provided for a neuron obeying Poisson statistics under a given stimulus distribution. We consider a variety of optimality criteria, including maximizing discriminability, maximizing mutual information and minimizing estimation error under a general $L_p$ norm. We generalize the Cramer-Rao lower bound and show how the $L_p$ loss can be written as a functional of the Fisher Information in the asymptotic limit, by proving the moment convergence of certain functions of Poisson random variables. In this manner, we show how the optimal tuning curve depends upon the loss function, and the equivalence of maximizing mutual information with minimizing $L_p$ loss in the limit as $p$ goes to zero.
Alan A. Stocker, Daniel D. Lee
NIPS2
2012 Efficient coding provides a direct link between prior and likelihood in perceptual Bayesian inference
abstract
A common challenge for Bayesian models of perception is the fact that the two fundamental Bayesian components, the prior distribution and the likelihood func- tion, are formally unconstrained. Here we argue that a neural system that emulates Bayesian inference is naturally constrained by the way it represents sensory infor- mation in populations of neurons. More specifically, we show that an efficient coding principle creates a direct link between prior and likelihood based on the underlying stimulus distribution. The resulting Bayesian estimates can show bi- ases away from the peaks of the prior distribution, a behavior seemingly at odds with the traditional view of Bayesian estimation, yet one that has been reported in human perception. We demonstrate that our framework correctly accounts for the repulsive biases previously reported for the perception of visual orientation, and show that the predicted tuning characteristics of the model neurons match the reported orientation tuning properties of neurons in primary visual cortex. Our results suggest that efficient coding is a promising hypothesis in constrain- ing Bayesian models of perceptual inference.
Xue-Xin Wei, Alan A. Stocker
NIPS2
2009 Is the Homunculus "Aware" of Sensory Adaptation?
abstract
Neural activity and perception are both affected by sensory history. The work presented here explores the relationship between the physiological effects of adaptation and their perceptual consequences. Perception is modeled as arising from an encoder-decoder cascade, in which the encoder is defined by the probabilistic response of a population of neurons, and the decoder transforms this population activity into a perceptual estimate. Adaptation is assumed to produce changes in the encoder, and we examine the conditions under which the decoder behavior is consistent with observed perceptual effects in terms of both bias and discriminability. We show that for all decoders, discriminability is bounded from below by the inverse Fisher information. Estimation bias, on the other hand, can arise for a variety of different reasons and can range from zero to substantial. We specifically examine biases that arise when the decoder is fixed, "unaware" of the changes in the encoding population (as opposed to "aware" of the adaptation and changing accordingly). We simulate the effects of adaptation on two well-studied sensory attributes, motion direction and contrast, assuming a gain change description of encoder adaptation. Although we cannot uniquely constrain the source of decoder bias, we find for both motion and contrast that an "unaware" decoder that maximizes the likelihood of the percept given by the preadaptation encoder leads to predictions that are consistent with behavioral data. This model implies that adaptation-induced biases arise as a result of temporary suboptimality of the decoder.
Peggy Seriès, Alan A. Stocker, Eero P. Simoncelli
Neural Comput.2
2008 Generalized Chromodynamic Detection
abstract
A Generalized Likelihood Ratio (GLR) detector is formulated for a known spectral contrast signal that may be present with unknown amplitudes in a pair of co-registered hyperspectral image observations. Under multivariate Gaussian hypotheses, the joint likelihood function is a quadratic expression containing the signal coefficients for the two spectral observations. Maximum-likelihood coefficient estimates, obtained by solving a set of linear equations, define a multi-look GLR decision statistic for detecting the assumed target signal. The performance of the new multi-look detector is compared to several existing methods using a real LWIR hyperspectral image pair with injected target signals simulating gas effluent plumes.
Alan A. Stocker, Pierre Villeneuve
IGARSS (2)1
2007 A Bayesian Model of Conditioned Perception
abstract
We propose an extended probabilistic model for human perception. We argue that in many circumstances, human observers simultaneously evaluate sensory evidence under different hypotheses regarding the underlying physical process that might have generated the sensory information. Within this context, inference can be optimal if the observer weighs each hypothesis according to the correct belief in that hypothesis. But if the observer commits to a particular hypothesis, the belief in that hypothesis is converted into subjective certainty, and subsequent perceptual behavior is suboptimal, conditioned only on the chosen hypothesis. We demonstrate that this framework can explain psychophysical data of a recently reported decision-estimation experiment. The model well accounts for the data, predicting the same estimation bias as a consequence of the preceding decision step. The power of the framework is that it has no free parameters except the degree of the observer's uncertainty about its internal sensory representation. All other parameters are defined by the particular experiment which allows us to make quantitative predictions of human perception to two modifications of the original experiment.
Alan A. Stocker, Eero P. Simoncelli
NIPS1
2005 Sensory Adaptation within a Bayesian Framework for Perception
abstract
We extend a previously developed Bayesian framework for perception to account for sensory adaptation. We first note that the perceptual ef- fects of adaptation seems inconsistent with an adjustment of the inter- nally represented prior distribution. Instead, we postulate that adaptation increases the signal-to-noise ratio of the measurements by adapting the operational range of the measurement stage to the input range. We show that this changes the likelihood function in such a way that the Bayesian estimator model can account for reported perceptual behavior. In particu- lar, we compare the model’s predictions to human motion discrimination data and demonstrate that the model accounts for the commonly observed perceptual adaptation effects of repulsion and enhanced discriminability.
Alan A. Stocker, Eero P. Simoncelli
NIPS1
2004 Constraining a Bayesian Model of Human Visual Speed Perception
abstract
It has been demonstrated that basic aspects of human visual motion per- ception are qualitatively consistent with a Bayesian estimation frame- work, where the prior probability distribution on velocity favors slow speeds. Here, we present a refined probabilistic model that can account for the typical trial-to-trial variabilities observed in psychophysical speed perception experiments. We also show that data from such experiments can be used to constrain both the likelihood and prior functions of the model. Specifically, we measured matching speeds and thresholds in a two-alternative forced choice speed discrimination task. Parametric fits to the data reveal that the likelihood function is well approximated by a LogNormal distribution with a characteristic contrast-dependent vari- ance, and that the prior distribution on velocity exhibits significantly heavier tails than a Gaussian, and approximately follows a power-law function. Humans do not perceive visual motion veridically. Various psychophysical experiments have shown that the perceived speed of visual stimuli is affected by stimulus contrast, with low contrast stimuli being perceived to move slower than high contrast ones [1, 2]. Computational models have been suggested that can qualitatively explain these perceptual effects. Commonly, they assume the perception of visual motion to be optimal either within a deterministic framework with a regularization constraint that biases the solution toward zero motion [3, 4], or within a probabilistic framework of Bayesian estimation with a prior that favors slow velocities [5, 6]. The solutions resulting from these two frameworks are similar (and in some cases identi- cal), but the probabilistic framework provides a more principled formulation of the problem in terms of meaningful probabilistic components. Specifically, Bayesian approaches rely on a likelihood function that expresses the relationship between the noisy measurements and the quantity to be estimated, and a prior distribution that expresses the probability of encountering any particular value of that quantity. A probabilistic model can also provide a richer description, by defining a full probability density over the set of possible "percepts", rather than just a single value. Numerous analyses of psychophysical experiments have made use of such distributions within the framework of signal detection theory in order to model perceptual behavior [7]. Previous work has shown that an ideal Bayesian observer model based on Gaussian forms high contrast low contrast y y posterior likelihood y densit y densit posterior likelihood obabilit prior prior obabilit pr pr v^ v^ a visual speed b visual speed Figure 1: Bayesian model of visual speed perception. a) For a high contrast stimulus, the likelihood has a narrow width (a high signal-to-noise ratio) and the prior induces only a small shift of the mean ^ v of the posterior. b) For a low contrast stimuli, the measurement is noisy, leading to a wider likelihood. The shift is much larger and the perceived speed lower than under condition (a). for both likelihood and prior is sufficient to capture the basic qualitative features of global translational motion perception [5, 6]. But the behavior of the resulting model deviates systematically from human perceptual data, most importantly with regard to trial-to-trial variability and the precise form of interaction between contrast and perceived speed. A recent article achieved better fits for the model under the assumption that human contrast perception saturates [8]. In order to advance the theory of Bayesian perception and provide significant constraints on models of neural implementation, it seems essential to constrain quantitatively both the likelihood function and the prior probability distribution. In previous work, the proposed likelihood functions were derived from the brightness constancy con- straint [5, 6] or other generative principles [9]. Also, previous approaches defined the prior distribution based on general assumptions and computational convenience, typically choos- ing a Gaussian with zero mean, although a Laplacian prior has also been suggested [4]. In this paper, we develop a more general form of Bayesian model for speed perception that can account for trial-to-trial variability. We use psychophysical speed discrimination data in order to constrain both the likelihood and the prior function. 1 Probabilistic Model of Visual Speed Perception 1.1 Ideal Bayesian Observer Assume that an observer wants to obtain an estimate for a variable v based on a measure- ment m that she/he performs. A Bayesian observer "knows" that the measurement device is not ideal and therefore, the measurement m is affected by noise. Hence, this observer combines the information gained by the measurement m with a priori knowledge about v. Doing so (and assuming that the prior knowledge is valid), the observer will on average perform better in estimating v than just trusting the measurements m. According to Bayes' rule 1 p(v|m) = p(m|v)p(v) (1) the probability of perceiving v given m (posterior) is the product of the likelihood of v for a particular measurements m and the a priori knowledge about the estimated variable v (prior). is a normalization constant independent of v that ensures that the posterior is a proper probability distribution. 1 Pcum=0.875 )1^ P + cum=0.5 > v2^ P(v 0 v2 a b vmatch vthres Figure 2: 2AFC speed discrimination experiment. a) Two patches of drifting gratings were displayed simultaneously (motion without movement). The subject was asked to fixate the center cross and decide after the presentation which of the two gratings was moving faster. b) A typical psychometric curve obtained under such paradigm. The dots represent the empirical probability that the subject perceived stimulus2 moving faster than stimulus1. The speed of stimulus1 was fixed while v2 is varied. The point of subjective equality, vmatch, is the value of v2 for which Pcum = 0.5. The threshold velocity vthresh is the velocity for which Pcum = 0.875. It is important to note that the measurement m is an internal variable of the observer and is not necessarily represented in the same space as v. The likelihood embodies both the mapping from v to m and the noise in this mapping. So far, we assume that there is a monotonic function f (v) : v vm that maps v into the same space as m (m-space). Doing so allows us to analytically treat m and vm in the same space. We will later propose a suitable form of the mapping function f (v). An ideal Bayesian observer selects the estimate that minimizes the expected loss, given the posterior and a loss function. We assume a least-squares loss function. Then, the optimal estimate ^ v is the mean of the posterior in Equation (1). It is easy to see why this model of a Bayesian observer is consistent with the fact that perceived speed decreases with con- trast. The width of the likelihood varies inversely with the accuracy of the measurements performed by the observer, which presumably decreases with decreasing contrast due to a decreasing signal-to-noise ratio. As illustrated in Figure 1, the shift in perceived speed towards slow velocities grows with the width of the likelihood, and thus a Bayesian model can qualitatively explain the psychophysical results [1]. 1.2 Two Alternative Forced Choice Experiment We would like to examine perceived speeds under a wide range of conditions in order to constrain a Bayesian model. Unfortunately, perceived speed is an internal variable, and it is not obvious how to design an experiment that would allow subjects to express it directly 1. Perceived speed can only be accessed indirectly by asking the subject to compare the speed of two stimuli. For a given trial, an ideal Bayesian observer in such a two-alternative forced choice (2AFC) experimental paradigm simply decides on the basis of the two trial estimates ^v1 (stimulus1) and ^v2 (stimulus2) which stimulus moves faster. Each estimate ^v is based on a particular measurement m. For a given stimulus with speed v, an ideal Bayesian observer will produce a distribution of estimates p(^ v|v) because m is noisy. Over trials, the observers behavior can be described by classical signal detection theory based on the distributions of the estimates, hence e.g. the probability of perceiving stimulus2 moving 1Although see [10] for an example of determining and even changing the prior of a Bayesian model for a sensorimotor task, where the estimates are more directly accessible. faster than stimulus1 is given as the cumulative probability ^v2 Pcum(^ v2 > ^v1) = p(^ v2|v2) p(^ v1|v1) d^v1 d^v2 (2) 0 0 Pcum describes the full psychometric curve. Figure 2b illustrates the measured psychomet- ric curve and its fit from such an experimental situation. 2 Experimental Methods We measured matching speeds (Pcum = 0.5) and thresholds (Pcum = 0.875) in a 2AFC speed discrimination task. Subjects were presented simultaneously with two circular patches of horizontally drifting sine-wave gratings for the duration of one second (Fig- ure 2a). Patches were 3deg in diameter, and were displayed at 6deg eccentricity to either side of a fixation cross. The stimuli had an identical spatial frequency of 1.5 cycle/deg. One stimulus was considered to be the reference stimulus having one of two different contrast values (c1=[0.075 0.5]) and one of five different speed values (u1=[1 2 4 8 12] deg/sec) while the second stimulus (test) had one of five different contrast values (c2=[0.05 0.1 0.2 0.4 0.8]) and a varying speed that was determined by an interleaved staircase procedure. For each condition there were 96 trials. Conditions were randomly interleaved, including a random choice of stimulus identity (test vs. reference) and motion direction (right vs. left). Subjects were asked to fixate during stimulus presentation and select the faster mov- ing stimulus. The threshold experiment differed only in that auditory feedback was given to indicate the correctness of their decision. This did not change the outcome of the ex- periment but increased significantly the quality of the data and thus reduced the number of trials needed.
Alan A. Stocker, Eero P. Simoncelli
NIPS1
2002 Classifying Patterns of Visual Motion - a Neuromorphic Approach
abstract
We report a system that classifies and can learn to classify patterns of visual motion on-line. The complete system is described by the dynam- ics of its physical network architectures. The combination of the fol- lowing properties makes the system novel: Firstly, the front-end of the system consists of an aVLSI optical flow chip that collectively computes 2-D global visual motion in real-time [1]. Secondly, the complexity of the classification task is significantly reduced by mapping the continu- ous motion trajectories to sequences of ’motion events’. And thirdly, all the network structures are simple and with the exception of the optical flow chip based on a Winner-Take-All (WTA) architecture. We demon- strate the application of the proposed generic system for a contactless man-machine interface that allows to write letters by visual motion. Re- garding the low complexity of the system, its robustness and the already existing front-end, a complete aVLSI system-on-chip implementation is realistic, allowing various applications in mobile electronic devices.
Jakob Heinzle, Alan A. Stocker
NIPS2
1998 Computation of Smooth Optical Flow in a Feedback Connected Analog Network
Alan A. Stocker, Rodney J. Douglas
NIPS1
1996 Stability study of some neural networks applied to tissue characterization of brain magnetic resonance images
abstract
This study investigates the segmentation ability of unsupervised clustering of the image feature space. A self-organizing map, a feed-forward neural network and a k-nearest neighbor classifier were compared in labeling brain slices from magnetic resonance imaging. Qualitative and quantitative tests were carried out using brain images of a patient with an infarction. Five different tissue classes were partitioned: white matter, gray matter, cerebrospinal fluid, fluid in the infarct region and gray matter in the infarct region. The SOM based method performed best in all the cases that were investigated. Especially, the stability of the method concerning the influence of the training set was superior.
Alan A. Stocker, Outi Sipilä, Ari Visa, Oili Salonen, Toivo Katila
ICPR1