Dec 2, 2013: Hippocampal spatial map formation

Slides:



Advertisements
Similar presentations
Alpha Shapes. Used for Shape Modelling Creates shapes out of point sets Gives a hierarchy of shapes. Has been used for detecting pockets in proteins.
Advertisements

Lecture 6: Creating a simplicial complex from data. in a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305) Topics in Topology:
Tyler White MATH 493 Dr. Wanner
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Omer Bobrowski Mathematics Department Duke University Joint work with Sayan Mukherjee 6/19/13.
Lecture 5: Triangulations & simplicial complexes (and cell complexes). in a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305)
Lecture 1: The Euler characteristic of a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305) Topics in Topology: Scientific.
By Groysman Maxim. Let S be a set of sites in the plane. Each point in the plane is influenced by each point of S. We would like to decompose the plane.
Informationsteknologi Wednesday, November 7, 2007Computer Graphics - Class 51 Today’s class Geometric objects and transformations.
CHAPTER 5: CONVEX POLYTOPES Anastasiya Yeremenko 1.
Discrete geometry Lecture 2 1 © Alexander & Michael Bronstein
“Random Projections on Smooth Manifolds” -A short summary
©2008 I.K. Darcy. All rights reserved This work was partially supported by the Joint DMS/NIGMS Initiative to Support Research in the Area of Mathematical.
1 Last lecture  Path planning for a moving Visibility graph Cell decomposition Potential field  Geometric preliminaries Implementing geometric primitives.
On the Union of Cylinders in Esther Ezra Duke University On the Union of Cylinders in  3 Esther Ezra Duke University.
reconstruction process, RANSAC, primitive shapes, alpha-shapes
1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.
Complex Model Construction Mortenson Chapter 11 Geometric Modeling
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
UNIVERSAL FUNCTIONS A Construction Using Fourier Approximations.
Lecture 4: Addition (and free vector spaces) of a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305) Topics in Topology:
General (point-set) topology Jundong Liu Ohio Univ.
On the union of cylinders in 3-space Esther Ezra Duke University.
Topological Data Analysis
Lecture 2: Addition (and free abelian groups) of a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305) Topics in Topology:
December 9, 2014Computer Vision Lecture 23: Motion Analysis 1 Now we will talk about… Motion Analysis.
Stable, Circulation- Preserving, Simplicial Fluids Sharif Elcott, Yiying Tong, Eva Kanso, Peter Schröder, and Mathieu Desbrun.
Optional Lecture: A terse introduction to simplicial complexes in a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305)
Creating a simplicial complex Step 0.) Start by adding 0-dimensional vertices (0-simplices)
For H 0, can observe how fast connections form, possibly noting concavity Vertices = Regions of Interest Create Rips complex by growing epsilon balls (i.e.
MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic Topology Sept 9, 2013: Create your own homology. Fall 2013.
MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic Topology Sept 16, 2013: Persistent homology III Fall 2013.
3D Object Representations 2009, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
General Elliptical Hotspot Detection Xun Tang, Yameng Zhang Group
1 Chapter 4 Geometry of Linear Programming  There are strong relationships between the geometrical and algebraic features of LP problems  Convenient.
Creating a cell complex = CW complex Building block: n-cells = { x in R n : || x || ≤ 1 } 2-cell = open disk = { x in R 2 : ||x || < 1 } Examples: 0-cell.
Sept 25, 2013: Applicable Triangulations.
Prof. Yu-Chee Tseng Department of Computer Science
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
Sets in the Complex Plane
Image Morphing © Zooface Many slides from Alexei Efros, Berkeley.
We propose a method which can be used to reduce high dimensional data sets into simplicial complexes with far fewer points which can capture topological.
Creating a cell complex = CW complex
POLYGON MESH Advance Computer Graphics
Chapter 3 The Real Numbers.
Sept 23, 2013: Image data Application.
NATURE NEUROSCIENCE 2007 Coordinated memory replay in the visual cortex and hippocampus during sleep Daoyun Ji & Matthew A Wilson Department of Brain.
Provably Correct and Complete Transaction Rules for GIS
MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic Topology Nov 22, 2013: Topological methods for exploring low-density.
MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic Topology Oct 21, 2013: Cohomology Fall 2013 course offered.
Dec 4, 2013: Hippocampal spatial map formation
3D Object Representations
Non-manifold Multiresolution Modeling (some preliminary results)
Chapter 3 The Real Numbers.
Graph Analysis by Persistent Homology
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.

Fitting Curve Models to Edges
Elements of Combinatorial Topology
Clustering Via Persistent Homology
Topological Data Analysis
Depth Estimation via Sampling
E.H. Baeg, Y.B. Kim, K. Huh, I. Mook-Jung, H.T. Kim, M.W. Jung  Neuron 
Decoding Cognitive Processes from Neural Ensembles
Place-Selective Firing of CA1 Pyramidal Cells during Sharp Wave/Ripple Network Patterns in Exploratory Behavior  Joseph O'Neill, Timothy Senior, Jozsef.
Volume 71, Issue 4, Pages (August 2011)
Jozsef Csicsvari, Hajime Hirase, Akira Mamiya, György Buzsáki  Neuron 
Volume 32, Issue 1, Pages (October 2001)
Volume 87, Issue 7, Pages (December 1996)
Lecture 5: Triangulations & simplicial complexes (and cell complexes).
Presentation transcript:

Dec 2, 2013: Hippocampal spatial map formation MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic Topology Dec 2, 2013: Hippocampal spatial map formation Fall 2013 course offered through the University of Iowa Division of Continuing Education Isabel K. Darcy, Department of Mathematics Applied Mathematical and Computational Sciences, University of Iowa http://www.math.uiowa.edu/~idarcy/AppliedTopology.html

Tuesday December 10, 2013 2:00pm-2:50pm A Topological Model of the Hippocampal Spatial Map, Yuri Dabaghian (Rice University) Wednesday December 11, 2013 9:00am-9:50am Topological Structures of Ensemble Neuronal Codes in the Rat Hippocampus, Zhe (Sage) Chen (Massachusetts Institute of Technology) 3:15pm-4:05pm Topological tools for detecting hidden geometric structure in neural data, Carina Curto (University of Nebraska)

http://www. ploscompbiol. org/article/info%3Adoi%2F10. 1371%2Fjournal http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205 First paper to use only the spiking activity of place cells to determine the topology (and geometry) of the environment using homology (and graphs).

place cells = neurons in the hippocampus that are involved in spatial navigation http://en.wikipedia.org/wiki/File:Gray739-emphasizing-hippocampus.png http://en.wikipedia.org/wiki/File:Hippocampus.gif http://en.wikipedia.org/wiki/File:Hippocampal-pyramidal-cell.png

How can the brain understand the spatial environment based only on action potentials (spikes) of place cells? http://upload.wikimedia.org/wikipedia/en/5/5e/Place_Cell_Spiking_Activity_Example.png

How can the brain understand the spatial environment based only on action potentials (spikes) of place cells? http://upload.wikimedia.org/wikipedia/en/5/5e/Place_Cell_Spiking_Activity_Example.png

http://www. ploscompbiol. org/article/info%3Adoi%2F10. 1371%2Fjournal http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

Place field = region in space where the firing rates are significantly above baseline http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

Idea: Can recover the topology of the space traversed by the mouse by looking only at the spiking activity of place cells. http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

Creating the Čech simplicial complex Thus we now have the Vietoris Rips simplicial complex. Note we get the same simplex by adding one dimension at a time 1.) B1 … Bk+1 ≠ ⁄ , create k-simplex {v1, ... , vk+1}. U

Creating the Čech simplicial complex Thus we now have the Vietoris Rips simplicial complex. Note we get the same simplex by adding one dimension at a time 1.) B1 … Bk+1 ≠ ⁄ , create k-simplex {v1, ... , vk+1}. U

Consider X an arbitrary topological space. Let V = {Vi | i = 1, …, n } where Vi X , The nerve of V = N(V) where The k -simplices of N(V) = nonempty intersections of k +1 distinct elements of V . For example, Vertices = elements of V Edges = pairs in V which intersect nontrivially. Triangles = triples in V which intersect nontrivially. http://www.math.upenn.edu/~ghrist/EAT/EATchapter2.pdf

Nerve Lemma: If V is a finite collection of subsets of X with all non-empty intersections of subcollections of V contractible, then N(V) is homotopic to the union of elements of V. http://www.math.upenn.edu/~ghrist/EAT/EATchapter2.pdf

Add simplex if place cells co-fare within a specified time period Idea: Can recover the topology of the space traversed by the mouse by looking only at the spiking activity of place cells. Vertices = place cells Add simplex if place cells co-fare within a specified time period http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

Simplices correspond to cell groups. Cell group = collection of place cells that co-fire within a specified time period (above a specified threshold) . Simplices correspond to cell groups. dimension of simplex = number of place cells in cell group - 1 http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

Idea: Can recover the topology of the space traversed by the mouse by looking only at the spiking activity of place cells. Proof of concept: Data obtained via computer simulations of mouse trajectories using biologically relevant parameters. http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

The total duration of each simulated trajectory was 50 minutes. a smoothed random-walk trajectory was generated, with speed = 0.1 L/s, which was constrained to ‘‘bounce’’ off boundaries and stay within the environment. The total duration of each simulated trajectory was 50 minutes. http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

For each of 300 trials, N= 70 place fields were generated as disks of radii 0.1 L to 0.15 L, with radii and centers chosen uniformly at random. Centers were chosen initially uniformly at random from uncovered space. Once all space covered, remaining centers chosen at random. http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

For each place cell in each trial, an average firing rate was chosen uniformly at random from the interval 2–3 Hz. A spike train was generated from the trajectory and corresponding place field as an inhomogeneous Poisson process with constant rate when the trajectory passed inside the place field, and zero outside, so that the overall firing rate was preserved.

Add noise. r% spikes were deleted from the spike train, and then added back to the spike train at random times, irrespective of position along trajectory, so as to preserve overall firing rate. Control : ‘Shuffled’ data sets were constructed by randomly choosing cells from each of the five environments, and pooling them together to yield population spiking activity that did not come from a single environment.

Assumptions about Place Fields Place fields are omni-directional I.e. direction does not affect the firing rate. http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

Assumptions about Place Fields Place fields are omni-directional Correct assumption in open field. Not correct in linear track. Place cells can also encode angles and directions http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

Assumptions about Place Fields Place fields are omni-directional (2) Place fields have been previously formed and are stable. http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

Assumptions about Place Fields Place fields are omni-directional (2) Place fields have been previously formed and are stable. Note: the hippocampus can undergo rapid context dependent remapping. http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

Assumptions about Place Fields Place fields are omni-directional (2) Place fields have been previously formed and are stable. Note: the hippocampus can undergo rapid context dependent remapping. http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

Assumptions about Place Fields Place fields are omni-directional (2) Place fields have been previously formed and are stable. Note: the hippocampus can undergo rapid context dependent remapping. http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

Assumptions about Place Fields Place fields are omni-directional (2) Place fields have been previously formed and are stable. Note: the hippocampus can undergo rapid context dependent remapping. Nature 2002, Long-term plasticity in hippocampal place-cell representation of environmental geometry, Colin Lever, Tom Wills, Francesca Cacucci, Neil Burgess, John O'Keefe http://www.nature.com/nature/journal/v416/n6876/fig_tab/416090a_F2.html

Assumptions about Place Fields Place fields are omni-directional (2) Place fields have been previously formed and are stable. (3) The collection of place fields corresponding to observed cells covers the entire traversed environment. I.e., the trajectory must be dense enough to sample the majority of cell groups. http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

Assumptions about Place Fields Place fields are omni-directional (2) Place fields have been previously formed and are stable. (3) The collection of place fields corresponding to observed cells covers the entire traversed environment. Biologically: place cells multiply cover the environment. http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

Assumptions about Place Fields Place fields are omni-directional (2) Place fields have been previously formed and are stable. (3) The collection of place fields corresponding to observed cells covers the entire traversed environment. For accurate computation of the nth homology group Hn, we need up to (n+1)-fold intersections to be detectable via cell groups. http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

Assumptions about Place Fields Place fields are omni-directional (2) Place fields have been previously formed and are stable. (3) The collection of place fields corresponding to observed cells covers the entire traversed environment. (4) The holes/obstacles are larger than the diameters of place fields. http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

Assumptions about Place Fields (5) Each (connected) component field of a single or multipeaked place field is convex. (6) Background activity is low compared to the firing inside the place fields. (7) Place fields are roughly circular and have similar sizes, as is typical in dorsal hippocampus [41,42]. http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

For each place cell in each trial, an average firing rate was chosen uniformly at random from the interval 2–3 Hz. A spike train was generated from the trajectory and corresponding place field as an inhomogeneous Poisson process with constant rate when the trajectory passed inside the place field, and zero outside, so that the overall firing rate was preserved. Noise added.

Simplices correspond to cell groups. Cell group = collection of place cells that co-fire within a specified time period (above a specified threshold) . Simplices correspond to cell groups. dimension of simplex = number of place cells in cell group - 1 http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

Simplices correspond to cell groups. Homology calculated via the GAP software package: http://www.cis.udel.edu/linbox/gap.html Simplices correspond to cell groups. dimension of simplex = number of place cells in cell group - 1 http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

Recovering the topology Trial is correct if Hi correct for i = 0, 1, 2, 3, 4. http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000205

Geometry???