Matthew Cook
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Matthew Cook has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Arlo Sheridan
Waitt Advanced Biophotonics Center, Salk Institute for Biological Studies
1 shared publication - Davi D. Bock
Department of Neurological Sciences, Larner College of Medicine, University of Vermont, Burlington, VT
1 shared publication - Gregory S. X. E. Jefferis
MRC Laboratory of Molecular Biology
1 shared publication Jakob Buhmann
Institute of Neuroinformatics, The University of Zurich and ETH Zurich, Zurich, Switzerland
1 shared publication- Jan Funke
Janelia Research Campus, Howard Hughes Medical Institute, Ashburn, VA, USA
1 shared publication - Julia Buhmann
HHMI Janelia Research Campus
1 shared publication
Latest Publications
- Open Access
Efficient 2D neuron boundary segmentation with local topological constraints
We present a method for segmenting neuron membranes in 2D electron microscopy imagery. This segmentation task has been a bottleneck to reconstruction efforts of the brain's synaptic circuits. One common problem is the misclassification of blurry membrane fragments as cell interior, which leads to merging of two adjacent neuron sections into one via the blurry membrane region. Human annotators can easily avoid such errors by implicitly performing gap completion, taking into account the continuity of membranes. Drawing inspiration from these human strategies, we formulate the segmentation task as an edge labeling problem on a graph with local topological constraints. We derive an integer linear program (ILP) that enforces membrane continuity, i.e. the absence of gaps. The cost function of the ILP is the pixel-wise deviation of the segmentation from a priori membrane probabilities derived from the data. Based on membrane probability maps obtained using random forest classifiers and convolutional neural networks, our method improves the neuron boundary segmentation accuracy compared to a variety of standard segmentation approaches. Our method successfully performs gap completion and leads to fewer topological errors. The method could potentially also be incorporated into other image segmentation pipelines with known topological constraints.
Open AccessEfficient 2D neuron boundary segmentation with local topological constraints
We present a method for segmenting neuron membranes in 2D electron microscopy imagery. This segmentation task has been a bottleneck to reconstruction efforts of the brain's synaptic circuits. One common problem is the misclassification of blurry membrane fragments as cell interior, which leads to merging of two adjacent neuron sections into one via the blurry membrane region. Human annotators can easily avoid such errors by implicitly performing gap completion, taking into account the continuity of membranes. Drawing inspiration from these human strategies, we formulate the segmentation task as an edge labeling problem on a graph with local topological constraints. We derive an integer linear program (ILP) that enforces membrane continuity, i.e. the absence of gaps. The cost function of the ILP is the pixel-wise deviation of the segmentation from a priori membrane probabilities derived from the data. Based on membrane probability maps obtained using random forest classifiers and convolutional neural networks, our method improves the neuron boundary segmentation accuracy compared to a variety of standard segmentation approaches. Our method successfully performs gap completion and leads to fewer topological errors. The method could potentially also be incorporated into other image segmentation pipelines with known topological constraints.
- Open Access
- 13 December 2019
- Published by Cold Spring Harbor Laboratory in bioRxiv
Automatic Detection of Synaptic Partners in a Whole-BrainDrosophilaEM Dataset
The study of neural circuits requires the reconstruction of neurons and the identification of synaptic connections between them. To scale the reconstruction to the size of whole-brain datasets, semi-automatic methods are needed to solve those tasks. Here, we present an automatic method for synaptic partner identification in insect brains, which uses convolutional neural networks to identify post-synaptic sites and their pre-synaptic partners. The networks can be trained from human generated point annotations alone and require only simple post-processing to obtain final predictions. We used our method to extract 244 million putative synaptic partners in the fifty-teravoxel full adult fly brain (FAFB) electron microscopy (EM) dataset and evaluated its accuracy on 146,643 synapses from 702 neurons with a total cable length of 312 mm in four different brain regions. The predicted synaptic connections can be used together with a neuron segmentation to infer a connectivity graph with high accuracy: between 92% and 96% of edges linking connected neurons are correctly classified as weakly connected (less than five synapses) and strongly connected (at least five synapses). Our synaptic partner predictions for the FAFB dataset are publicly available, together with a query library allowing automatic retrieval of up- and downstream neurons.
- 13 December 2019
- Published by Cold Spring Harbor Laboratory in bioRxiv
Open AccessAutomatic Detection of Synaptic Partners in a Whole-BrainDrosophilaEM Dataset
The study of neural circuits requires the reconstruction of neurons and the identification of synaptic connections between them. To scale the reconstruction to the size of whole-brain datasets, semi-automatic methods are needed to solve those tasks. Here, we present an automatic method for synaptic partner identification in insect brains, which uses convolutional neural networks to identify post-synaptic sites and their pre-synaptic partners. The networks can be trained from human generated point annotations alone and require only simple post-processing to obtain final predictions. We used our method to extract 244 million putative synaptic partners in the fifty-teravoxel full adult fly brain (FAFB) electron microscopy (EM) dataset and evaluated its accuracy on 146,643 synapses from 702 neurons with a total cable length of 312 mm in four different brain regions. The predicted synaptic connections can be used together with a neuron segmentation to infer a connectivity graph with high accuracy: between 92% and 96% of edges linking connected neurons are correctly classified as weakly connected (less than five synapses) and strongly connected (at least five synapses). Our synaptic partner predictions for the FAFB dataset are publicly available, together with a query library allowing automatic retrieval of up- and downstream neurons.
- Open Access
- 31 July 2018
- Published by Frontiers Media SA in Frontiers in Computational Neuroscience
- Vol. 12, 54
Factorized Computation: What the Neocortex Can Tell Us About the Future of Computing
Factorized Computation: What the Neocortex Can Tell Us About the Future of Computing
- 31 July 2018
- Published by Frontiers Media SA in Frontiers in Computational Neuroscience
- Vol. 12, 54
Open AccessFactorized Computation: What the Neocortex Can Tell Us About the Future of Computing
Factorized Computation: What the Neocortex Can Tell Us About the Future of Computing
- Open Access
- 3 October 2016
- Published by Springer Nature in Natural Computing
- Vol. 16 (3) , 397-410
A cellular automaton for blocking queen games
- 3 October 2016
- Published by Springer Nature in Natural Computing
- Vol. 16 (3) , 397-410
Open AccessA cellular automaton for blocking queen games
- Top Cited PapersOpen Access
- 3 August 2015
- Published by Frontiers Media SA in Frontiers in Computational Neuroscience
- Vol. 9, 99
Unsupervised learning of digit recognition using spike-timing-dependent plasticity
In order to understand how the mammalian neocortex is performing computations, two things are necessary; we need to have a good understanding of the available neuronal processing units and mechanisms, and we need to gain a better understanding of how those mechanisms are combined to build functioning systems. Therefore, in recent years there is an increasing interest in how spiking neural networks (SNN) can be used to perform complex computations or solve pattern recognition tasks. However, it remains a challenging task to design SNNs which use biologically plausible mechanisms (especially for learning new patterns), since most of such SNN architectures rely on training in a rate-based network and subsequent conversion to a SNN. We present a SNN for digit recognition which is based on mechanisms with increased biological plausibility, i.e. conductance-based instead of current-based synapses, spike-timing-dependent plasticity with time-dependent weight change, lateral inhibition, and an adaptive spiking threshold. Unlike most other systems, we do not use a teaching signal and do not present any class labels to the network. Using this unsupervised learning scheme, our architecture achieves 95% accuracy on the MNIST benchmark, which is better than previous SNN implementations without supervision. The fact that we used no domain-specific knowledge points toward the general applicability of our network design. Also, the performance of our network scales well with the number of neurons used and shows similar performance for four different learning rules, indicating robustness of the full combination of mechanisms, which suggests applicability in heterogeneous biological neural networks.
- 3 August 2015
- Published by Frontiers Media SA in Frontiers in Computational Neuroscience
- Vol. 9, 99
Top Cited PapersOpen AccessUnsupervised learning of digit recognition using spike-timing-dependent plasticity
In order to understand how the mammalian neocortex is performing computations, two things are necessary; we need to have a good understanding of the available neuronal processing units and mechanisms, and we need to gain a better understanding of how those mechanisms are combined to build functioning systems. Therefore, in recent years there is an increasing interest in how spiking neural networks (SNN) can be used to perform complex computations or solve pattern recognition tasks. However, it remains a challenging task to design SNNs which use biologically plausible mechanisms (especially for learning new patterns), since most of such SNN architectures rely on training in a rate-based network and subsequent conversion to a SNN. We present a SNN for digit recognition which is based on mechanisms with increased biological plausibility, i.e. conductance-based instead of current-based synapses, spike-timing-dependent plasticity with time-dependent weight change, lateral inhibition, and an adaptive spiking threshold. Unlike most other systems, we do not use a teaching signal and do not present any class labels to the network. Using this unsupervised learning scheme, our architecture achieves 95% accuracy on the MNIST benchmark, which is better than previous SNN implementations without supervision. The fact that we used no domain-specific knowledge points toward the general applicability of our network design. Also, the performance of our network scales well with the number of neurons used and shows similar performance for four different learning rules, indicating robustness of the full combination of mechanisms, which suggests applicability in heterogeneous biological neural networks.