Adaptive smoothing based on Gaussian processes regression increases the sensitivity and specificity of fMRI data.

Temporal and spatial filtering of fMRI data is often used to improve statistical power. However, conventional methods, such as smoothing with fixed-width Gaussian filters, remove fine-scale structure in the data, necessitating a tradeoff between sensitivity and specificity. Specifically, smoothing may increase sensitivity (reduce noise and increase statistical power) but at the cost loss of specificity in that fine-scale structure in neural activity patterns is lost. Here, we propose an alternative smoothing method based on Gaussian processes (GP) regression for single subjects fMRI experiments. This method adapts the level of smoothing on a voxel by voxel basis according to the characteristics of the local neural activity patterns. GP-based fMRI analysis has been heretofore impractical owing to computational demands. Here, we demonstrate a new implementation of GP that makes it possible to handle the massive data dimensionality of the typical fMRI experiment. We demonstrate how GP can be used as a drop-in replacement to conventional preprocessing steps for temporal and spatial smoothing in a standard fMRI pipeline. We present simulated and experimental results that show the increased sensitivity and specificity compared to conventional smoothing strategies. Hum Brain Mapp 38:1438-1459, 2017. © 2016 Wiley Periodicals, Inc.

Image interpolation and denoising for division of focal plane sensors using Gaussian processes.

Image interpolation and denoising are important techniques in image processing. These methods are inherent to digital image acquisition as most digital cameras are composed of a 2D grid of heterogeneous imaging sensors. Current polarization imaging employ four different pixelated polarization filters, commonly referred to as division of focal plane polarization sensors. The sensors capture only partial information of the true scene, leading to a loss of spatial resolution as well as inaccuracy of the captured polarization information. Interpolation is a standard technique to recover the missing information and increase the accuracy of the captured polarization information. Here we focus specifically on Gaussian process regression as a way to perform a statistical image interpolation, where estimates of sensor noise are used to improve the accuracy of the estimated pixel information. We further exploit the inherent grid structure of this data to create a fast exact algorithm that operates in ����(N(3/2)) (vs. the naive ���� (N³)), thus making the Gaussian process method computationally tractable for image data. This modeling advance and the enabling computational advance combine to produce significant improvements over previously published interpolation methods for polarimeters, which is most pronounced in cases of low signal-to-noise ratio (SNR). We provide the comprehensive mathematical model as well as experimental results of the GP interpolation performance for division of focal plane polarimeter.

Scaling Multidimensional Inference for Structured Gaussian Processes.

Exact Gaussian process (GP) regression has O(N(3)) runtime for data size N, making it intractable for large N . Many algorithms for improving GP scaling approximate the covariance with lower rank matrices. Other work has exploited structure inherent in particular covariance functions, including GPs with implied Markov structure, and inputs on a lattice (both enable O(N) or O(N log N) runtime). However, these GP advances have not been well extended to the multidimensional input setting, despite the preponderance of multidimensional applications. This paper introduces and tests three novel extensions of structured GPs to multidimensional inputs, for models with additive and multiplicative kernels. First we present a new method for inference in additive GPs, showing a novel connection between the classic backfitting method and the Bayesian framework. We extend this model using two advances: a variant of projection pursuit regression, and a Laplace approximation for non-Gaussian observations. Lastly, for multiplicative kernel structure, we present a novel method for GPs with inputs on a multidimensional grid. We illustrate the power of these three advances on several data sets, achieving performance equal to or very close to the naive GP at orders of magnitude less cost.

Estimating electrical conductivity tensors of biological tissues using microelectrode arrays.

Finding the electrical conductivity of tissue is important for understanding the tissue's structure and functioning. However, the inverse problem of inferring spatial conductivity from data is highly ill-posed and computationally intensive. In this paper, we propose a novel method to solve the inverse problem of inferring tissue conductivity from a set of transmembrane potential and stimuli measurements made by microelectrode arrays (MEA). We propose a parallel optimization algorithm based on a single-step approximation with a parallel alternating optimization routine. This algorithm simplifies the joint tensor field estimation problem into a set of computationally tractable subproblems, allowing the use of efficient standard optimization tools.

Estimating electrical conductivity tensors of biological tissues using microelectrode arrays.

Finding the electrical conductivity of tissue is highly important for understanding the tissue's structure and functioning. However, the inverse problem of inferring spatial conductivity from data is highly ill-posed and computationally intensive. In this paper, we propose a novel method to solve the inverse problem of inferring tissue conductivity from a set of transmembrane potential and stimuli measurements made by microelectrode arrays (MEA). We first formalize the discrete forward model of transmembrane potential propagation, based on a reaction-diffusion model with an anisotropic inhomogeneous electrical conductivity-tensor field. Then, we propose a novel parallel optimization algorithm for solving the complex inverse problem of estimating the electrical conductivity-tensor field. Specifically, we propose a single-step approximation with a parallel block-relaxation optimization routine that simplifies the joint tensor field estimation problem into a set of computationally tractable subproblems, allowing the use of efficient standard optimization tools. Finally, using numerical examples of several electrical conductivity field topologies and noise levels, we analyze the performance of our algorithm, and discuss its application to real measurements obtained from smooth-muscle cardiac tissue, using data collected with a high-resolution MEA system.