Tensor Analysis and Fusion of Multimodal Brain Images

Current high-throughput data acquisition technologies probe dynamical systems with different imaging modalities, generating massive data sets at different spatial and temporal resolutions posing challenging problems in multimodal data fusion. A case in point is the attempt to parse out the brain structures and networks that underpin human cognitive processes by analysis of different neuroimaging modalities (functional MRI, EEG, NIRS etc.). We emphasize that the multimodal, multi-scale nature of neuroimaging data is well reflected by a multi-way (tensor) structure where the underlying processes can be summarized by a relatively small number of components or "atoms". We introduce Markov-Penrose diagrams - an integration of Bayesian DAG and tensor network notation in order to analyze these models. These diagrams not only clarify matrix and tensor EEG and fMRI time/frequency analysis and inverse problems, but also help understand multimodal fusion via Multiway Partial Least Squares and Coupled Matrix-Tensor Factorization. We show here, for the first time, that Granger causal analysis of brain networks is a tensor regression problem, thus allowing the atomic decomposition of brain networks. Analysis of EEG and fMRI recordings shows the potential of the methods and suggests their use in other scientific domains.Comment: 23 pages, 15 figures, submitted to Proceedings of the IEE

HYDI-DSI revisited: Constrained non-parametric EAP imaging without q-space re-gridding

Producción CientíficaHybrid Diffusion Imaging (HYDI) was one of the first attempts to use multi-shell samplings of the q-space to infer diffusion properties beyond Diffusion Tensor Imaging (DTI) or High Angular Resolution Diffusion Imaging (HARDI). HYDI was intended as a flexible protocol embedding both DTI (for lower -values) and HARDI (for higher -values) processing, as well as Diffusion Spectrum Imaging (DSI) when the entire data set was exploited. In the latter case, the spherical sampling of the q-space is re-gridded by interpolation to a Cartesian lattice whose extent covers the range of acquired b-values, hence being acquisition-dependent. The Discrete Fourier Transform (DFT) is afterwards used to compute the corresponding Cartesian sampling of the Ensemble Average Propagator (EAP) in an entirely non-parametric way. From this lattice, diffusion markers such as the Return To Origin Probability (RTOP) or the Mean Squared Displacement (MSD) can be numerically estimated. We aim at re-formulating this scheme by means of a Fourier Transform encoding matrix that eliminates the need for q-space re-gridding at the same time it preserves the non-parametric nature of HYDI-DSI. The encoding matrix is adaptively designed at each voxel according to the underlying DTI approximation, so that an optimal sampling of the EAP can be pursued without being conditioned by the particular acquisition protocol. The estimation of the EAP is afterwards carried out as a regularized Quadratic Programming (QP) problem, which allows to impose positivity constraints that cannot be trivially embedded within the conventional HYDI-DSI. We demonstrate that the definition of the encoding matrix in the adaptive space allows to analytically (as opposed to numerically) compute several popular descriptors of diffusion with the unique source of error being the cropping of high frequency harmonics in the Fourier analysis of the attenuation signal. They include not only RTOP and MSD, but also Return to Axis/Plane Probabilities (RTAP/RTPP), which are defined in terms of specific spatial directions and are not available with the former HYDI-DSI. We report extensive experiments that suggest the benefits of our proposal in terms of accuracy, robustness and computational efficiency, especially when only standard, non-dedicated q-space samplings are available.Ministerio de Ciencia e Innovación (PID2021-124407NB-I00 and TED2021-130758B-I00)Ministry of Science and Higher Education (Poland) (PPN/BEK/ 2019/1/00421

Proceedings of the second "international Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST'14)

The implicit objective of the biennial "international - Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST) is to foster collaboration between international scientific teams by disseminating ideas through both specific oral/poster presentations and free discussions. For its second edition, the iTWIST workshop took place in the medieval and picturesque town of Namur in Belgium, from Wednesday August 27th till Friday August 29th, 2014. The workshop was conveniently located in "The Arsenal" building within walking distance of both hotels and town center. iTWIST'14 has gathered about 70 international participants and has featured 9 invited talks, 10 oral presentations, and 14 posters on the following themes, all related to the theory, application and generalization of the "sparsity paradigm": Sparsity-driven data sensing and processing; Union of low dimensional subspaces; Beyond linear and convex inverse problem; Matrix/manifold/graph sensing/processing; Blind inverse problems and dictionary learning; Sparsity and computational neuroscience; Information theory, geometry and randomness; Complexity/accuracy tradeoffs in numerical methods; Sparsity? What's next?; Sparse machine learning and inference.Comment: 69 pages, 24 extended abstracts, iTWIST'14 website: http://sites.google.com/site/itwist1

Joint Spatial-Angular Sparse Coding, Compressed Sensing, and Dictionary Learning for Diffusion MRI

Neuroimaging provides a window into the inner workings of the human brain to diagnose and prevent neurological diseases and understand biological brain function, anatomy, and psychology. Diffusion Magnetic Resonance Imaging (dMRI) is an emerging medical imaging modality used to study the anatomical network of neurons in the brain, which form cohesive bundles, or fiber tracts, that connect various parts of the brain. Since about 73% of the brain is water, measuring the flow, or diffusion of water molecules in the presence of fiber bundles, allows researchers to estimate the orientation of fiber tracts and reconstruct the internal wiring of the brain, in vivo. Diffusion MRI signals can be modeled within two domains: the spatial domain consisting of voxels in a brain volume and the diffusion or angular domain, where fiber orientation is estimated in each voxel. Researchers aim to estimate the probability distribution of fiber orientation in every voxel of a brain volume in order to trace paths of fiber tracts from voxel to voxel over the entire brain. Therefore, the traditional framework for dMRI processing and analysis has been from a voxel-wise vantage point with added spatial regularization considered post-hoc. In contrast, we propose a new joint spatial-angular representation of dMRI data which pairs signals in each voxel with the global spatial environment, jointly. This has the ability to improve many aspects of dMRI processing and analysis and re-envision the core representation of dMRI data from a local perspective to a global one. In this thesis, we propose three main contributions which take advantage of such joint spatial-angular representations to improve major machine learning tasks applied to dMRI: sparse coding, compressed sensing, and dictionary learning. First, we will show that we can achieve sparser representations of dMRI by utilizing a global spatial-angular dictionary instead of a purely voxel-wise angular dictionary. As dMRI data is very large in size, we provide a number of novel extensions to popular spare coding algorithms that perform efficient optimization on a global-scale by exploiting the separability of our dictionaries over the spatial and angular domains. Next, compressed sensing is used to accelerate signal acquisition based on an underlying sparse representation of the data. We will show that our proposed representation has the potential to push the limits of the current state of scanner acceleration within a new compressed sensing model for dMRI. Finally, sparsity can be further increased by learning dictionaries directly from datasets of interest. Prior dictionary learning for dMRI learn angular dictionaries alone. Our third contribution is to learn spatial-angular dictionaries jointly from dMRI data directly to better represent the global structure. Traditionally, the problem of dictionary learning is non-convex with no guarantees of finding a globally optimal solution. We derive the first theoretical results of global optimality for this class of dictionary learning problems. We hope the core foundation of a joint spatial-angular representation will open a new perspective on dMRI with respect to many other processing tasks and analyses. In addition, our contributions are applicable to any general signal types that can benefit from separable dictionaries. We hope the contributions in this thesis may be adopted in the larger signal processing, computer vision, and machine learning communities. dMRI signals can be modeled within two domains: the spatial domain consisting of voxels in a brain volume and the diffusion or angular domain, where fiber orientation is estimated in each voxel. Computationally speaking, researchers aim to estimate the probability distribution of fiber orientation in every voxel of a brain volume in order to trace paths of fiber tracts from voxel to voxel over the entire brain. Therefore, the traditional framework for dMRI processing and analysis is from a voxel-wise, or angular, vantage point with post-hoc consideration of their local spatial neighborhoods. In contrast, we propose a new global spatial-angular representation of dMRI data which pairs signals in each voxel with the global spatial environment, jointly, to improve many aspects of dMRI processing and analysis, including the important need for accelerating the otherwise time-consuming acquisition of advanced dMRI protocols. In this thesis, we propose three main contributions which utilize our joint spatial-angular representation to improve major machine learning tasks applied to dMRI: sparse coding, compressed sensing, and dictionary learning. We will show that sparser codes are possible by utilizing a global dictionary instead of a voxel-wise angular dictionary. This allows for a reduction of the number of measurements needed to reconstruct a dMRI signal to increase acceleration using compressed sensing. Finally, instead of learning angular dictionaries alone, we learn spatial-angular dictionaries jointly from dMRI data directly to better represent the global structure. In addition, this problem is non-convex and so we derive the first theories to guarantee convergence to a global minimum. As dMRI data is very large in size, we provide a number of novel extensions to popular algorithms that perform efficient optimization on a global-scale by exploiting the separability of our global dictionaries over the spatial and angular domains. We hope the core foundation of a joint spatial-angular representation will open a new perspective on dMRI with respect to many other processing tasks and analyses. In addition, our contributions are applicable to any separable dictionary setting which we hope may be adopted in the larger image processing, computer vision, and machine learning communities

The sensitivity of diffusion MRI to microstructural properties and experimental factors

Diffusion MRI is a non-invasive technique to study brain microstructure. Differences in the microstructural properties of tissue, including size and anisotropy, can be represented in the signal if the appropriate method of acquisition is used. However, to depict the underlying properties, special care must be taken when designing the acquisition protocol as any changes in the procedure might impact on quantitative measurements. This work reviews state-of-the-art methods for studying brain microstructure using diffusion MRI and their sensitivity to microstructural differences and various experimental factors. Microstructural properties of the tissue at a micrometer scale can be linked to the diffusion signal at a millimeter-scale using modeling. In this paper, we first give an introduction to diffusion MRI and different encoding schemes. Then, signal representation-based methods and multi-compartment models are explained briefly. The sensitivity of the diffusion MRI signal to the microstructural components and the effects of curvedness of axonal trajectories on the diffusion signal are reviewed. Factors that impact on the quality (accuracy and precision) of derived metrics are then reviewed, including the impact of random noise, and variations in the acquisition parameters (i.e., number of sampled signals, b-value and number of acquisition shells). Finally, yet importantly, typical approaches to deal with experimental factors are depicted, including unbiased measures and harmonization. We conclude the review with some future directions and recommendations on this topic

Moment-based representation of the diffusion inside the brain from reduced DMRI acquisitions: Generalized AMURA

Producción CientíficaAMURA (Apparent Measures Using Reduced Acquisitions) was originally proposed as a method to infer micro-structural information from single-shell acquisitions in diffusion MRI. It reduces the number of samples needed and the computational complexity of the estimation of diffusion properties of tissues by assuming the diffusion anisotropy is roughly independent on the b-value. This simplification allows the computation of simplified expressions and makes it compatible with standard acquisition protocols commonly used even in clinical practice. The present work proposes an extension of AMURA that allows the calculation of general moments of the diffusion signals that can be applied to describe the diffusion process with higher accuracy. We provide simplified expressions to analytically compute a set of scalar indices as moments of arbitrary orders over either the whole 3-D space, particular directions, or particular planes. The existing metrics previously proposed for AMURA (RTOP, RTPP and RTAP) are now special cases of this generalization. An extensive set of experiments is performed on public data and a clinical clase acquired with a standard type acquisition. The new metrics provide additional information about the diffusion processes inside the brain.Ministerio de Ciencia, Innovación y Universidades (grant RTI2018-094569-B-I00)Polish National Agency for Academic Exchange (grant PN/BEK/2019/1/00421)Ministry of Science and Higher Education of Poland (scholarship 692/STYP/13/2018)Junta de Castilla y León - Fondo Social Europeo (ID: 376062

Interactive Medical Image Registration With Multigrid Methods and Bounded Biharmonic Functions

Interactive image registration is important in some medical applications since automatic image registration is often slow and sometimes error-prone. We consider interactive registration methods that incorporate user-specified local transforms around control handles. The deformation between handles is interpolated by some smooth functions, minimizing some variational energies. Besides smoothness, we expect the impact of a control handle to be local. Therefore we choose bounded biharmonic weight functions to blend local transforms, a cutting-edge technique in computer graphics. However, medical images are usually huge, and this technique takes a lot of time that makes itself impracticable for interactive image registration. To expedite this process, we use a multigrid active set method to solve bounded biharmonic functions (BBF). The multigrid approach is for two scenarios, refining the active set from coarse to fine resolutions, and solving the linear systems constrained by working active sets. We\u27ve implemented both weighted Jacobi method and successive over-relaxation (SOR) in the multigrid solver. Since the problem has box constraints, we cannot directly use regular updates in Jacobi and SOR methods. Instead, we choose a descent step size and clamp the update to satisfy the box constraints. We explore the ways to choose step sizes and discuss their relation to the spectral radii of the iteration matrices. The relaxation factors, which are closely related to step sizes, are estimated by analyzing the eigenvalues of the bilaplacian matrices. We give a proof about the termination of our algorithm and provide some theoretical error bounds. Another minor problem we address is to register big images on GPU with limited memory. We\u27ve implemented an image registration algorithm with virtual image slices on GPU. An image slice is treated similarly to a page in virtual memory. We execute a wavefront of subtasks together to reduce the number of data transfers. Our main contribution is a fast multigrid method for interactive medical image registration that uses bounded biharmonic functions to blend local transforms. We report a novel multigrid approach to refine active set quickly and use clamped updates based on weighted Jacobi and SOR. This multigrid method can be used to efficiently solve other quadratic programs that have active sets distributed over continuous regions

International Conference on Continuous Optimization (ICCOPT) 2019 Conference Book

The Sixth International Conference on Continuous Optimization took place on the campus of the Technical University of Berlin, August 3-8, 2019. The ICCOPT is a flagship conference of the Mathematical Optimization Society (MOS), organized every three years. ICCOPT 2019 was hosted by the Weierstrass Institute for Applied Analysis and Stochastics (WIAS) Berlin. It included a Summer School and a Conference with a series of plenary and semi-plenary talks, organized and contributed sessions, and poster sessions. This book comprises the full conference program. It contains, in particular, the scientific program in survey style as well as with all details, and information on the social program, the venue, special meetings, and more