Hippocampal Spatial Mapping As Fast Graph Learning
- URL: http://arxiv.org/abs/2107.00567v1
- Date: Thu, 1 Jul 2021 16:05:42 GMT
- Title: Hippocampal Spatial Mapping As Fast Graph Learning
- Authors: Marcus Lewis
- Abstract summary: The hippocampal formation is thought to learn spatial maps of environments, and in many models this learning process consists of forming a sensory association for each location in the environment.
In this work, I approach spatial mapping as a problem of learning graphs of environment parts.
Each node in the learned graph, represented by hippocampal engram cells, is associated with feature information in lateral entorhinal cortex (LEC) and location information in medial entorhinal cortex (MEC) using empirically observed neuron types.
This core idea of associating arbitrary information with nodes and edges is not inherently spatial, so this proposed fast-
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: The hippocampal formation is thought to learn spatial maps of environments,
and in many models this learning process consists of forming a sensory
association for each location in the environment. This is inefficient, akin to
learning a large lookup table for each environment. Spatial maps can be learned
much more efficiently if the maps instead consist of arrangements of sparse
environment parts. In this work, I approach spatial mapping as a problem of
learning graphs of environment parts. Each node in the learned graph,
represented by hippocampal engram cells, is associated with feature information
in lateral entorhinal cortex (LEC) and location information in medial
entorhinal cortex (MEC) using empirically observed neuron types. Each edge in
the graph represents the relation between two parts, and it is associated with
coarse displacement information. This core idea of associating arbitrary
information with nodes and edges is not inherently spatial, so this proposed
fast-relation-graph-learning algorithm can expand to incorporate many spatial
and non-spatial tasks.
Related papers
- A Planet Scale Spatial-Temporal Knowledge Graph Based On OpenStreetMap And H3 Grid [1.6658912537684454]
We propose a framework which supports a planet scale transformation of OpenStreetMap data into a Spatial Temporal Knowledge Graph.
In addition to OpenStreetMap data, we align the different OpenStreetMap on individual h3 grid cells.
arXiv Detail & Related papers (2024-05-24T09:22:20Z) - Improving embedding of graphs with missing data by soft manifolds [51.425411400683565]
The reliability of graph embeddings depends on how much the geometry of the continuous space matches the graph structure.
We introduce a new class of manifold, named soft manifold, that can solve this situation.
Using soft manifold for graph embedding, we can provide continuous spaces to pursue any task in data analysis over complex datasets.
arXiv Detail & Related papers (2023-11-29T12:48:33Z) - TractCloud: Registration-free tractography parcellation with a novel
local-global streamline point cloud representation [63.842881844791094]
Current tractography parcellation methods rely heavily on registration, but registration inaccuracies can affect parcellation.
We propose TractCloud, a registration-free framework that performs whole-brain tractography parcellation directly in individual subject space.
arXiv Detail & Related papers (2023-07-18T06:35:12Z) - PolarMOT: How Far Can Geometric Relations Take Us in 3D Multi-Object
Tracking? [62.997667081978825]
We encode 3D detections as nodes in a graph, where spatial and temporal pairwise relations among objects are encoded via localized polar coordinates on graph edges.
This allows our graph neural network to learn to effectively encode temporal and spatial interactions.
We establish a new state-of-the-art on nuScenes dataset and, more importantly, show that our method, PolarMOT, generalizes remarkably well across different locations.
arXiv Detail & Related papers (2022-08-03T10:06:56Z) - Learning Implicit Feature Alignment Function for Semantic Segmentation [51.36809814890326]
Implicit Feature Alignment function (IFA) is inspired by the rapidly expanding topic of implicit neural representations.
We show that IFA implicitly aligns the feature maps at different levels and is capable of producing segmentation maps in arbitrary resolutions.
Our method can be combined with improvement on various architectures, and it achieves state-of-the-art accuracy trade-off on common benchmarks.
arXiv Detail & Related papers (2022-06-17T09:40:14Z) - Spatial-spectral Hyperspectral Image Classification via Multiple Random
Anchor Graphs Ensemble Learning [88.60285937702304]
This paper proposes a novel spatial-spectral HSI classification method via multiple random anchor graphs ensemble learning (RAGE)
Firstly, the local binary pattern is adopted to extract the more descriptive features on each selected band, which preserves local structures and subtle changes of a region.
Secondly, the adaptive neighbors assignment is introduced in the construction of anchor graph, to reduce the computational complexity.
arXiv Detail & Related papers (2021-03-25T09:31:41Z) - Graph Geometry Interaction Learning [41.10468385822182]
We develop a novel Geometry Interaction Learning (GIL) method for graphs, a well-suited and efficient alternative for learning abundant geometric properties in graph.
Our method endows each node the freedom to determine the importance of each geometry space via a flexible dual feature interaction learning and probability assembling mechanism.
Promising experimental results are presented for five benchmark datasets on node classification and link prediction tasks.
arXiv Detail & Related papers (2020-10-23T02:40:28Z) - Deep Hypergraph U-Net for Brain Graph Embedding and Classification [0.0]
Network neuroscience examines the brain as a system represented by a network (or connectome)
We propose Hypergraph U-Net, a novel data embedding framework leveraging the hypergraph structure to learn low-dimensional embeddings of data samples.
We tested our method on small-scale and large-scale heterogeneous brain connectomic datasets including morphological and functional brain networks of autistic and demented patients.
arXiv Detail & Related papers (2020-08-30T08:15:18Z) - Differentiable Mapping Networks: Learning Structured Map Representations
for Sparse Visual Localization [28.696160266177806]
Differentiable Mapping Network (DMN) learns effective map representations for visual localization.
We evaluate the DMN using simulated environments and a challenging real-world Street View dataset.
arXiv Detail & Related papers (2020-05-19T15:43:39Z) - High-Order Information Matters: Learning Relation and Topology for
Occluded Person Re-Identification [84.43394420267794]
We propose a novel framework by learning high-order relation and topology information for discriminative features and robust alignment.
Our framework significantly outperforms state-of-the-art by6.5%mAP scores on Occluded-Duke dataset.
arXiv Detail & Related papers (2020-03-18T12:18:35Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.