This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

\correspondance
\extraAuth

A novel statistical methodology for quantifying the spatial arrangements of axons in peripheral nerves

Abida Sanjana Shemonti 1, Emanuele Plebani 2, Natalia P. Biscola 3, Deborah M. Jaffey 7, Leif A. Havton 3,4,5, Janet R. Keast 6, Alex Pothen 1, M. Murat Dundar 2, Terry Powley 7 and Bartek Rajwa 8∗
Abstract

A thorough understanding of the neuroanatomy of peripheral nerves is required for a better insight into their function and the development of neuromodulation tools and strategies. In biophysical modeling, it is commonly assumed that the complex spatial arrangement of myelinated and unmyelinated axons in peripheral nerves is random, however, in reality the axonal organization is inhomogeneous and anisotropic. Present quantitative neuroanatomy methods analyze peripheral nerves in terms of the number of axons and the morphometric characteristics of the axons, such as area and diameter. In this study, we employed spatial statistics and point process models to describe the spatial arrangement of axons and Sinkhorn distances to compute the similarities between these arrangements (in terms of first- and second-order statistics) in various vagus and pelvic nerve cross-sections. We utilized high-resolution TEM images that have been segmented using a custom-built high-throughput deep learning system based on a highly modified U-Net architecture. Our findings show a novel and innovative approach to quantifying similarities between spatial point patterns using metrics derived from the solution to the optimal transport problem. We also present a generalizable pipeline for quantitative analysis of peripheral nerve architecture. Our data demonstrate differences between male- and female-originating samples and similarities between the pelvic and abdominal vagus nerves. \helveticabold

1 Keywords: Peripheral nervous system, Neuroanatomy, Neuromodulation, Spatial point process, Optimal transport problem, Sinkhorn distance

2 Introduction

Understanding the functionalities of the peripheral nerves and developing neuromodulation tools require an in-depth quantitative characterization of the anatomy of the nerves. A large portion of the quantitative neuroanatomical studies focus on counting and comparing the number of myelinated and unmyelinated axons in the peripheral nerves in different animals (Hoffman and Schnitzlein, 1961; Krous et al., 1985; Asala and Bower, 1986; Prechtl and Powley, 1990; Pereyra et al., 1992; Soltanpour and Santer, 1996; Safi et al., 2016). There are studies on analyzing the changes in the number of myelinated and unmyelinated axons as the function of animals’ age (Krous et al., 1985; Pereyra et al., 1992; Soltanpour and Santer, 1996). The morphometric characteristics of the axons, such as area of axon cross-section, diameter, myelin thickness, are also well-developed and helpful for estimating electrode distances for neuromodulation purposes (Asala and Bower, 1986; Prechtl and Powley, 1990; Walter and Tsiberidou, 2019; Pelot et al., 2020; Havton et al., 2021; Settell et al., 2021).

The vagus is a complex, multi-functional peripheral nerve of the autonomic nervous system, containing both sensory and motor axons that regulate a wide variety of functions (Câmara and Griessenauer, 2015; Breit et al., 2018). These include regulation of the heart, respiratory tract, and many areas of the gastrointestinal system, influencing motility, secretions, and communication with the immune system. This breadth of activity and its bidirectional connectivity with the central nervous system have led to the vagus becoming a promising target for bioelectric medicine, through development of specific protocols for vagal nerve stimulation (VNS) (Bonaz et al., 2017a, b; Horn et al., 2019).

In addition to providing an alternative therapeutic approach for drug-resistant clinical conditions within organs, the vagal afferent connections to the brain provide opportunities for novel therapies directed to various psychiatric disorders. To improve the efficacy and specificity of VNS for each type of clinical condition, a greater understanding of the intra-vagal neural elements relating to each organ system is required (Howland, 2014; Thompson et al., 2019, 2022), as demonstrated by a recent study showing that fascicle-selective stimulation can reduce off-target effects of VNS (Thompson et al., 2022). This includes understanding the spatial organization of different functional classes of axons within and between fascicles. This spatial organization has not been investigated in depth within the visceral nervous system.

We have begun to address this knowledge gap using an extensive dataset of transmission electron microscopy (TEM) images derived from multiple cross-sections of the rat vagus. We have included in our study additional TEM images from the rat pelvic nerve, another multi-functional major nerve of the autonomic nervous system that supplies sensory and motor axons to the urogenital organs and lower bowel. Both TEM data sets have been published through the SPARC Portal (RRID: SCR_017041) under a CC-BY 4.0 license (Plebani et al., 2022).

Cross-sections of large peripheral nerves reveal a variety of components (myelinated and unmyelinated axons, Schwann cells), high-order structures (fascicles and Remak bundles), and raise questions regarding the spatial arrangement of these components, similarities between multiple arrangements, and their relationship to various biological factors including age, sex, and diseases. This study focuses on the unmyelinated axons segmented utilizing our high-throughput deep learning model (Plebani et al., 2022). We aim to define a notion of similarity (or dissimilarity) between the spatial arrangements of the unmyelinated axons and quantify the distances between them. We resort to spatial point patterns to represent the image data conveniently for analyzing the axons’ spatial organization. We use the centroids of the segmented axons to construct spatial point patterns. We consider spatial inhomogeneity and anisotropy to be the spatial features to represent the spatial arrangement of the axons, and be used for quantification. A known way to get an intuitive sense of spatial inhomogeneity (inhibition and/or attraction between points) and anisotropy of a point pattern is to investigate its second-order statistics (Ripley, 1976, 1977; Dixon, 2014).

Since Ripley’s summary of spatial statistical methods in 1977 the techniques for spatial pattern analysis have been occasionally employed in neuroscience, often by statisticians who saw the extraordinary complexity of neuroanatomical patterns to be a perfect demonstration of the spatial statistics inference ability (Bjaalie et al., 1991; Diggle et al., 1991; Prodanov et al., 2007; Jafari-Mamaghani et al., 2010; Waller et al., 2011).

However, the standard spatial statistical measures are not well suited for quantifying a definite distance between different non-random patterns. Therefore, we propose a method that involves computing the local second-order spatial statistics for the nerve fascicles to capture their spatial arrangement and utilizing a revised optimal transport distance (Sinkhorn distance) to measure similarities between the second-order spatial statistics of every pair of nerve cross-sections. We visualize the resulting Sinkhorn distance matrix in a new metric space using multi-dimensional scaling that helps interpret the similarity (dissimilarity) of the spatial features in the nerve cross-sections. Our concept of Sinkorn distance embedding was influenced by related work on optimal transport-based morphometry applications in cell biology (Wang et al., 2013; Basu et al., 2014).

In addition to addressing a neuroscientific problem of quantifying the vagus nerve anatomy with computer science tools, we intend to bring together a variety of approaches from various computer science domains to extend the toolkit for point-pattern comparisons in biology. Utilizing the optimal transport framework to establish a quantitative measure for spatial point patterns and advance the workflow of quantitative analysis of peripheral nerve architecture, our method could be used beyond neuroscience. We believe that our findings contribute to the establishment of spatially selective stimulation of nerve axons to improve the efficacy of VNS.

Refer to caption
Figure 1: The pipeline for the quantitative analysis of the spatial arrangement of axons in the peripheral nerve cross-sections.

Figure 1 depicts a high-level overview of the steps in the quantitative analysis of the spatial arrangement of axons in the peripheral nerve architecture presented in this paper. We explain each component of the pipeline in the following sections. The biological data and the data preprocessing steps are described in Section 3.1. The basics of spatial point pattern, spatial statistics, and optimal transport framework are introduced in Section 3.2 and Section  3.3, respectively. We provide details on the experimental setup and results in Section 4, which cover steps 22, 33, and 44 of the computational pipeline. We discuss the results of the empirical study in Section 5 before concluding.

3 Materials and Methods

3.1 Biological data and automated segmentation

Although the vagus nerve anatomy was the primary motivation behind this study, we use the TEM images of the vagus and pelvic nerve cross-sections in rats for comparisons. A list of the TEM images used in this study is shown in Table 1. The protocols and techniques followed for nerve sample collection, processing, and imaging are documented in our previous work (Plebani et al., 2022). The data is publicly available via NIH-supported SPARC Pennsieve database (Havton et al., 2022). Briefly, the unmyelinated axons in some of these TEM images were manually annotated and used as labeled data to train, validate, test, and evaluate an automated segmentation model based on the U-Net architecture (Ronneberger et al., 2015; Plebani et al., 2022). The segmentation model is a U-Net with four stages: the convolutional layers have a batch normalization layer followed by a ReLU activation layer, and the bottleneck stage has extra dropout layers between convolutions (Plebani et al., 2022). The model classifies the TEM image pixels as one of the three following classes: (a) fiber if it is inside an unmyelinated axon, (b) border if it is in a boundary region between an axon and the rest of the image defined by the outer edge of each axon, and (c) background. An updated version of the model111at https://github.com/Banus/umf_unet was used here to segment the unmyelinated axons. The resulting axon counts are listed in Table 1. We used the open-source image processing package Fiji (Schindelin et al., 2012) to extract the centroid coordinates of the segmented unmyelinated axons and the functions in R packages to establish the outer boundaries and inner void spaces of the nerve cross-sections, to construct the spatial point patterns. Images 15 (vagus) and 29 (pelvic) listed in Table 1 are shown in Figure 2A and Figure 2D respectively, along with their corresponding automated segmentations and spatial point patterns.

Table 1: The list of the TEM images of vagus and pelvic nerve cross-sections in rats used in this study. The vagus and the pelvic nerve cross-sections are collected from the following nerve locations - CT: Cervical Trunk, AVAT: Abdominal Vagus Anterior Trunk, AVPT: Abdominal Vagus Posterior Trunk, AVAG: Abdominal Vagus Anterior Gastric (Ventral Gastric Branch), PG: Pelvic Ganglion. The information regarding the Images 12-29 were published in Plebani et al. (2022).
Image ID Image size Resolution Nerve Location Sex # Segmented
(pixel×\timespixel) (nm/pixel) axons
1 2994×\times2497 11.9 Vagus Right CT F 183
2 10624×\times6686 11.9 Vagus Right CT F 5020
3 21005×\times22847 11.9 Vagus Right CT F 13375
4 7707×\times7978 11.9 Vagus AVAT F 4538
5 9633×\times15046 11.9 Vagus AVPT F 10328
6 13120×\times14400 11.9 Vagus AVAG F 6566
7 19921×\times9680 8.7 Vagus AVPT F 8980
8 5175×\times3784 11.9 Vagus AVAG F 407
9 12328×\times9692 13.7 Vagus Right CT M 7647
10 6794×\times5472 13.7 Vagus Right CT M 871
11 5262×\times7111 13.7 Vagus AVPT M 9109
12 24746×\times20682 11.9 Vagus Right CT F 12992
13 20372×\times27269 11.9 Vagus Left CT F 14155
14 7953×\times5781 11.9 Vagus AVAG F 1698
15 8446×\times7258 13.7 Vagus AVAG M 4938
16 4128×\times4068 13.7 Vagus AVAG M 1061
17 9935×\times8870 13.7 Vagus AVAG M 4654
18 5521×\times4971 13.7 Vagus AVAG M 1409
19 8633×\times8866 11.9 Pelvic \leq2mm from PG M 1663
20 3891×\times3334 11.9 Pelvic \leq2mm from PG M 297
21 2754×\times2958 11.9 Pelvic \leq2mm from PG M 209
22 3357×\times3823 11.9 Pelvic \leq2mm from PG M 303
23 4419×\times5701 11.9 Pelvic \leq2mm from PG M 608
24 2804×\times4221 11.9 Pelvic \leq2mm from PG M 350
25 5064×\times7207 11.9 Pelvic \leq2mm from PG M 652
26 5869×\times6268 11.9 Pelvic \leq2mm from PG M 990
27 7941×\times6372 11.9 Pelvic \leq2mm from PG M 1372
28 4028×\times3513 11.9 Pelvic \leq2mm from PG M 460
29 11129×\times7962 11.9 Pelvic \leq2mm from PG M 2363
Refer to caption
Figure 2: (A, D) The transmission electron microscopy (TEM) images of the nerve cross-section of Image 15 (vagus) and Image 29 (pelvic) listed in Table 1 respectively. The visible void spaces in the nerve cross-sections are blood vessels. The tiny light grey regions without any border are the unmyelinated axons. The myelinated axons have slightly darker grey borders. (B, E) The automated segmentation of the unmyelinated axons (the white regions) in the nerve cross-sections. (C, F) The spatial point patterns constructed with the centroid locations (the black circles) of the segmented unmyelinated axons.

Before reporting the experimental details, we provide a brief overview of spatial point patterns, spatial statistics concepts, and optimal transport framework in the following two subsections.

3.2 Spatial point patterns and spatial statistics

A spatial point pattern (SPP) is a set of spatial locations associated with entities of interest in 2-D or 3-D space, encompassed by an observation window (Møller and Waagepetersen, 2003; Stoyan, 2006; Jafari-Mamaghani et al., 2010; Baddeley et al., 2015). The analysis of SPP aims to study the spatial arrangement of the points in an SPP and establish trends to describe the point pattern. Two fundamental descriptive characteristics of an SPP are intensity and interaction. The intensity (ρ\rho or ρ(u)\rho(u)) of a point pattern, a first-order statistics, is the average number of points per unit area, and it could be uniform across the observation window (homogeneous), or it could vary according to an intensity function (inhomogeneous). A point pattern’s intensity is usually denoted by λ\lambda in literature, but we use ρ\rho to avoid confusion with another notation related to the optimal transport problem. The interaction is associated with a distance (rr) and describes the influence the points have on their neighbors within rr radius. The interaction is termed complete spatial randomness (CSR) if the points are independent. The points can exhibit positive interaction (spatial attraction), negative interaction (spatial inhibition), or a combination of both.

It is common practice to use second-order statistics such as Besag’s centered LL-function, which is a transformation of Ripley’s KK-function (Ripley, 1976, 1977; Besag, 1977), to investigate the interaction in point patterns. Let 𝐗\mathbf{X} be a point pattern and t(u,r,𝐗)t(u,r,\mathbf{X}) be the number of points in 𝐗\mathbf{X} which lie within distance rr of the location uu. Assuming 𝐗\mathbf{X} is a homogeneous point pattern with intensity ρ\rho, the number of points within distance rr of a specific point is represented by ρK(r)\rho K(r) (Ripley, 1976).

Ripley’s K-function: K(r)=𝔼[t(u,r,𝐗)|u𝐗]ρ,Besag’s centered L-function: L(r)=K(r)πr\begin{gathered}\text{Ripley’s $K$-function: }K(r)=\frac{{\mathbb{E}\left[{t\left({u,r,{\mathbf{X}}}\right)|u\in{\mathbf{X}}}\right]}}{\rho},\\ \text{Besag's centered $L$-function: }L(r)=\sqrt{\frac{{K(r)}}{\pi}}-r\end{gathered} (1)

An estimator for the empirical KK-function (K^(r)\hat{K}(r)) is formulated in Equation 2, which is the cumulative average number of neighbors within rr radius of a typical point, standardised by the intensity and corrected for edge effects.

K^(r)=Wn(n1)i=1nj=1,jinν(dijr)eij(r)\hat{K}(r)=\frac{W}{{n(n-1)}}\sum\limits_{i=1}^{n}{\sum\limits_{j=1,j\neq i}^{n}{\nu({d_{ij}}\leqslant r){e_{ij}}(r)}} (2)

where ν(.)\nu(.) is an indicator function that equals 11 if the argument is true and otherwise is 0. Here nn is the number of points; WW is the area of the observation window; rr is the interaction distance; dijd_{ij} is the Euclidean distance between xix_{i} and xjx_{j}; and eije_{ij} denotes weights for edge correction (Baddeley et al., 2015). The KK- and LL-functions can illustrate the non-random spatial arrangement of the points if compared with CSR. They are invariant to the intensity of a point pattern and to missing random points (Ripley, 1976; Baddeley et al., 2000), which allows these second-order statistics to be compared when the number of points and observation window vary in the point patterns under consideration. Positive values of the centered LL-function depict spatial attraction, and negative values describe spatial inhibition in a point pattern.

When dealing with inhomogeneous point patterns, an inhomogeneous LL-function, based on the inhomogeneous KK-function (Kinhom(r)K_{\textrm{inhom}}(r)) can be evaluated. The estimator for the inhomogeneous KK-function (K^inhom(r)\hat{K}_{\textrm{inhom}}(r)) is formulated in Equation 3 below.

K^inhom(r)=1DpWi=1nj=1,jinν(dijr)ρ^(xi)ρ^(xj)eij(r),Dp=(1Wi=1n1ρ^(xi))p,p{1,2}\begin{gathered}{{\hat{K}}_{\textrm{inhom}}}\left(r\right)=\frac{1}{{{D^{p}}W}}\sum\limits_{i=1}^{n}{\sum\limits_{j=1,j\neq i}^{n}{\frac{{\nu({d_{ij}}\leqslant r)}}{{\hat{\rho}\left({{x_{i}}}\right)\hat{\rho}\left({{x_{j}}}\right)}}}}e_{ij}(r),\hfill\\ {D^{p}}={\left({\frac{1}{W}\sum\limits_{i=1}^{n}{\frac{1}{{\hat{\rho}\left({{x_{i}}}\right)}}}}\right)^{p}},\quad p\in\left\{{1,2}\right\}\hfill\\ \end{gathered} (3)

where ρ^(u)\hat{\rho}(u) is an estimator of the intensity function ρ(u)\rho(u), obtained using a kernel-smoothed (described later in the paper) intensity estimator (Baddeley et al., 2015). Figure 3 shows the Besag’s centered inhomogeneous L-function computed for Image 15 (vagus) and Image 29 (pelvic), listed in Table 1 and displayed in Figure 2. It illustrates spatial inhibition for a small range of interaction distance at the beginning, then spatial attraction for both the samples. The spatial attraction, in other words, the clustering tendency is more apparent in the pelvic sample which agrees with the images shown in Figure 2.

Refer to caption
Figure 3: Besag’s centered inhomogeneous LL-function computed for Images 15 and 29. The shaded area around L(r)L(r)=0 shows the significance bands of complete spatial randomness (CSR). The solid lines illustrate the non-random spatial arrangement of the point patterns compared to CSR. The shaded area around the solid lines shows the boundaries of 9595-percentile confidence interval.

An SPP is anisotropic if any of its statistical characteristics change when the point pattern is rotated about any axis in 2-D or 3-D space. The KK- and LL-functions can be modified in various ways to estimate anisotropy (Ohser and Stoyan, 1981; Stoyan et al., 2013). Computing the cumulative distribution of the neighbors within a section of the disc of rr radius between two directional preferences θ1\theta_{1} and θ2\theta_{2}, instead of the entire disc of rr radius, gives the sector KK- and LL-functions (Baddeley et al., 2015).

When an SPP exhibits different interactions in different places, it is beneficial to look into the spatial statistics locally by decomposing them into contributions from individual points (Baddeley et al., 2015). If the KK-function estimator (K^(r)\hat{K}(r)) shown in Equation 2 is decomposed, the contributions from individual points are referred to as local KK-functions and can be formulated as follows:

K^(r,xi)=Wn1j=1,jinν(dijr)eij(r), for i=1,,n\hat{K}(r,x_{i})=\frac{W}{n-1}\sum\limits_{j=1,j\neq i}^{n}{\nu({d_{ij}}\leqslant r){e_{ij}}(r)},\text{ for }i=1,\dots,n (4)

The estimator K^(r)\hat{K}(r) is simply the average of all the K^(r,xi)\hat{K}(r,x_{i})s for i=1,,ni=1,\dots,n. Arbitrarily, the centered local LL-functions are formulated as : L^(r,xi)=(K^(r,xi)/π)1/2r\hat{L}(r,x_{i})=(\hat{K}(r,x_{i})/\pi)^{1/2}-r. This notion of decomposition is applicable for the inhomogeneous and anisotropic KK- and LL-functions as well.

The points in an SPP may be of different types (multitype point pattern). The additional information attached to each point in point patterns is called a mark and can hold categorical or continuous-valued, physical or statistical characteristics. The points can carry additional attributes (forming marked point patterns) or be linked to the space of interest (covariates). It is often helpful to apply spatial smoothing to the marks of a point pattern for visualization and various post-processing purposes. The result of the kernel-smoothing (usually with Gaussian kernel) at a location uu is a spatially weighted average of the marks attached to the points in the neighborhood of uu (Baddeley et al., 2015). This is also known as the Nadaraya-Watson smoother (Nadaraya, 1964, 1989; Watson, 1964).

We intend to utilize the spatial statistics discussed above, specifically spatial intensity, and local inhomogeneous and anisotropic LL-functions to describe the spatial arrangement of the point patterns constructed from the unmyelinated axons in the nerve cross-sections.

3.3 Optimal transport framework and Sinkhorn distance

The transport problem distributes a certain amount of mass from a set of sources to a set of destinations at minimum cost. There are two major factors in a transport problem: the cost function and the transportation plan. The cost function defines a fixed, non-negative effort required to transport unit mass from a source to a destination. This cost may only depend on the distance between the source and the destination or on other additional factors; in the former case a Euclidean distance matrix between the sources and the destinations is a reasonable representation of effort.

Once the cost of transportation is represented, the remaining part of the problem involves transporting a non-negative amount of mass between sources and destinations, as described by a transportation plan. Various transportation plans result in different total costs, and the optimal transport problem (OT) aims to minimize this cost. The OT problem is balanced if the total mass at the sources equals the total mass at the destinations, and unbalanced otherwise (Peyré and Cuturi, 2019).

Let rr and cc be two dd dimensional vectors representing the amount of mass at the dd sources and the dd destinations, respectively. The number of sources and destinations could differ, but they can be considered equal without loss of generality. Let U(r,c)U(r,c) be the set of all non-negative d×dd\times d matrices with row and column summing to rr and cc, respectively. Any matrix PU(r,c)P\in U(r,c) describes a transportation plan that transports the mass in rr to cc. Given a d×dd\times d cost matrix MM, the total cost of mapping rr to cc using the transportation plan PP is i,jPijMij\sum_{i,j}P_{ij}M_{ij}. Thus the OT problem between rr and cc given cost MM can be formulated by Equation 5, where DM(r,c)D_{M}(r,c) is the optimal transport distance:

DM(r,c)=minPU(r,c)i,jPijMij,subject tojPij=ri,iPij=cj,Pij0,i,jd.\begin{gathered}D_{M}(r,c)=\min_{P\in U(r,c)}\sum_{i,j}P_{ij}M_{ij},\\ \text{subject to}\quad\sum_{j}P_{ij}=r_{i},\quad\sum_{i}P_{ij}=c_{j},\quad P_{ij}\geq 0,\quad\forall i,j\leq d.\end{gathered} (5)

The masses in rr and cc could be normalized to sum to one, and then both rr and cc can be interpreted as probability distributions.

For DM(r,c)D_{M}(r,c) to be a metric, the cost matrix MM has to be a metric matrix (Villani, 2009; Avis, 1980; Brickell et al., 2008) satisfying the conditions shown in Equation 6.

Non-negativity: Mij0,Identity: Mii=0,Symmetry: Mij=Mji,Triangle inequality: MijMik+Mkj,i,j,kd.\begin{gathered}\text{Non-negativity: }M_{ij}\geq 0,\\ \text{Identity: }M_{ii}=0,\\ \text{Symmetry: }M_{ij}=M_{ji},\\ \text{Triangle inequality: }M_{ij}\leq M_{ik}+M_{kj},\quad\forall i,j,k\leq d.\end{gathered} (6)

An OT problem is a convex optimization problem that can be solved using various approaches (Ahuja et al., 1993; Orlin, 1993) and for a general cost matrix the computational cost scales as 𝒪(d3log(d))\mathcal{O}(d^{3}log(d)) (Pele and Werman, 2009), which prevents scaling the solution to large problem sizes. Earlier approximate solutions obtained by putting constraints on the cost matrix could result in a loss of applicability and performance (Grauman and Darrell, 2004). A later approximation to the original OT problem using an entropic regularization scheme was proposed by Cuturi (2013) to reduce the computational complexity. The scheme employs the Sinkhorn-Knopp matrix scaling algorithm (Sinkhorn and Knopp, 1967; Knight, 2008), and hence the name Sinkhorn distance for its objective function.

3.3.1 Sinkhorn distance

A straightforward way of thinking about a transportation plan is by noticing that if a source contains more mass, it should originate more, and if a destination requires more mass, it should receive proportionally more. Such a transportation plan is represented by rcTrc^{T}, and the optimal plan PP should be somewhere around the distribution rcTrc^{T}. Simply speaking, the idea of the entropic regularization scheme by Cuturi (2013) is to choose PP from a smaller set near rcTrc^{T}, instead of the entire set U(r,c)U(r,c).

To capture these ideas, Cuturi (2013) imposes an additional constraint of Kullback-Leibler (KL) divergence on the OT formulation, as shown in Equation 7, and computes the Sinkhorn distance DM,α(r,c)D_{M,\alpha}^{*}(r,c). This constraint introduces a set Uα(r,c)U(r,c)U_{\alpha}(r,c)\subset U(r,c) from which an optimal transportation plan PP is selected. The KL divergence distance between PP and rcTrc^{T} is set to be smaller than a predefined parameter α\alpha. In other words, PP should belong to a distribution near rcTrc^{T}.

DM,α(r,c)=minPUα(r,c)i,jPijMij,subject toKL(P|rcT)α,jPij=ri,iPij=cj,i,jd.\begin{gathered}D_{M,\alpha}^{*}(r,c)=\min_{P\in U_{\alpha}(r,c)}\sum_{i,j}P_{ij}M_{ij},\\ \text{subject to}\quad\textbf{KL}(P|rc^{T})\leq\alpha,\quad\sum_{j}P_{ij}=r_{i},\quad\sum_{i}P_{ij}=c_{j},\quad\forall i,j\leq d.\end{gathered} (7)

The entropy (hh) of the transportation plan (PP) and the mass vectors (rr and cc) are given in Equation 8:

h(P)=ijPijlogPij,h(r)=irilogri,h(c)=jcjlogcj.\begin{gathered}h(P)=-\sum_{ij}P_{ij}\log P_{ij},\\ h(r)=-\sum_{i}r_{i}\log r_{i},\quad h(c)=-\sum_{j}c_{j}\log c_{j}.\end{gathered} (8)

We proceed to express the KL divergence constraint in terms of the entropy:

KL(P|rcT)\displaystyle\textbf{KL}(P|rc^{T}) =ijPijlogPijricj\displaystyle=\sum_{ij}P_{ij}\log\frac{P_{ij}}{r_{i}c_{j}} (9)
=ijPijlogPijijPijlogriijPijlogcj\displaystyle=\sum_{ij}P_{ij}\log P_{ij}-\sum_{ij}P_{ij}\log r_{i}-\sum_{ij}P_{ij}\log c_{j}
=ijPijlogPijirilogrijcjlogcj[jPij=ri,iPij=cj]\displaystyle=\sum_{ij}P_{ij}\log P_{ij}-\sum_{i}r_{i}\log r_{i}-\sum_{j}c_{j}\log c_{j}\quad[\because\sum_{j}P_{ij}=r_{i},\sum_{i}P_{ij}=c_{j}]
=h(P)+h(r)+h(c)α.\displaystyle=-h(P)+h(r)+h(c)\leq\alpha.

Thus the new constraint states that the entropy of PP should be large enough to satisfy

h(P)h(r)+h(c)α,h(P)\geq h(r)+h(c)-\alpha,

which constrains PP to be chosen from the Kullback-Leibler ball of level α\alpha centered about rcTrc^{T} (see Figure 1 in (Cuturi, 2013)).

This interpretation makes the OT problem non-convex, and an alternative formulation of Sinkhorn distance is required for ease of optimization. For every pair (r,c)(r,c), each α\alpha corresponds to a Lagrange multiplier λ[0,)\lambda\in[0,\infty) such that DM,α(r,c)=DMλ(r,c)D_{M,\alpha}^{*}(r,c)=D_{M}^{\lambda}(r,c). The distance DMλD_{M}^{\lambda}, shown in Equation 10, is called the dual-Sinkhorn divergence by Cuturi (2013).

DMλ(r,c)=i,jPijλMij,where Pλ=argminPU(r,c)i,jPijMijλh(P),subject tojPij=ri,iPij=cj,i,jd.\begin{gathered}D_{M}^{\lambda}(r,c)=\sum_{i,j}P^{\lambda}_{ij}M_{ij},\quad\text{where }P^{\lambda}=\underset{P\in U(r,c)}{\operatorname{argmin}}\;\sum_{i,j}P_{ij}M_{ij}-\lambda h(P),\\ \text{subject to}\quad\sum_{j}P_{ij}=r_{i},\quad\sum_{i}P_{ij}=c_{j},\quad\forall i,j\leq d.\end{gathered} (10)

By introducing two dual variables ϕ\phi and ψ\psi for each of the two equality constraints of Equation 10, the Lagrangian of the objective function can be written as Equation 11.

(P,ϕ,ψ)=i,jPijMijλh(P)+iϕi(jPijri)+jψj(iPijcj).\mathcal{L}(P,\phi,\psi)=\sum_{i,j}P_{ij}M_{ij}-\lambda h(P)+\sum_{i}\phi_{i}(\sum_{j}P_{ij}-r_{i})+\sum_{j}\psi_{j}(\sum_{i}P_{ij}-c_{j}). (11)

The derivative of the Lagrangian objective function with respect to PijP_{ij}, for any pair (i,j)(i,j), can be set to zero to obtain an extremum; the second derivative of the Lagrangian, (λPij\frac{\lambda}{P_{ij}}), is positive since both the numerator and the denominator are positive, and thus we have obtained a minimizer of the Lagrangian.

Pij\displaystyle\frac{\partial\mathcal{L}}{\partial P_{ij}} =Mij+λ+λlogPij+ϕi+ψj=0.\displaystyle=M_{ij}+\lambda+\lambda\log P_{ij}+\phi_{i}+\psi_{j}=0. (12)
Pij\displaystyle\implies\ P_{ij} =eϕiλ12.eMijλ.eψjλ12\displaystyle=e^{-\frac{\phi_{i}}{\lambda}-\frac{1}{2}}.e^{-\frac{M_{ij}}{\lambda}}.e^{-\frac{\psi_{j}}{\lambda}-\frac{1}{2}}
uiKijvj[ui=eϕiλ12,vj=eψjλ12,K=eMλ]\displaystyle\equiv u_{i}K_{ij}v_{j}\quad[u_{i}=e^{-\frac{\phi_{i}}{\lambda}-\frac{1}{2}},v_{j}=e^{-\frac{\psi_{j}}{\lambda}-\frac{1}{2}},K=e^{-\frac{M}{\lambda}}]

Given KK, rr and cc, the Sinkhorn-Knopp matrix scaling algorithm converges to a solution PλP^{\lambda} of the following form:

u,v:Pλ=diag(u)Kdiag(v).\exists u,v:P^{\lambda}=\textbf{diag}(u)K\textbf{diag}(v). (13)

PλP^{\lambda} should have the correct row and column sums, as shown in Equation 10. We deduce the update rule for the Sinkhorn-Knopp algorithms from those constraints in the following manner:

jPijλ=ri,\displaystyle\sum_{j}P_{ij}^{\lambda}=r_{i}, iPijλ=cj\displaystyle\sum_{i}P_{ij}^{\lambda}=c_{j}
\displaystyle\implies juiKijvj=ri[Equation12]\displaystyle\sum_{j}u_{i}K_{ij}v_{j}=r_{i}\quad[\text{Equation}~{}\ref{eq:lagrange_derivative}] \displaystyle\implies iuiKijvj=cj[Equation12]\displaystyle\sum_{i}u_{i}K_{ij}v_{j}=c_{j}\quad[\text{Equation}~{}\ref{eq:lagrange_derivative}]
\displaystyle\implies uijKijvj=ri\displaystyle u_{i}\sum_{j}K_{ij}v_{j}=r_{i} \displaystyle\implies vjiuiKij=cj\displaystyle v_{j}\sum_{i}u_{i}K_{ij}=c_{j}
\displaystyle\implies ui=ri/jKijvj\displaystyle u_{i}=r_{i}/\sum_{j}K_{ij}v_{j} \displaystyle\implies vj=cj/iuiKij\displaystyle v_{j}=c_{j}/\sum_{i}u_{i}K_{ij}

Thus the update rule for the Sinkhorn-Knopp algorithm can be written as Equation 14, where vv can be initialized randomly.

u=r./(Kv),v=c./(KTu).\begin{gathered}u=r./(Kv),\\ v=c./(K^{T}u).\end{gathered} (14)

Cuturi (2013) observes that the number of iterations in the Sinkhorn-Knopp algorithm is bounded independent of dd. Thus, the cost of computing DMλD_{M}^{\lambda} is 𝒪(d2)\mathcal{O}(d^{2}), which is an improvement over 𝒪(d3log(d))\mathcal{O}(d^{3}log(d)). Cuturi (2013) describes an approach to compute the Sinkhorn distance (DM,α(r,c)D_{M,\alpha}^{*}(r,c)) through the dual-Sinkhorn divergence (DMλ(r,c)D_{M}^{\lambda}(r,c)), and also reports that the dual-Sinkhorn divergence does not perform worse than the classic optimal transport distances. Therefore, we use the dual-Sinkhorn divergence to measure the distance between the spatial statistics of the point patterns in our experiments and refer to as the Sinkhorn distance. We utilize the R packages T4transport (You, 2020) and Barycenter (Klatt, 2018) for computing the dual-Sinkhorn divergences, and spatstat (Baddeley et al., 2015) for spatial point pattern analysis.

4 Experiments and results

We represent the unmyelinated axonal arrangements in the vagus and pelvic nerve cross-sections as spatial point patterns. We intend to quantify (using the Sinkhorn distance) similarities between the point patterns in terms of the following spatial features:

  1. 1.

    spatial intensity,

  2. 2.

    local inhomogeneous LL-function,

  3. 3.

    local inhomogeneous anisotropic LL-function with

    1. (a)

      horizontal and

    2. (b)

      vertical sectors.

For the horizontal and vertical cases, we choose sectors forming 15°segment around the horizontal (0°) and vertical (90°) axes, respectively. We attach the above-mentioned spatial features to the point patterns as marks (described in Section 3.2). We compute the Sinkhorn distance between every pair of point patterns, for the four spatial features, in two different manners:

  1. 1.

    using the spatial point patterns directly (in Section 4.4) and

  2. 2.

    using the map of the spatial features constructed by kernel-smoothing (in Section 4.5).

The Sinkhorn distance between every pair of nerve cross-sections is then used to construct a symmetric Sinkhorn distance matrix and visualized in an embedded space via multi-dimensional scaling. In the following three subsections, we describe a few preprocessing and parameter selection tasks required for configuring the spatial features, before going into the experimental details.

4.1 Interaction distance configuration

A critical issue regarding the computation of local inhomogeneous LL-functions is determining the interaction distance (rr), described in Section 3.2. The point patterns constructed from the nerve cross-sections differ in size, as do their interaction ranges. The preferred choice for the interaction distance is the one that can reasonably separate the spatial features of the point patterns. We compute a range of interactions that are common for all the point patterns and configure the interaction distance using two approaches: (a) based on the standard deviations of the inhomogeneous LL-function of all the point patterns and (b) based on the F-ratio (analysis of variance) of the inhomogeneous LL-function of the point patterns grouped as vagus vs. pelvic, within the expected range.

4.2 Translation and rotation normalization

The optimal transport distance is not invariant under translations and rotations (Wang et al., 2013). This is critical in the case of analyzing the point patterns because spatial inhomogeneity and anisotropy depend largely on the placement and orientation of the point patterns. To provide translation invariance, we scale the point patterns maintaining proportionality, align the center of mass to the origin, and apply the necessary 0-padding around the biological structures.

Ensuring rotation invariance is non-trivial. In an ideal setting, the information regarding the orientation of the biological structures would be available directly to the analyst. Unfortunately, the experimental and instrumental setting may not always allow the orientation of the samples to be maintained during the specimen preparation and the imaging process. Therefore, we implemented a post-hoc minimization process as a workaround. While computing the Sinkhorn distance between the spatial intensities of a pair of point patterns, we keep the orientation of one of them unchanged and rotate the other one about the origin by multiple θ\theta values (θ=\theta=45°in our experiments). We compute the Sinkhorn distance for all possible values of θ\theta and keep the orientation that provides the smallest Sinkhorn distance result. We use this identified orientation for the computation of other spatial features. This method provides a reproducible procedure in the absence of known anatomical orientation data.

4.3 The entropic regularization parameter

We refer to the coefficient of the entropy of the transportation plan (h(P)h(P)) in the dual-Sinkhorn divergence formulation shown in Equation 10, λ\lambda, as the entropic regularization parameter. As λ0\lambda\rightarrow 0, Sinkhorn distance approaches the optimal transport distance (Wasserstein distance, provided that the cost is Euclidean distance). As λ\lambda increases, the computation results in different approximations of the optimal transport distance, i.e., the Sinkhorn distances. Tuning the appropriate entropic regularization parameter is an important task. We can consider two scenarios: (a) selecting an entropic regularization parameter that provides better separation between analyzed instances and (b) selecting an entropic regularization parameter that makes the Sinkhorn distance a more accurate approximation of the exact optimal transport distance. Thus, parameter tuning is a trade-off between favoring the utility of the method (and lower computational cost) and the accuracy of the approximation. We experimented with λ\lambda = {0.01, 0.05, 0.1, 0.5, 1.0, 2.0, 5.0}, and report the the results for λ\lambda=0.01.

4.4 Sinkhorn distance between spatial point patterns

In this section, we compute Sinkhorn distance between the spatial point patterns (directly) of the nerve cross-sections, for the four spatial features mentioned earlier. Let S1S_{1} and S2S_{2} be two spatial point patterns, with n1n_{1} and n2n_{2} number of points respectively. Considering an optimal transport problem between S1S_{1} and S2S_{2}, we assume that each point in S1S_{1} contains 1n1\frac{1}{n_{1}} amount of mass (rr), therefore the total mass =1n1×n1=1=\frac{1}{n_{1}}\times n_{1}=1. Similarly, each point in S2S_{2} requires 1n2\frac{1}{n_{2}} amount of mass (cc), so the total mass =1n2×n2=1=\frac{1}{n_{2}}\times n_{2}=1. Thus the problem is to transport the mass from S1S_{1} to S2S_{2} (balanced). The inputs for the computations are the spatial locations of the points in S1S_{1} and S2S_{2}. Therefore, we can compute the Euclidean distance matrix between them to be the cost matrix MM, of dimension n1×n2n_{1}\times n_{2}. Here, the cost matrix MM captures the spatial intensity of the point patterns. Further, we compute the transportation plan PP, of dimension n1×n2n_{1}\times n_{2}, using the formulation described in Section 3.3.1 and obtain the Sinkhorn distance, which provides a measure of similarity of the spatial intensity between S1S_{1} and S2S_{2}.

In the cases of the three other spatial features, the cost matrix (MM) remains the same (the spatial location of the points are unchanged), but the amount of mass produced (rr) or required (cc) at each point changes. The local inhomogeneous LL-function attaches a numerical value to each point in a point pattern that captures its local spatial interaction within a certain interaction distance. Instead of a uniform mass amount, we may assume that each point in S1S_{1} and S2S_{2} is assigned an amount of mass that equals its local inhomogeneous LL-function value. We normalize the values assigned to each point pattern to sum to one. Then we can compute the transportation plan PP in the same manner as described above. The resultant Sinkhorn distance gives us a measure of similarity of the local spatial interaction between S1S_{1} and S2S_{2}. The Sinkhorn distances for the anisotropic spatial features, the local inhomogeneous anisotropic LL-function with horizontal and vertical sectors, are also computed similarly.

Refer to caption
Figure 4: (A, C-I) A set of images of the segmented unmyelinated axons in the nerve cross-sections, labeled with the Image ID. (B) An embedding of the spatial intensity of the spatial point patterns in the Sinkhorn space for entropic regularization parameter λ=0.01\lambda=0.01. The vagus and the pelvic samples are shown in cyan and orange (circles for female (F) and triangles for male (M)), respectively, and labeled with the Image ID listed in Table 1.

We have 29 nerve cross-sections in the dataset and once we compute the Sinkhorn distance between every pair, we can construct Sinkhorn distance matrices of dimension 29×\times 29, for each of the four spatial features. We use muti-dimensional scaling to embed the Sinkhorn distance matrices in 2-D to illustrate the computed Sinkhorn distance between the spatial features and interpret the notion of similarity (or dissimilarity) between the nerve cross-sections. We denote the new embedded 2-D space as the Sinkhorn space.

Figure 4B shows an embedding of the spatial intensity of the spatial point patterns (used directly) in the Sinkhorn space for entropic regularization parameter λ\lambda=0.01. The vagus and the pelvic samples are shown in cyan and orange, respectively, and labeled with the Image ID listed in Table 1. Figure 4H shows Image 13 (vagus), which is positioned far from the other samples in the Sinkhorn space. It is the largest sample in our dataset regarding image size and the number of segmented unmyelinated axons. It is also the only sample from a left cervical trunk. Figure 4A and Figure 4C display Image 12 and Image 3 (both vagus) respectively. They are collected from the right cervical trunks. Figure 4I shows Image 7 (vagus) from abdominal vagus posterior trunk. Considering the spatial intensity, these four vagus samples are embedded far apart and are visually different. The rest of the samples are positioned in proximity, yet we can see a rightward tendency in the vagus samples than the pelvic ones. Figure 4(D, E) show Image 1 and Image 16 (both vagus) respectively. They look spatially different from the vagus samples discussed so far and are embedded at the leftmost part of the Sinkhorn space, far from those samples. However, they have a similar spatial organization as Image 28 and Image 22 (both pelvic) shown in Figure 4(F, G) and are embedded closer in the Sinkhorn space.

Although one can intuitively understand the global differences in spatial intensity of the point patterns by looking at the images of segmented unmyelinated axons in the nerve cross-sections, our approach can quantify and visualize the differences with the Sinkhorn distance between every pair of samples, resulting in a map of patterns. For instance, in Figure 4B, the Sinkhorn distances between the spatial intensity of Image 1, and Image 3 and Image 12 are 0.257 and 0.254 respectively, whereas the distance between Image 3 and Image 12 is 0.107. Again, Image 16 and Image 28 have respectively distances 0.054 and 0.048 from Image 1.

Refer to caption
Figure 5: (A, B) The segmented unmyelinated axons and the spatial point pattern of Image 18 (vagus) listed in Table 1. (C-E) The embeddings of the local inhomogeneous and anisotropic LL-functions (no sector, horizontal sector, and vertical sector) of the spatial point patterns in the Sinkhorn space for entropic regularization parameter λ=0.01\lambda=0.01. The vagus and the pelvic samples are shown in cyan and orange (circles for female (F) and triangles for male (M)), respectively, and labeled with the Image ID listed in Table 1.

Interpreting spatial statistics, such as local inhomogeneous and anisotropic LL-functions, can be more challenging than understanding raw spatial intensity. Figure 5(C-E) show three embeddings of the spatial features in the Sinkhorn space for λ\lambda=0.01: the local inhomogeneous LL-function, the local inhomogeneous LL-function with horizontal sector and vertical sector, respectively. With a few exceptions, the overall landscape in the embeddings is similar to the one for the spatial intensity shown in Figure 4B. Figure 5A, showing the segmented unmyelinated axons for Image 18 (vagus) contains several elongated axons. The elongated axons make the spatial arrangement of centroids in the corresponding point pattern (see Figure 5B) quite sparse and direction-oriented (anisotropic) in certain regions. The different positioning of Image 18 in the embeddings can reflect these characteristics.

4.5 Sinkhorn distance between maps of spatial features

Here, we compute the Sinkhorn distance between every pair of point pattern using the map of the spatial features constructed by kernel-smoothing. When we consider spatial point patterns directly to compute the Sinkhorn distance between nerve cross-sections (in Section 4.4), the mass (corresponding to the spatial intensity or any other spatial feature attached as marks) to be transported is concentrated at the exact location of the points. As we apply kernel-smoothing to the point pattern, the concentrated mass at any point diffuses into its neighborhood. This phenomenon can help capture the essence of locality in the kernel-smoothed maps while computing Sinkhorn distances. In addition, kernel-smoothing can reduce the influence of the differing number of points in the point patterns on the Sinkhorn distance, by constructing maps of the same dimensions. Also, transportation-based metrics are well-suited for quantifying differences between bitmap images in which pixel values can be interpreted as transportable mass without strict geometric constraints (Rubner et al., 2000; Haker et al., 2004; Chefd’Hotel and Bousquet, 2007; Grauman and Darrell, 2004; Wang et al., 2011; wang_linear_2013).

The kernel-smoothed intensity and marks of a point pattern can be represented as bitmaps, where the pixel values represent kernel-smoothed intensity or other derived quantities from the marks, such as the local inhomogeneous and anisotropic KK- and LL-functions. The kernel-smoothed spatial features of Images 3 (vagus) and 29 (pelvic) listed in Table 1 are shown in Figure 6. The bitmaps for the local inhomogeneous LL-function, shown in Figure 6(B, F), have higher values of the spatial feature compared to their anisotropic counterparts shown in Figure 6(C, D, G, H) and slight shifts in values at certain locations are observed between the bitmaps of the horizontal and vertical sectors. Quantifying similarities between the kernel-smoothed bitmaps can be performed just like quantifying similarities between the spatial features of the original point patterns, using Sinkhorn distance.

Refer to caption
Figure 6: Visualizing the kernel-smoothed spatial features of Image 3 (vagus) and Image 29 (pelvic) listed in Table 1. (A, E) Spatial intensity. (B, F) Local inhomogeneous LL-function. (C, G) Local inhomogeneous LL-function with the horizontal sector. (D, H) Local inhomogeneous LL-function with the vertical sector. The scale bars show the range of values for each spatial feature separately (column-wise). The kernel-smoothed bitmaps were downsampled for reasonable runtime and memory requirements.

Let I1I_{1} and I2I_{2} be the centered (0-padded as necessary) kernel-smoothed maps (same dimension) of the spatial intensity of the point patterns S1S_{1} and S2S_{2}, respectively. The pixel values in I1I_{1} and I2I_{2} are normalized to sum to one, and the value at each pixel is considered the amount of mass contained (rr) or required (cc) at that pixel. The location of the pixels is not known beforehand, so we construct a unique grid [0,1]2[0,1]^{2} over which the pixel locations of I1I_{1} and I2I_{2} are defined. The cost matrix MM is the Euclidean distance matrix computed from the [0,1]2[0,1]^{2} grid. The transportation plan PP and the Sinkhorn distance between I1I_{1} and I2I_{2} are computed in the previously described manner. The Sinkhorn distances between the maps representing the other three spatial features are also calculated in the same fashion. Constructing the Sinkhorn distance matrix and visualizing embeddings in the Sinkhorn space are also done in the same way as described in Section 4.4.

Refer to caption
Figure 7: (A-D) The embeddings of the kernel-smoothed spatial intensity and the local inhomogeneous and anisotropic LL-functions (no sector, horizontal sector, and vertical sector) of the spatial point patterns in the Sinkhorn space for entropic regularization parameter λ=0.01\lambda=0.01. The vagus and the pelvic samples are shown in cyan and orange (circles for female (F) and triangles for male (M)), respectively, and labeled with the Image ID listed in Table 1. (E-H) The segmented unmyelinated axons of Image 15 and 6 (vagus) and Image 19 and 26 (pelvic) listed in Table 1.

Figure 7A shows an embedding of the kernel-smoothed maps of the spatial intensity of the point patterns in the Sinkhorn space of λ\lambda=0.01. The vagus and the pelvic samples are shown in cyan and orange, respectively, and labeled with the Image ID listed in Table 1. The vagus samples 3, 7, 12, and 13 are embedded at a distance from the rest of the samples, and this trend was also observed in Figure 4B, when we experimented on point patterns directly. However, vagus sample 6 and 15, and pelvic samples 19 and 26 (see Figure 7(E-H)), that were positioned close to the rest of the samples in Figure 4B, are embedded far apart in the right-most region of the embedding in Figure 7A. Therefore, some behavior in the spatial intensity that were not noticed while dealing with point patterns, have surfaced when maps of the spatial features are used. The embeddings of kernel-smoothed local inhomogeneous and anisotropic LL-function are illustrated in Figure 7(B-D), portraying a similar trend overall, where the visually and spatially comparable vagus and pelvic samples are positioned in proximity, the rest are far apart, and the vagus samples are more spread out.

4.6 Insights regarding spatial architecture

Refer to caption
Figure 8: Boxplots displaying the ranges of Sinkhorn distance between the spatial intensity of the nerve cross-sections - Pelv: pelvic and Vag: vagus. (A) Analysis of the spatial point patterns directly. (B) Analysis of the kernel-smoothed maps of the spatial features. The points show the individual Sinkhorn distances, revealing the hidden distribution.
Refer to caption
Figure 9: Boxplots displaying the ranges of Sinkhorn distance between the spatial intensity of the sub-categories of the nerve cross-sections - Abd: abdominal vagus, Cerv: cervical vagus, and pelvic. (A, B) Analysis of the spatial point patterns directly. (C, D) Analysis of the kernel-smoothed maps of the spatial features. The points show the individual Sinkhorn distances, revealing the hidden distribution.

We compute the Sinkhorn distances between every pair of nerve cross-sections for the four spatial features using spatial point patterns directly (in Section 4.4) and kernel-smoothed bitmaps representation of the spatial features (in Section 4.5). The resulting Sinkhorn embeddings are shown in Figure 4, Figure 5 and Figure 7. The created Sinkhorn space allows us to observe the similarities (or dissimilarities) of spatial intensities and second-order spatial properties.

The secondary statistical analysis performed on the embedded patterns generated by kernel-smoothing to mitigate the effects of the unequal number of axons revealed that the difference in spatial architecture between the vagus and pelvic nerves is relatively small (Mahalanobis distance Δ=0.91\Delta=0.91). However, the sample size is insufficient to determine whether this observed difference reflects biological reality or was the result of random chance. With npelvic=11n_{\textrm{pelvic}}=11 and nvagus=18n_{\textrm{vagus}}=18, the achieved power (1β1-\beta) is only 0.60.6. To confirm the spatial architectural difference between vagus and pelvic nerve cross-sections, the required data set size should be at least n=26n=26 per class for 1β=0.81-\beta=0.8 and α=0.05\alpha=0.05 in 2-D embedding, according to the collected preliminary results. In other words, any future research on the potential architectural difference between peripheral nerves’ axonal organization (or modulation of such organization due to pathology or treatment) must use these preliminary effect sizes as a reasonable basis for necessary power analysis needed for experimental design.

On the other hand, there is a substantial difference between the nerve cross-sections of males and females (Δ=1.246\Delta=1.246, Hotelling T2 test p-value =0.013=0.013). However, this effect must be confirmed and replicated with an unconfounded sample set in which the correlation between sex and cross-section origin (pelvic vs. vagus) is absent. The result reported here is based on the assumption that there is indeed no statistically significant difference between pelvic and vagus.

Regarding intraclass variability, vagus samples exhibit a significantly greater diversity of spatial architecture than pelvic samples when the raw spatial patterns are directly compared (Figure 4B). However, this difference disappears when the kernel-smoothed spatial patterns are compared, indicating that it was driven mainly by the difference in the number of axons rather than the spatial architecture (Figure 7 and 8).

The vagus samples in our dataset are collected from the abdominal and cervical regions (see Table 1). Thus, looking into the degree of variability of the Sinkhorn distance within the sub-categories of the vagus samples and between the pelvic samples is helpful. Figure 9 illustrates the range of Sinkhorn distance between the spatial intensity of every pair of nerve cross-sections (for both types of analysis), categorized as the following:

  1. 1.

    within vagus samples

    1. (a)

      intra-class measurements (i) (abdominal vagus vs. abdominal vagus)

    2. (b)

      intra-class measurements (ii) (cervical vagus vs. cervical vagus)

    3. (c)

      inter-class measurements (abdominal vagus vs. cervical vagus)

  2. 2.

    between pelvic and vagus samples

    1. (a)

      inter-class measurements (i) (pelvic vs. abdominal vagus)

    2. (b)

      inter-class measurements (iii) (pelvic vs. cervical vagus)

In Figure 9, we see the ranges of the Sinkhorn distances for the abovementioned sub-categories. The degree of variability is more prominent in the analysis of the raw spatial point patterns (Figure 9A and B) compared to the analysis of the kernel-smoothed bitmaps representing spatial features (Figure 9C and D). This observation applies not just to spatial intensity but also statistical second-order spatial statistics. Figure 9 shows that variability within the abdominal vagus samples is substantially lower than the spatial variability within the cervical vagus cross-sections (p <0.001<0.001). However, this notion has not been confirmed when looking at Figure 9C, which is based on pre-processing that eliminates the effect of axons’ number. As before, this is most likely due to the low statistical power of the available sample size. The number of abdominal (5555) and cervical (2121) pairwise measurements is too small to confidently demonstrate the observed standardized effect size of Δ=0.59\Delta=0.59. The required number of measurements for such effect size should be at least 4545 per class to achieve 1β=0.81-\beta=0.8 with α=0.05\alpha=0.05.

The much smaller standardized difference (Δ=0.3\Delta=0.3) between two sites of vagus nerves sampling and pelvic nerves shown in Figure 9D can be confidently demonstrated due to the considerably larger number of available data points (121121 pelvic vs. abd. vagus and 7777 pelvic vs. cervical vagus pairwise measurements). Therefore, we can state that the dissimilarity between pelvic and abdominal vagus spatial architectures is much smaller than the dissimilarity between pelvic and cervical vagus nerves (p =0.0352=0.0352). In other words, abdominal vagus samples resemble pelvic cross-sections to a higher degree than cervical vagus cross-sections.

5 Discussion

While many modern feature learning methods can directly classify biological images based on structural differences, the critical issue is frequently not the ability to recognize differences but rather the capability to quantify the specific architectural aspects of biological structures in order to relate them to a function or the presence of some pathology. Neuroanatomy is one of the disciplines in which black-box image classifiers are undesirable because the goal of the research is to tie the image attributes to genuine anatomical and physiological knowledge regarding cell and tissue organization rather than merely sorting the images into pre-conceived classes. The research presented here provides an additional block in our multi-step sample and data processing pipeline, which also includes previously described data acquisition and image segmentation modules (Havton et al., 2021; Plebani et al., 2022).

We pursued the representation of the segmented unmyelinated axons in the TEM images of the peripheral nerve cross-sections as spatial point patterns not only to gain a better understanding of their neuroanatomy, but also to express the observed differences in a quantitative manner, which would enable a variety of automated analysis tasks in the future, such as automated image queries, image database retrieval, and biological image comparisons. While visual inspection of segmented images and their associated point patterns might provide some basic intuition regarding the spatial intensity, it is impossible to rely on the investigator’s perceptual conceptions and judgments when examining more complex aspects such as local heterogeneous and anisotropic spatial features. Although global bulk measures of second-order spatial statistics, such as the KK- and LL-functions, help to represent and explore spatial interactions (randomness, inhibition, or clustering), they fail to capture local variations within biological structures. On the other hand, the local form of these spatial statistics functions generates yet another complex spatial pattern, leaving scientists with an equally tricky quantification problem. In this context, our analytical approach that captures differences between arrangements of any spatial distributions to form a visualizable embedding that enables straightforward comparison between complex structures provides a simple-to-use tool for neuroanatomists and computational neuroscientists.

There are two notable limitations associated with the demonstrated methods and their particular implementation. As previously indicated, the purported differences are relatively small, and even though they may be statistically significant, they could be biologically insubstantial. There is no reason to expect that the spatial arrangement would be drastically altered in samples that did not represent any recognized pathology. We realize that the value of the method would be illustrated in a more dramatic manner if the detected differences were related to a specific biological mechanistic model, particularly associated with a disease or an abnormality. On the other hand, it is essential to note that the ability to gather and evaluate a large comprehensive set of neuropathology data is contingent upon the availability of analytical tools. Therefore, the scarcity of labeled and segmented images is partially attributable to the absence of an analytic framework, casting doubt on the systematic benefit of acquiring comprehensive peripheral nerve data. We certainly hope that the conceptualization and presentation of our approach will encourage neuroanatomists to collect more data regarding peripheral nerves resulting in larger-scale quantitative anatomical studies.

Refer to caption
Figure 10: An illustration of spatial point patterns with different inhomogeneous spatial organizations. (A) Spatial inhibition. (B) Spatial randomness. (C) Spatial clustering. (D) An embedding of the spatial intensity of the point patterns shown in (A-C) in the Sinkhorn space. The inhibited, random, and clustered point patterns are shown in green, blue, and orange, respectively.

The second concern relates to the interpretability of the absolute position of patterns in the computed embeddings. Although Sinkhorn embedding produces 2-D maps of similarity, it may not be easy to interpret the resulting position of points in the Sinkhorn space. Fortunately, the proposed embedding can be coupled with data simulations, allowing for the production of any arrangement of biological properties within any shape of interest. Figure 10(A-C) depicts a toy example of 18 simulated spatial point patterns with spatial inhibition, randomness, and clustering, respectively. These point patterns are formed by inhomogeneous point processes, namely the hardcore process, the Poisson process, and the Matern cluster process (Baddeley et al., 2015). For the simulation of the toy example, we used a hardcore process with 400400 points per unit area and a hardcore distance of 0.040.04 (the points are not allowed to be within 0.040.04 unit of each other, ensuring inhibition). We used a Poisson process with inhomogeneous intensity function ρ(x,y)\rho(x,y), shown in Equation 15, and a Matern cluster process with inhomogeneous intensity function ρ(x,y)\rho(x,y) for the cluster centers, shown in Equation 16, cluster radius 0.100.10 and 2525 points per cluster.

ρ(x,y)=100×exp(5x)\rho(x,y)=100\times\exp(-5x) (15)
ρ(x,y)=10×exp(2|x|1)\rho(x,y)=10\times\exp(2\lvert x\rvert-1) (16)

While the spatial structure of the point patterns from the nerve cross-sections is complex, consisting of inhomogeneous, anisotropic, and numerous spatial interactions, the simulated realizations are formed from a single point process and are relatively simple to explain. The embedding of the spatial intensity of the simulated point patterns in the Sinkhorn space is depicted in Figure 10D, where a clear distinction can be seen between samples with different spatial organizations. Similar simulations can be used for any type of spatial point pattern, providing a readily explainable, semi-mechanistic rationale for the emergence of the patterns and an interpretable representation of their properties and reasons for separation.

Although we focused here on unmyelinated axons, the computational pipeline is applicable to multi-type point patterns and spatial research outside of neuroscience. This work demonstrates that the spatial architecture of unmyelinated axons in peripheral nerve cross-sections is neither uniform nor random but forms complex and rich arrangements. In order to simulate such a complicated spatial form, hybrid point processes are required. In the future, we plan to focus on spatial modeling and further classification of peripheral nerve cross-sections. The similarity (or dissimilarity) measure we established in this study will be a foundation for these modeling tasks.

6 Conclusions

In this report, we examine one of the key research problems in neuroanatomy, the fundamental description, measurement, and quantification of the spatial arrangement of axons in peripheral nerves such as the vagus and pelvic nerves. This topic is significant not only from the basic neuroanatomical standpoint, but also due to the growing importance of peripheral nerve electrostimulation approaches, which rely on a precise understanding of the peripheral nerve architecture during the modeling and development phases (Eiber et al., 2021). We believe that quantitative analysis, comparisons, and visualization of spatial arrangement can provide valuable insight to neuroanatomists, computational neuroscientists, and engineers working in the field of electrostimulation. We also believe that the presented method can be easily adapted to other biological fields, including spatial proteomics and genomics (Ji et al., 2020; Hickey et al., 2022).

Conflict of Interest Statement

The authors declare no competing interests.

Author Contributions

BR conceived and planned the spatial analysis study; AP contributed to the mathematical models; EP and MD preprocessed the microscopy data and designed the segmentation pipeline; TP and JRK collected and processed the biological samples. TP provided neuroscience expertise and envisioned the quantitative peripheral nerve research; LAH and NB collected and annotated the microscopy images; DJ curated the data and performed image preprocessing and mosaicing; ASS and BR executed the study and co-wrote the manuscript with input from all the researchers.

Funding

This work was supported by the National Institutes of Health, Office of the Director, Stimulating Peripheral Activity to Relieve Conditions (SPARC) Program under Award Number OT2OD023847 (TP, BR, DJ, MMD, EP, ASS), OT2OD023872 (JRK), and OT2OD026585 (LH, NB); and by the U.S. Department of Energy’s Advanced Scientific Computing Research program through grant DE-SC-0022260 (AP, ASS). The content of this work is solely the responsibility of the authors and does not necessarily represent the official views of the National Institutes of Health or the Department of Energy.

Data Availability Statement

Microscopy data associated with this study, were collected as part of the Stimulating Peripheral Activity to Relieve Conditions (SPARC) program and are available through the SPARC Portal (RRID: SCR_017041) under a CC-BY 4.0 license.

References

  • Ahuja et al. (1993) Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. (1993). Network Flows - Theory, Algorithms and Applications. (Prentice Hall)
  • Asala and Bower (1986) Asala, S. A. and Bower, A. J. (1986). An electron microscope study of vagus nerve composition in the ferret. Anatomy and Embryology 175, 247–253. 10.1007/BF00389602
  • Avis (1980) Avis, D. (1980). On the extreme rays of the metric cone. Canadian Journal of Mathematics 32, 126–144. 10.4153/CJM-1980-010-0
  • Baddeley et al. (2015) Baddeley, A., Rubak, E., and Turner, R. (2015). Spatial Point Patterns: Methodology and Applications with R. (London: Chapman and Hall/CRC)
  • Baddeley et al. (2000) Baddeley, A. J., Møller, J., and Waagepetersen, R. (2000). Non- and semi-parametric estimation of interaction in inhomogeneous point patterns. Statistica Neerlandica 54, 329–350. https://doi.org/10.1111/1467-9574.00144
  • Basu et al. (2014) Basu, S., Kolouri, S., and Rohde, G. K. (2014). Detecting and visualizing cell phenotype differences from microscopy images using transport-based morphometry. Proceedings of the National Academy of Sciences 111, 3448–3453. 10.1073/pnas.1319779111
  • Besag (1977) Besag, J. (1977). Comment on “Modelling Spatial Patterns” by B.D. Ripley. Journal of the Royal Statistical Society. Series B (Methodological) 39, 193–195
  • Bjaalie et al. (1991) Bjaalie, J. G., Diggle, P. J., Nikundiwe, A., Karagulle, T., and Brodal, P. (1991). Spatial segregation between populations of ponto-cerebellar neurons: Statistical analysis of multivariate spatial interactions. The Anatomical Record 231, 510–523. 10.1002/ar.1092310413
  • Bonaz et al. (2017a) Bonaz, B., Sinniger, V., and Pellissier, S. (2017a). The vagus nerve in the neuro-immune axis: Implications in the pathology of the gastrointestinal tract. Frontiers in Immunology 8
  • Bonaz et al. (2017b) Bonaz, B., Sinniger, V., and Pellissier, S. (2017b). Vagus nerve stimulation: a new promising therapeutic tool in inflammatory bowel disease. Journal of Internal Medicine 282, 46–63
  • Breit et al. (2018) Breit, S., Kupferberg, A., Rogler, G., and Hasler, G. (2018). Vagus nerve as modulator of the brain–gut axis in psychiatric and inflammatory disorders. Frontiers in Psychiatry 9, 44
  • Brickell et al. (2008) Brickell, J., Dhillon, I. S., Sra, S., and Tropp, J. A. (2008). The metric nearness problem. SIAM Journal on Matrix Analysis and Applications 30, 375–396. 10.1137/060653391
  • Chefd’Hotel and Bousquet (2007) Chefd’Hotel, C. and Bousquet, G. (2007). Intensity-based image registration using earth mover’s distance. In Medical Imaging 2007: Image Processing (SPIE), vol. 6512, 801–808
  • Cuturi (2013) Cuturi, M. (2013). Sinkhorn distances: Lightspeed computation of optimal transport. In Advances in Neural Information Processing Systems, eds. C. Burges, L. Bottou, M. Welling, Z. Ghahramani, and K. Weinberger (Curran Associates, Inc.), vol. 26
  • Câmara and Griessenauer (2015) Câmara, R. and Griessenauer, C. J. (2015). Chapter 27 - Anatomy of the Vagus Nerve. In Nerves and Nerve Injuries, eds. R. S. Tubbs, E. Rizk, M. M. Shoja, M. Loukas, N. Barbaro, and R. J. Spinner (San Diego: Academic Press). 385–397. 10.1016/B978-0-12-410390-0.00028-7
  • Diggle et al. (1991) Diggle, P. J., Lange, N., and Benes, F. M. (1991). Analysis of variance for replicated spatial point patterns in clinical neuroanatomy. Journal of the American Statistical Association 86, 618–625. 10.2307/2290390
  • Dixon (2014) Dixon, P. M. (2014). Ripley’s K Function. In Wiley StatsRef: Statistics Reference Online (American Cancer Society). 10.1002/9781118445112.stat07751
  • Eiber et al. (2021) Eiber, C. D., Payne, S. C., Biscola, N. P., Havton, L. A., Keast, J. R., Osborne, P. B., et al. (2021). Computational modelling of nerve stimulation and recording with peripheral visceral neural interfaces. Journal of Neural Engineering 18, 066020. 10.1088/1741-2552/ac36e2
  • Grauman and Darrell (2004) Grauman, K. and Darrell, T. (2004). Fast contour matching using approximate earth mover’s distance. In Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. vol. 1, 1–8. 10.1109/CVPR.2004.1315035
  • Haker et al. (2004) Haker, S., Zhu, L., Tannenbaum, A., and Angenent, S. (2004). Optimal mass transport for registration and warping. International Journal of Computer Vision 60, 225–240. 10.1023/B:VISI.0000036836.66311.97
  • Havton et al. (2022) [Dataset] Havton, L. A., Biscola, N. P., Plebani, E., Rajwa, B., Shemonti, A. S., Jaffey, D., et al. (2022). High-throughput segmentation of rat unmyelinated axons by deep learning. 10.26275/K0MX-JCTH
  • Havton et al. (2021) Havton, L. A., Biscola, N. P., Stern, E., Mihaylov, P. V., Kubal, C. A., Wo, J. M., et al. (2021). Human organ donor-derived vagus nerve biopsies allow for well-preserved ultrastructure and high-resolution mapping of myelinated and unmyelinated fibers. Scientific Reports 11, 23831. 10.1038/s41598-021-03248-1
  • Hickey et al. (2022) Hickey, J. W., Neumann, E. K., Radtke, A. J., Camarillo, J. M., Beuschel, R. T., Albanese, A., et al. (2022). Spatial mapping of protein composition and tissue organization: A primer for multiplexed antibody-based imaging. Nature Methods 19, 284–295. 10.1038/s41592-021-01316-y
  • Hoffman and Schnitzlein (1961) Hoffman, H. H. and Schnitzlein, H. N. (1961). The numbers of nerve fibers in the vagus nerve of man. The Anatomical Record 139, 429–435. 10.1002/ar.1091390312. _eprint: https://onlinelibrary.wiley.com/doi/pdf/10.1002/ar.1091390312
  • Horn et al. (2019) Horn, C. C., Ardell, J. L., and Fisher, L. E. (2019). Electroceutical targeting of the autonomic nervous system. Physiology 34, 150–162. 10.1152/physiol.00030.2018
  • Howland (2014) Howland, R. H. (2014). Vagus Nerve Stimulation. Current Behavioral Neuroscience Reports 1, 64–73. 10.1007/s40473-014-0010-5
  • Jafari-Mamaghani et al. (2010) Jafari-Mamaghani, M., Andersson, M., and Krieger, P. (2010). Spatial point pattern analysis of neurons using Ripley’s K-function in 3D. Frontiers in Neuroinformatics 4. 10.3389/fninf.2010.00009
  • Ji et al. (2020) Ji, A. L., Rubin, A. J., Thrane, K., Jiang, S., Reynolds, D. L., Meyers, R. M., et al. (2020). Multimodal analysis of composition and spatial architecture in human squamous cell carcinoma. Cell 182, 497–514.e22. 10.1016/j.cell.2020.05.039
  • Klatt (2018) Klatt, M. (2018). Barycenter: Regularized Wasserstein Distances and Barycenters. R package version 1.3.1
  • Knight (2008) Knight, P. A. (2008). The Sinkhorn–Knopp algorithm: Convergence and applications. SIAM Journal on Matrix Analysis and Applications 30, 261–275. 10.1137/060659624
  • Krous et al. (1985) Krous, H. F., Jordan, J., Wen, J., and Farber, J. P. (1985). Developmental morphometry of the vagus nerve in the opossum. Developmental Brain Research 20, 155–159. 10.1016/0165-3806(85)90100-2
  • Møller and Waagepetersen (2003) Møller, J. and Waagepetersen, R. P. (2003). Statistical Inference and Simulation for Spatial Point Processes. (Boca Raton, Florida: CRC Press)
  • Nadaraya (1964) Nadaraya, E. A. (1964). On estimating regression. Theory of Probability & Its Applications 9, 141–142. 10.1137/1109020
  • Nadaraya (1989) Nadaraya, E. A. (1989). Nonparametric Estimation of Probability Densities and Regression Curves. (Dordrecht: Springer Netherlands). 10.1007/978-94-009-2583-0
  • Ohser and Stoyan (1981) Ohser, J. and Stoyan, D. (1981). On the second-order and orientation analysis of planar stationary point processes. Biometrical Journal 23, 523–533. 10.1002/bimj.4710230602
  • Orlin (1993) Orlin, J. B. (1993). A faster strongly polynomial minimum cost flow algorithm. Operations Research 41, 338–350. 10.1287/opre.41.2.338
  • Pele and Werman (2009) Pele, O. and Werman, M. (2009). Fast and robust earth mover’s distances. In 2009 IEEE 12th International Conference on Computer Vision. 460–467. 10.1109/ICCV.2009.5459199. ISSN: 2380-7504
  • Pelot et al. (2020) Pelot, N. A., Goldhagen, G. B., Cariello, J. E., Musselman, E. D., Clissold, K. A., Ezzell, J. A., et al. (2020). Quantified morphology of the cervical and subdiaphragmatic vagus nerves of human, pig, and rat. Frontiers in Neuroscience 14
  • Pereyra et al. (1992) Pereyra, P. M., Zhang, W., Schmidt, M., and Becker, L. E. (1992). Development of myelinated and unmyelinated fibers of human vagus nerve during the first year of life. Journal of the Neurological Sciences 110, 107–113. 10.1016/0022-510X(92)90016-E
  • Peyré and Cuturi (2019) Peyré, G. and Cuturi, M. (2019). Computational optimal transport: With applications to data science. Foundations and Trends in Machine Learning 11, 355–607. 10.1561/2200000073
  • Plebani et al. (2022) Plebani, E., Biscola, N. P., Havton, L. A., Rajwa, B., Shemonti, A. S., Jaffey, D., et al. (2022). High-throughput segmentation of unmyelinated axons by deep learning. Scientific Reports 12, 1198. 10.1038/s41598-022-04854-3
  • Prechtl and Powley (1990) Prechtl, J. C. and Powley, T. L. (1990). The fiber composition of the abdominal vagus of the rat. Anatomy and Embryology 181, 101–115. 10.1007/BF00198950
  • Prodanov et al. (2007) Prodanov, D., Nagelkerke, N., and Marani, E. (2007). Spatial clustering analysis in neuroanatomy: Applications of different approaches to motor nerve fiber distribution. Journal of Neuroscience Methods 160, 93–108. 10.1016/j.jneumeth.2006.08.017
  • Ripley (1976) Ripley, B. D. (1976). The second-order analysis of stationary point processes. Journal of Applied Probability 13, 255–266. 10.2307/3212829
  • Ripley (1977) Ripley, B. D. (1977). Modelling spatial patterns. Journal of the Royal Statistical Society. Series B (Methodological) 39, 172–212
  • Ronneberger et al. (2015) Ronneberger, O., Fischer, P., and Brox, T. (2015). U-Net: Convolutional Networks for Biomedical Image Segmentation. In Medical Image Computing and Computer-Assisted Intervention – MICCAI 2015, eds. N. Navab, J. Hornegger, W. M. Wells, and A. F. Frangi (Cham: Springer International Publishing), Lecture Notes in Computer Science, 234–241. 10.1007/978-3-319-24574-4_28
  • Rubner et al. (2000) Rubner, Y., Tomasi, C., and Guibas, L. J. (2000). The earth mover’s distance as a metric for image retrieval. International Journal of Computer Vision 40, 99–121. 10.1023/A:1026543900054
  • Safi et al. (2016) Safi, S., Ellrich, J., and Neuhuber, W. (2016). Myelinated Axons in the Auricular Branch of the Human Vagus Nerve. The Anatomical Record 299, 1184–1191. 10.1002/ar.23391. _eprint: https://onlinelibrary.wiley.com/doi/pdf/10.1002/ar.23391
  • Schindelin et al. (2012) Schindelin, J., Arganda-Carreras, I., Frise, E., Kaynig, V., Longair, M., Pietzsch, T., et al. (2012). Fiji: an open-source platform for biological-image analysis. Nature Methods 9, 676–682. 10.1038/nmeth.2019
  • Settell et al. (2021) Settell, M. L., Skubal, A. C., Chen, R. C. H., Kasole, M., Knudsen, B. E., Nicolai, E. N., et al. (2021). In vivo visualization of pig vagus nerve “vagotopy” using ultrasound. Frontiers in Neuroscience 15. 10.3389/fnins.2021.676680
  • Sinkhorn and Knopp (1967) Sinkhorn, R. and Knopp, P. (1967). Concerning nonnegative matrices and doubly stochastic matrices. Pacific Journal of Mathematics 21, 343–348
  • Soltanpour and Santer (1996) Soltanpour, N. and Santer, R. M. (1996). Preservation of the cervical vagus nerve in aged rats: morphometric and enzyme histochemical evidence. Journal of the Autonomic Nervous System 60, 93–101. 10.1016/0165-1838(96)00038-0
  • Stoyan (2006) Stoyan, D. (2006). Fundamentals of Point Process Statistics. In Case Studies in Spatial Point Process Modeling, eds. A. Baddeley, P. Gregori, J. Mateu, R. Stoica, and D. Stoyan (New York, NY: Springer New York). 3–22. 10.1007/0-387-31144-0_1
  • Stoyan et al. (2013) Stoyan, D., Kendall, W. S., Chiu, S. N., and Mecke, J. (2013). Stochastic Geometry and Its Applications (John Wiley & Sons)
  • Thompson et al. (2019) Thompson, N., Mastitskaya, S., and Holder, D. (2019). Avoiding off-target effects in electrical stimulation of the cervical vagus nerve: Neuroanatomical tracing techniques to study fascicular anatomy of the vagus nerve. Journal of Neuroscience Methods 325, 108325. 10.1016/j.jneumeth.2019.108325
  • Thompson et al. (2022) Thompson, N., Ravagli, E., Mastitskaya, S., Iacoviello, F., Stathopoulou, T.-R., Perkins, J., et al. (2022). Organotopic organization of the cervical vagus nerve. Tech. rep., bioRxiv. 10.1101/2022.02.24.481810. Section: New Results Type: article
  • Villani (2009) Villani, C. (2009). The Wasserstein distances. In Optimal Transport: Old and New, ed. C. Villani (Berlin, Heidelberg: Springer). 93–111. 10.1007/978-3-540-71050-9_6
  • Waller et al. (2011) Waller, L. A., Särkkä, A., Olsbo, V., Myllymäki, M., Panoutsopoulou, I. G., Kennedy, W. R., et al. (2011). Second-order spatial analysis of epidermal nerve fibers. Statistics in Medicine 30, 2827–2841. 10.1002/sim.4315
  • Walter and Tsiberidou (2019) Walter, U. and Tsiberidou, P. (2019). Differential age-, gender-, and side-dependency of vagus, spinal accessory, and phrenic nerve calibers detected with precise ultrasonography measures. Muscle & Nerve 59, 486–491. 10.1002/mus.26412
  • Wang et al. (2011) Wang, W., Ozolek, J. A., Slepčev, D., Lee, A. B., Chen, C., and Rohde, G. K. (2011). An optimal transportation approach for nuclear structure-based pathology. IEEE Transactions on Medical Imaging 30, 621–631. 10.1109/TMI.2010.2089693
  • Wang et al. (2013) Wang, W., Slepčev, D., Basu, S., Ozolek, J. A., and Rohde, G. K. (2013). A linear optimal transportation framework for quantifying and visualizing variations in sets of images. International Journal of Computer Vision 101, 254–269. 10.1007/s11263-012-0566-z
  • Watson (1964) Watson, G. S. (1964). Smooth regression analysis. Sankhyā: The Indian Journal of Statistics, Series A (1961-2002) 26, 359–372
  • You (2020) You, K. (2020). T4transport: Tools for Computational Optimal Transport. R package version 0.1.0