基于离散Morse理论的神经元拓扑结构化和树的归纳
Topological Skeletonization and Tree-Summarization of Neurons Using Discrete Morse Theory
摘要:
神经科学数据分析通常涉及统计信号和图像处理的方法,这些方法借鉴了线性代数和随机过程理论。然而,数字化的神经解剖数据集包含标记的神经元,无论是单独或标记示踪剂注射组,不完全适合这个经典的框架。神经元的树状形状在数学上不能被充分地描述为向量空间中的点。因此,需要采取新的办法。计算拓扑学和几何学的方法自然适用于神经元形状的分析。在这里,我们介绍的方法,从离散莫尔斯理论提取树骨架的个体神经元的体积脑图像数据,或总结集合标记的神经元本地顺行示踪剂注射。由于单个神经元是拓扑树,因此使用一致树形来总结由局部顺行示踪剂注射标记的神经元的集合是明智的。算法过程包括初始预处理步骤,以从原始体积图像数据中提取密度场,随后是使用密度场的1-(不)稳定流形的离散版本从密度场中提取初始骨架。启发式地,如果密度场被认为是一个山区景观,那么1-(不)稳定的流形如下的“山脊”连接的密度场的最大值。然后,我们简化这一图成一棵树,使用最短路径的方法和方法来自持久同源性。这种方法的优点是,它使用的密度场的全球信息,因此是强大的局部波动和非均匀分布的输入信号。为了能够处理大型数据集,我们使用分而治之的方法。生成的软件DiMorSC在Github上可用。
英文摘要:
Neuroscientific data analysis has classically involved methods for statistical signal and image processing, drawing on linear algebra and stochastic process theory. However, digitized neuroanatomical data sets containing labelled neurons, either individually or in groups labelled by tracer injections, do not fully fit into this classical framework. The tree-like shapes of neurons cannot mathematically be adequately described as points in a vector space. There is therefore a need for new approaches. Methods from computational topology and geometry are naturally suited to the analysis of neuronal shapes. Here we introduce methods from Discrete Morse Theory to extract tree-skeletons of individual neurons from volumetric brain image data, or to summarize collections of neurons labelled by localized anterograde tracer injections. Since individual neurons are topologically trees, it is sensible to summarize the collection of neurons labelled by a localized anterograde tracer injection using a consensus tree-shape. The algorithmic procedure includes an initial pre-processing step to extract a density field from the raw volumetric image data, followed by initial skeleton extraction from the density field using a discrete version of a 1-(un)stable manifold of the density field. Heuristically, if the density field is regarded as a mountainous landscape, then the 1-(un)stable manifold follows the "mountain ridges" connecting the maxima of the density field. We then simplify this skeleton-graph into a tree using a shortest-path approach and methods derived from persistent homology. The advantage of this approach is that it uses global information about the density field and is therefore robust to local fluctuations and non-uniformly distributed input signals. To be able to handle large data sets, we use a divide-and-conquer approach. The resulting software DiMorSC is available on Github.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。