Search

Recent advances in deep learning have improved the segmentation accuracy of subcortical brain structures, which would be useful in neuroimaging studies of many neurological disorders. However, most of the previous deep learning work does not investigate the specific difficulties that exist in segmenting extremely small but important brain regions such as the amygdala and its subregions. To tackle this challenging task, a novel 3D Bayesian fully convolutional neural network was developed to apply a dilated dualpathway approach that retains fine details and utilizes both local and more global contextual information to automatically segment the amygdala and its subregions at high precision. The proposed method provides insights on network design and sampling strategy that target segmentations of small 3D structures. In particular, this study confirms that a large context, enabled by a large field of view, is beneficial for segmenting small objects; furthermore, precise contextual information enabled by dilated convolutions allows for better boundary localization, which is critical for examining the morphology of the structure. In addition, it is demonstrated that the uncertainty information estimated from our network may be leveraged to identify atypicality in data. Our method was compared with two state-of-the-art deep learning models and a traditional multi-atlas approach, and exhibited excellent performance as measured both by Dice overlap as well as average symmetric surface distance. To the best of our knowledge, this work is the first deep learning-based approach that targets the subregions of the amygdala.

We consider high-frequency sampled continuous-time autoregressive moving average (CARMA) models driven by finite-variance zero-mean L\'evy processes. An L^2-consistent estimator for the increments of the driving L\'evy process without order selection in advance is proposed if the CARMA model is invertible. In the second part we analyse the high-frequency behaviour of approximating Riemann sum processes, which represent a natural way to simulate continuous-time moving average processes on a discrete grid. We shall compare their autocovariance structure with the one of sampled CARMA processes, where the rule of integration plays a crucial role. Moreover, new insight into the kernel estimation procedure of Brockwell et al. (2012a) is given., Comment: 26 pages, 2 figures

A general model for stationary, time-wise turbulent velocity is presented and discussed. This approach, inspired by modeling ideas of Barndorff-Nielsen and Schimgel, is coherent with the K41 hypothesis of local isotropy, and it allows us to separate second-order statistics from higher order ones. The model can be motivated by Taylor's hypothesis and a relation between time and spatial spectra. Second order statistics are used to separate the deterministic kernel function and the weakly stationary driving noise. A non-parametric estimation method for the turbulence intermittency is suggested., Comment: 18 pages, 4 figures, submitted

Interest in continuous-time processes has increased rapidly in recent years, largely because of high-frequency data available in many applications. We develop a method for estimating the kernel function $g$ of a second-order stationary L\'evy-driven continuous-time moving average (CMA) process $Y$ based on observations of the discrete-time process $Y^\Delta$ obtained by sampling $Y$ at $\Delta, 2\Delta,...,n\Delta$ for small $\Delta$. We approximate $g$ by $g^\Delta$ based on the Wold representation and prove its pointwise convergence to $g$ as $\Delta\rightarrow 0$ for $\CARMA(p,q)$ processes. Two non-parametric estimators of $g^\Delta$, based on the innovations algorithm and the Durbin-Levinson algorithm, are proposed to estimate $g$. For a Gaussian CARMA process we give conditions on the sample size $n$ and the grid-spacing $\Delta(n)$ under which the innovations estimator is consistent and asymptotically normal as $n\rightarrow\infty$. The estimators can be calculated from sampled observations of {\it any} CMA process and simulations suggest that they perform well even outside the class of CARMA processes. We illustrate their performance for simulated data and apply them to the Brookhaven turbulent wind speed data. Finally we extend results of \citet{bfk:2011:1} for sampled CARMA processes to a much wider class of CMA processes., Comment: 26 pages, 6 figures, submitted

Continuous-time autoregressive moving average (CARMA) processes have recently been used widely in the modeling of non-uniformly spaced data and as a tool for dealing with high-frequency data of the form $Y_{n\Delta}, n=0,1,2,...$, where $\Delta$ is small and positive. Such data occur in many fields of application, particularly in finance and the study of turbulence. This paper is concerned with the characteristics of the process $(Y_{n\Delta})_{n\in\bbz}$, when $\Delta$ is small and the underlying continuous-time process $(Y_t)_{t\in\bbr}$ is a specified CARMA process., Comment: 13 pages, submitted