Lipeng Ning

Distances and Riemannian Metrics for Multivariate Spectral Densities

The paper is concerned with the practical problem of how to compare power spectral densities of multivariable time-series. For scalar time-series several notions of distance (divergences) have been proposed and studied starting from the early 1970s while multivariable ones have only recently began to receive any attention. In the paper, two classes of divergence measures inspired by classical prediction theory are introduced. These divergences naturally induce Riemannian metrics on the cone of multivariable densities. The metrics amount to the quadratic term in the divergence between “infinitesimally close to each other” power spectra. For one of the two we provide explicit formulae for the corresponding geodesics and geodesic distance. A close connection between the geometry of power spectra and the geometry of the Fisher-Rao metric is noted.

A joint compressed-sensing and super-resolution approach for very high-resolution diffusion imaging.

Diffusion MRI (dMRI) can provide invaluable information about the structure of different tissue types in the brain. Standard dMRI acquisitions facilitate a proper analysis (e.g. tracing) of medium-to-large white matter bundles. However, smaller fiber bundles connecting very small cortical or sub-cortical regions cannot be traced accurately in images with large voxel sizes. Yet, the ability to trace such fiber bundles is critical for several applications such as deep brain stimulation and neurosurgery. In this work, we propose a novel acquisition and reconstruction scheme for obtaining high spatial resolution dMRI images using multiple low resolution (LR) images, which is effective in reducing acquisition time while improving the signal-to-noise ratio (SNR). The proposed method called compressed-sensing super resolution reconstruction (CS-SRR), uses multiple overlapping thick-slice dMRI volumes that are under-sampled in q-space to reconstruct diffusion signal with complex orientations. The proposed method combines the twin concepts of compressed sensing and super-resolution to model the diffusion signal (at a given b-value) in a basis of spherical ridgelets with total-variation (TV) regularization to account for signal correlation in neighboring voxels. A computationally efficient algorithm based on the alternating direction method of multipliers (ADMM) is introduced for solving the CS-SRR problem. The performance of the proposed method is quantitatively evaluated on several in-vivo human data sets including a true SRR scenario. Our experimental results demonstrate that the proposed method can be used for reconstructing sub-millimeter super resolution dMRI data with very good data fidelity in clinically feasible acquisition time.

Inter-site and inter-scanner diffusion MRI data harmonization

We propose a novel method to harmonize diffusion MRI data acquired from multiple sites and scanners, which is imperative for joint analysis of the data to significantly increase sample size and statistical power of neuroimaging studies. Our method incorporates the following main novelties: i) we take into account the scanner-dependent spatial variability of the diffusion signal in different parts of the brain; ii) our method is independent of compartmental modeling of diffusion (e.g., tensor, and intra/extra cellular compartments) and the acquired signal itself is corrected for scanner related differences; and iii) inter-subject variability as measured by the coefficient of variation is maintained at each site. We represent the signal in a basis of spherical harmonics and compute several rotation invariant spherical harmonic features to estimate a region and tissue specific linear mapping between the signal from different sites (and scanners). We validate our method on diffusion data acquired from seven different sites (including two GE, three Philips, and two Siemens scanners) on a group of age-matched healthy subjects. Since the extracted rotation invariant spherical harmonic features depend on the accuracy of the brain parcellation provided by Freesurfer, we propose a feature based refinement of the original parcellation such that it better characterizes the anatomy and provides robust linear mappings to harmonize the dMRI data. We demonstrate the efficacy of our method by statistically comparing diffusion measures such as fractional anisotropy, mean diffusivity and generalized fractional anisotropy across multiple sites before and after data harmonization. We also show results using tract-based spatial statistics before and after harmonization for independent validation of the proposed methodology. Our experimental results demonstrate that, for nearly identical acquisition protocol across sites, scanner-specific differences can be accurately removed using the proposed method.

On Matrix-Valued Monge–Kantorovich Optimal Mass Transport

We present a particular formulation of optimal transport for matrix-valued density functions. Our aim is to devise a geometry which is suitable for comparing power spectral densities of multivariable time series. More specifically, the value of a power spectral density at a given frequency, which in the matricial case encodes power as well as directionality, is thought of as a proxy for a “matrix-valued mass density.” Optimal transport aims at establishing a natural metric in the space of such matrix-valued densities which takes into account differences between power across frequencies as well as misalignment of the corresponding principle axes. Thus, our transportation cost includes a cost of transference of power between frequencies together with a cost of rotating the principle directions of matrix densities. The two end-point matrix-valued densities can be thought of as marginals of a joint matrix-valued density on a tensor product space. This joint density, very much as in the classical Monge-Kantorovich setting, can be thought to specify the transportation plan. Contrary to the classical setting, the optimal transport plan for matrices is no longer supported on a thin zero-measure set.

Sparse Reconstruction Challenge for diffusion MRI: Validation on a physical phantom to determine which acquisition scheme and analysis method to use?

Diffusion magnetic resonance imaging (dMRI) is the modality of choice for investigating in-vivo white matter connectivity and neural tissue architecture of the brain. The diffusion-weighted signal in dMRI reflects the diffusivity of water molecules in brain tissue and can be utilized to produce image-based biomarkers for clinical research. Due to the constraints on scanning time, a limited number of measurements can be acquired within a clinically feasible scan time. In order to reconstruct the dMRI signal from a discrete set of measurements, a large number of algorithms have been proposed in recent years in conjunction with varying sampling schemes, i.e., with varying b-values and gradient directions. Thus, it is imperative to compare the performance of these reconstruction methods on a single data set to provide appropriate guidelines to neuroscientists on making an informed decision while designing their acquisition protocols. For this purpose, the SPArse Reconstruction Challenge (SPARC) was held along with the workshop on Computational Diffusion MRI (at MICCAI 2014) to validate the performance of multiple reconstruction methods using data acquired from a physical phantom. A total of 16 reconstruction algorithms (9 teams) participated in this community challenge. The goal was to reconstruct single b-value and/or multiple b-value data from a sparse set of measurements. In particular, the aim was to determine an appropriate acquisition protocol (in terms of the number of measurements, b-values) and the analysis method to use for a neuroimaging study. The challenge did not delve on the accuracy of these methods in estimating model specific measures such as fractional anisotropy (FA) or mean diffusivity, but on the accuracy of these methods to fit the data. This paper presents several quantitative results pertaining to each reconstruction algorithm. The conclusions in this paper provide a valuable guideline for choosing a suitable algorithm and the corresponding data-sampling scheme for clinical neuroscience applications.

Estimating Diffusion Propagator and Its Moments Using Directional Radial Basis Functions

The ensemble average diffusion propagator (EAP) obtained from diffusion MRI (dMRI) data captures important structural properties of the underlying tissue. As such, it is imperative to derive an accurate estimate of the EAP from the acquired diffusion data. In this work, we propose a novel method for estimating the EAP by representing the diffusion signal as a linear combination of directional radial basis functions scattered in q-space. In particular, we focus on a special case of anisotropic Gaussian basis functions and derive analytical expressions for the diffusion orientation distribution function (ODF), the return-to-origin probability (RTOP), and mean-squared-displacement (MSD). A significant advantage of the proposed method is that the second and the fourth order moment tensors of the EAP can be computed explicitly. This allows for computing several novel scalar indices (from the moment tensors) such as mean-fourth-order-displacement (MFD) and generalized kurtosis (GK)-which is a generalization of the mean kurtosis measure used in diffusion kurtosis imaging. Additionally, we also propose novel scalar indices computed from the signal in q-space, called the q-space mean-squared-displacement (QMSD) and the q-space mean-fourth-order-displacement (QMFD), which are sensitive to short diffusion time scales. We validate our method extensively on data obtained from a physical phantom with known crossing angle as well as on in-vivo human brain data. Our experiments demonstrate the robustness of our method for different combinations of b-values and number of gradient directions.

Linear Models Based on Noisy Data and the Frisch Scheme

We address the problem of identifying linear relations among variables based on noisy measurements. This is a central question in the search for structure in large data sets. Often a key assumption is that measurement errors in each variable are independent. This basic formulation has its roots in the work of Charles Spearman in 1904 and of Ragnar Frisch in the 1930s. Various topics such as errors-in-variables, factor analysis, and instrumental variables all refer to alternative viewpoints on this problem and on ways to account for the anticipated way that noise enters the data. In the present paper we begin by describing certain fundamental contributions by the founders of the field and provide alternative modern proofs to certain key results. We then go on to consider a modern viewpoint and novel numerical techniques to the problem. The central theme is expressed by the Frisch-Kalman dictum, which calls for identifying a noise contribution that allows a maximal number of simultaneous linear relations among the noise-free variables-a rank minimization problem. In the years since Frischs original formulation, there have been several insights, including trace minimization as a convenient heuristic to replace rank minimization. We discuss convex relaxations and theoretical bounds on the rank that, when met, provide guarantees for global optimality. A complementary point of view to this minimum-rank dictum is presented in which models are sought leading to a uniformly optimal quadratic estimation error for the error-free variables. Points of contact between these formalisms are discussed, and alternative regularization schemes are presented.

Sparse factor analysis via likelihood and ℓ 1 -regularization

In this note we consider the basic problem to identify linear relations in noise. We follow the viewpoint of factor analysis (FA) where the data is to be explained by a small number of independent factors and independent noise. Thereby an approximation of the sample covariance is sought which can be factored accordingly. An algorithm is proposed which weighs in an ℓ1-regularization term that induces sparsity of the linear model (factor) against a likelihood term that quantifies distance of the model to the sample covariance. The algorithm compares favorably against standard techniques of factor analysis. Their performance is compared first by simulation, where ground truth is available, and then on stock-market data where the proposed algorithm gives reasonable and sparser models.

On the Geometry of Covariance Matrices

We introduce and compare certain distance measures between covariance matrices. These originate in information theory, quantum mechanics and optimal transport. More specifically, we show that the Bures/Hellinger distance between covariance matrices coincides with the Wasserstein-2 distance between the corresponding Gaussian distributions. We also note that this Bures/Hellinger/Wasserstein distance can be expressed as the solution to a linear matrix inequality (LMI). A consequence of this fact is that the computational cost in covariance approximation problems scales nicely with the size of the matrices involved. We discuss the relevance of this metric in spectral-line detection and spectral morphing.

On robustness of ℓ 1 -regularization methods for spectral estimation

The use of ℓ1-regularization in sparse estimation methods has received huge attention during the last decade, and applications in virtually all fields of applied mathematics have benefited greatly. This interest was sparked by the recovery results of Candès, Donoho, Tao, Tropp, et al. and has resulted in a framework for solving a set of combinatorial problems in polynomial time by using convex relaxation techniques. In this work we study the use of ℓ1-regularization methods for high-resolution spectral estimation. In this problem, the dictionary is typically coherent and existing theory for robust/exact recovery does not apply. In fact, the robustness cannot be guaranteed in the usual strong sense. Instead, we consider metrics inspired by the Monge-Kantorovich transportation problem and show that the magnitude can be robustly recovered if the original signal is sufficiently sparse and separated. We derive both worst case error bounds as well as error bounds based on assumptions on the noise distribution.