Anne C. Smith
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Anne C. Smith has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
Emery N. Brown
Neuroscience Statistics Research Laboratory, Department of Anesthesia and Critical Care, Massachusetts General Hospital/Harvard Medical School, Boston, MA 02114, USA
3 shared publications- Sylvia Wirth
Institut des sciences cognitives Marc Jeannerod, UMR 5229 CNRS, 67, boulevard Pinel, 69675 Bron Cedex, France
2 shared publications Wendy A. Suzuki
Department of Neuroscience, Columbia University, New York, NY 10032, USA
2 shared publications- Andrew E. Hudson
Department of Anesthesiology, UCLA Health, USA
1 shared publication Andrew T. Sornborger
Department of Mathematics and Faculty of Engineering, University of Georgia, Athens, GA 30602
1 shared publicationChristopher P. Fall
Department of Computer Science, Georgetown University, from the Department of Bioengineering, University of Illinois at Chicago
1 shared publication
Latest Publications
- 1 August 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2011 (1094687X) , 4721-4724
Near-real-time connectivity estimation for multivariate neural data
Optical imaging in vivo is an important tool for allowing researchers to understand neural ensemble interactions during awake behavior, sleep, anesthesia and during seizure activity. A major bottleneck in the overall efficiency of neural imaging experiments is the need for post-hoc analysis of imaging data. Computational capabilities are now at the point where real- or near-real-time multivariate analysis of imaging data is possible as data is acquired. In this paper we address the feasibility of performing real-time data analysis with a desktop computer, MATLAB, and a graphics processing unit (GPU). Important components of any real-time functional imaging analysis system are 1) dimensional reduction of the data, 2) visualization of the reduced vector space and 3) rapid calculation of functional connectivities. The ability to assess sources of variability in the data, and connectivity estimates on the fly, are potentially transformative for the way imaging laboratories perform their work. Here, we present benchmarks for analysis of functional imaging data using dimensional reduction methods and estimation of functional connectivities using least-squares and ridge regression methods.
- 1 August 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2011 (1094687X) , 4721-4724
Near-real-time connectivity estimation for multivariate neural data
Optical imaging in vivo is an important tool for allowing researchers to understand neural ensemble interactions during awake behavior, sleep, anesthesia and during seizure activity. A major bottleneck in the overall efficiency of neural imaging experiments is the need for post-hoc analysis of imaging data. Computational capabilities are now at the point where real- or near-real-time multivariate analysis of imaging data is possible as data is acquired. In this paper we address the feasibility of performing real-time data analysis with a desktop computer, MATLAB, and a graphics processing unit (GPU). Important components of any real-time functional imaging analysis system are 1) dimensional reduction of the data, 2) visualization of the reduced vector space and 3) rapid calculation of functional connectivities. The ability to assess sources of variability in the data, and connectivity estimates on the fly, are potentially transformative for the way imaging laboratories perform their work. Here, we present benchmarks for analysis of functional imaging data using dimensional reduction methods and estimation of functional connectivities using least-squares and ridge regression methods.
- Open Access
- 1 January 2010
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2010, 1-12
Coupling among Electroencephalogram Gamma Signals on a Short Time Scale
An important goal in neuroscience is to identify instances when EEG signals are coupled. We employ a method to measure the coupling strength between gamma signals (40–100 Hz) on a short time scale as the maximum cross-correlation over a range of time lags within a sliding variable-width window. Instances of coupling states among several signals are also identified, using a mixed multivariate beta distribution to model coupling strength across multiple gamma signals with reference to a common base signal. We first apply our variable-window method to simulated signals and compare its performance to a fixed-window approach. We then focus on gamma signals recorded in two regions of the rat hippocampus. Our results indicate that this may be a useful method for mapping coupling patterns among signals in EEG datasets.
- 1 January 2010
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2010, 1-12
Open AccessCoupling among Electroencephalogram Gamma Signals on a Short Time Scale
An important goal in neuroscience is to identify instances when EEG signals are coupled. We employ a method to measure the coupling strength between gamma signals (40–100 Hz) on a short time scale as the maximum cross-correlation over a range of time lags within a sliding variable-width window. Instances of coupling states among several signals are also identified, using a mixed multivariate beta distribution to model coupling strength across multiple gamma signals with reference to a common base signal. We first apply our variable-window method to simulated signals and compare its performance to a fixed-window approach. We then focus on gamma signals recorded in two regions of the rat hippocampus. Our results indicate that this may be a useful method for mapping coupling patterns among signals in EEG datasets.
- Open Access
- 1 January 2010
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2010, 1-14
State-Space Algorithms for Estimating Spike Rate Functions
The accurate characterization of spike firing rates including the determination of when changes in activity occur is a fundamental issue in the analysis of neurophysiological data. Here we describe a state-space model for estimating the spike rate function that provides a maximum likelihood estimate of the spike rate, model goodness-of-fit assessments, as well as confidence intervals for the spike rate function and any other associated quantities of interest. Using simulated spike data, we first compare the performance of the state-space approach with that of Bayesian adaptive regression splines (BARS) and a simple cubic spline smoothing algorithm. We show that the state-space model is computationally efficient and comparable with other spline approaches. Our results suggest both a theoretically sound and practical approach for estimating spike rate functions that is applicable to a wide range of neurophysiological data.
- 1 January 2010
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2010, 1-14
Open AccessState-Space Algorithms for Estimating Spike Rate Functions
The accurate characterization of spike firing rates including the determination of when changes in activity occur is a fundamental issue in the analysis of neurophysiological data. Here we describe a state-space model for estimating the spike rate function that provides a maximum likelihood estimate of the spike rate, model goodness-of-fit assessments, as well as confidence intervals for the spike rate function and any other associated quantities of interest. Using simulated spike data, we first compare the performance of the state-space approach with that of Bayesian adaptive regression splines (BARS) and a simple cubic spline smoothing algorithm. We show that the state-space model is computationally efficient and comparable with other spline approaches. Our results suggest both a theoretically sound and practical approach for estimating spike rate functions that is applicable to a wide range of neurophysiological data.
- Open Access
- 2 July 2009
- Published by Elsevier in Journal of Neuroscience Methods
- Vol. 183 (2) , 267-276
A Bayesian statistical analysis of behavioral facilitation associated with deep brain stimulation
- 2 July 2009
- Published by Elsevier in Journal of Neuroscience Methods
- Vol. 183 (2) , 267-276
Open AccessA Bayesian statistical analysis of behavioral facilitation associated with deep brain stimulation
- 26 April 2008
- Published by Springer Nature in Biological Cybernetics
- Vol. 99 (1) , 1-14
A mixed filter algorithm for cognitive state estimation from simultaneously recorded continuous and binary measures of performance
Continuous (reaction times) and binary (correct/ incorrect responses) measures of performance are routinely recorded to track the dynamics of a subject’s cognitive state during a learning experiment. Current analyses of experimental data from learning studies do not consider the two performance measures together and do not use the concept of the cognitive state formally to design statistical methods. We develop a mixed filter algorithm to estimate the cognitive state modeled as a linear stochastic dynamical system from simultaneously recorded continuous and binary measures of performance. The mixed filter algorithm has the Kalman filter and the more recently developed recursive filtering algorithm for binary processes as special cases. In the analysis of a simulated learning experiment the mixed filter algorithm provided a more accurate and precise estimate of the cognitive state process than either the Kalman or binary filter alone. In the analysis of an actual learning experiment in which a monkey’s performance was tracked by its series of reaction times, and correct and incorrect responses, the mixed filter gave a more complete description of the learning process than either the Kalman or binary filter. These results establish the feasibility of estimating cognitive state from simultaneously recorded continuous and binary performance measures and suggest a way to make practical use of concepts from learning theory in the design of statistical methods for the analysis of data from learning experiments.
- 26 April 2008
- Published by Springer Nature in Biological Cybernetics
- Vol. 99 (1) , 1-14
A mixed filter algorithm for cognitive state estimation from simultaneously recorded continuous and binary measures of performance
Continuous (reaction times) and binary (correct/ incorrect responses) measures of performance are routinely recorded to track the dynamics of a subject’s cognitive state during a learning experiment. Current analyses of experimental data from learning studies do not consider the two performance measures together and do not use the concept of the cognitive state formally to design statistical methods. We develop a mixed filter algorithm to estimate the cognitive state modeled as a linear stochastic dynamical system from simultaneously recorded continuous and binary measures of performance. The mixed filter algorithm has the Kalman filter and the more recently developed recursive filtering algorithm for binary processes as special cases. In the analysis of a simulated learning experiment the mixed filter algorithm provided a more accurate and precise estimate of the cognitive state process than either the Kalman or binary filter alone. In the analysis of an actual learning experiment in which a monkey’s performance was tracked by its series of reaction times, and correct and incorrect responses, the mixed filter gave a more complete description of the learning process than either the Kalman or binary filter. These results establish the feasibility of estimating cognitive state from simultaneously recorded continuous and binary performance measures and suggest a way to make practical use of concepts from learning theory in the design of statistical methods for the analysis of data from learning experiments.
- 1 March 2007
- Published by American Physiological Society in Journal of Neurophysiology
- Vol. 97 (3) , 2516-2524
Bayesian Analysis of Interleaved Learning and Response Bias in Behavioral Experiments
Accurate characterizations of behavior during learning experiments are essential for understanding the neural bases of learning. Whereas learning experiments often give subjects multiple tasks to learn simultaneously, most analyze subject performance separately on each individual task. This analysis strategy ignores the true interleaved presentation order of the tasks and cannot distinguish learning behavior from response preferences that may represent a subject's biases or strategies. We present a Bayesian analysis of a state-space model for characterizing simultaneous learning of multiple tasks and for assessing behavioral biases in learning experiments with interleaved task presentations. Under the Bayesian analysis the posterior probability densities of the model parameters and the learning state are computed using Monte Carlo Markov Chain methods. Measures of learning, including the learning curve, the ideal observer curve, and the learning trial translate directly from our previous likelihood-based state-space model analyses. We compare the Bayesian and current likelihood–based approaches in the analysis of a simulated conditioned T-maze task and of an actual object–place association task. Modeling the interleaved learning feature of the experiments along with the animal's response sequences allows us to disambiguate actual learning from response biases. The implementation of the Bayesian analysis using the WinBUGS software provides an efficient way to test different models without developing a new algorithm for each model. The new state-space model and the Bayesian estimation procedure suggest an improved, computationally efficient approach for accurately characterizing learning in behavioral experiments.
- 1 March 2007
- Published by American Physiological Society in Journal of Neurophysiology
- Vol. 97 (3) , 2516-2524
Bayesian Analysis of Interleaved Learning and Response Bias in Behavioral Experiments
Accurate characterizations of behavior during learning experiments are essential for understanding the neural bases of learning. Whereas learning experiments often give subjects multiple tasks to learn simultaneously, most analyze subject performance separately on each individual task. This analysis strategy ignores the true interleaved presentation order of the tasks and cannot distinguish learning behavior from response preferences that may represent a subject's biases or strategies. We present a Bayesian analysis of a state-space model for characterizing simultaneous learning of multiple tasks and for assessing behavioral biases in learning experiments with interleaved task presentations. Under the Bayesian analysis the posterior probability densities of the model parameters and the learning state are computed using Monte Carlo Markov Chain methods. Measures of learning, including the learning curve, the ideal observer curve, and the learning trial translate directly from our previous likelihood-based state-space model analyses. We compare the Bayesian and current likelihood–based approaches in the analysis of a simulated conditioned T-maze task and of an actual object–place association task. Modeling the interleaved learning feature of the experiments along with the animal's response sequences allows us to disambiguate actual learning from response biases. The implementation of the Bayesian analysis using the WinBUGS software provides an efficient way to test different models without developing a new algorithm for each model. The new state-space model and the Bayesian estimation procedure suggest an improved, computationally efficient approach for accurately characterizing learning in behavioral experiments.
- 1 May 2006
- Published by MIT Press in Neural Computation
- Vol. 18 (5) , 1197-1214
A Set Probability Technique for Detecting Relative Time Order Across Multiple Neurons
With the development of multielectrode recording techniques, it is possible to measure the cell firing patterns of multiple neurons simultaneously, generating a large quantity of data. Identification of the firing patterns within these large groups of cells is an important and a challenging problem in data analysis. Here, we consider the problem of measuring the significance of a repeat in the cell firing sequence across arbitrary numbers of cells. In particular, we consider the question, given a ranked order of cells numbered 1 to N, what is the probability that another sequence of length n contains j consecutive increasing elements? Assuming each element of the sequence is drawn with replacement from the numbers 1 through N, we derive a recursive formula for the probability of the sequence of length j or more. For n j, a closed-form solution is derived. For n ≥ 2j, we obtain upper and lower bounds for these probabilities for various combinations of parameter values. These can be computed very quickly. For a typical case with small N (10) and large n (3000), sequences of 7 and 8 are statistically very unlikely. A potential application of this technique is in the detection of repeats in hippocampal place cell order during sleep. Unlike most previous articles on increasing runs in random lists, we use a probability approach based on sets of overlapping sequences.
- 1 May 2006
- Published by MIT Press in Neural Computation
- Vol. 18 (5) , 1197-1214
A Set Probability Technique for Detecting Relative Time Order Across Multiple Neurons
With the development of multielectrode recording techniques, it is possible to measure the cell firing patterns of multiple neurons simultaneously, generating a large quantity of data. Identification of the firing patterns within these large groups of cells is an important and a challenging problem in data analysis. Here, we consider the problem of measuring the significance of a repeat in the cell firing sequence across arbitrary numbers of cells. In particular, we consider the question, given a ranked order of cells numbered 1 to N, what is the probability that another sequence of length n contains j consecutive increasing elements? Assuming each element of the sequence is drawn with replacement from the numbers 1 through N, we derive a recursive formula for the probability of the sequence of length j or more. For n j, a closed-form solution is derived. For n ≥ 2j, we obtain upper and lower bounds for these probabilities for various combinations of parameter values. These can be computed very quickly. For a typical case with small N (10) and large n (3000), sequences of 7 and 8 are statistically very unlikely. A potential application of this technique is in the detection of repeats in hippocampal place cell order during sleep. Unlike most previous articles on increasing runs in random lists, we use a probability approach based on sets of overlapping sequences.