Timezone: »
Cell assemblies, originally proposed by Donald Hebb (1949), are subsets of neurons firing in a temporally coordinated way that gives rise to repeated motifs supposed to underly neural representations and information processing. Although Hebb's original proposal dates back many decades, the detection of assemblies and their role in coding is still an open and current research topic, partly because simultaneous recordings from large populations of neurons became feasible only relatively recently. Most current and easy-to-apply computational techniques focus on the identification of strictly synchronously spiking neurons. In this paper we propose a new algorithm, based on sparse convolutional coding, for detecting recurrent motifs of arbitrary structure up to a given length. Testing of our algorithm on synthetically generated datasets shows that it outperforms established methods and accurately identifies the temporal structure of embedded assemblies, even when these contain overlapping neurons or when strong background noise is present. Moreover, exploratory analysis of experimental datasets from hippocampal slices and cortical neuron cultures have provided promising results.
Author Information
Sven Peter (University Heidelberg)
Elke Kirschbaum (HCI/IWR, Heidelberg University)
Martin Both (Institute for Physiology and Pathophysiology Heidelberg University)
Lee Campbell (Intramural Research Program, National Institute on Drug Abuse)
Brandon Harvey (Intramural Research Program, National Institute on Drug Abuse)
Conor Heins (Intramural Research Program, National Institute on Drug Abuse)
Daniel Durstewitz (CIMH Heidelberg University)
Ferran Diego (Bosch)
Fred Hamprecht (Heidelberg University)
More from the Same Authors
-
2022 Poster: On the difficulty of learning chaotic dynamics with RNNs »
Jonas Mikhaeil · Zahra Monfared · Daniel Durstewitz -
2022 Poster: Theory and Approximate Solvers for Branched Optimal Transport with Multiple Sources »
Peter Lippmann · Enrique Fita SanmartĂn · Fred Hamprecht -
2021 Poster: Directed Probabilistic Watershed »
Enrique Fita Sanmartin · Sebastian Damrich · Fred Hamprecht -
2021 Poster: On UMAP's True Loss Function »
Sebastian Damrich · Fred Hamprecht -
2019 Poster: Probabilistic Watershed: Sampling all spanning forests for seeded segmentation and semi-supervised learning »
Enrique Fita Sanmartin · Sebastian Damrich · Fred Hamprecht -
2019 Spotlight: Probabilistic Watershed: Sampling all spanning forests for seeded segmentation and semi-supervised learning »
Enrique Fita Sanmartin · Sebastian Damrich · Fred Hamprecht -
2017 Poster: Cost efficient gradient boosting »
Sven Peter · Ferran Diego · Fred Hamprecht · Boaz Nadler -
2016 : Fred Hamprecht : Motif Discovery in Functional Brain Data »
Fred Hamprecht -
2014 Poster: Sparse Space-Time Deconvolution for Calcium Image Analysis »
Ferran Diego Andilla · Fred Hamprecht -
2014 Spotlight: Sparse Space-Time Deconvolution for Calcium Image Analysis »
Ferran Diego Andilla · Fred Hamprecht -
2013 Poster: Learning Multi-level Sparse Representations »
Ferran Diego Andilla · Fred Hamprecht -
2011 Poster: Structured Learning for Cell Tracking »
Xinghua Lou · Fred Hamprecht