Fast and robust estimation of NODDI parameters using non-Gaussian noise models and spatial regularization
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
The idea that the brain functions so as to minimize certain costs pervades theoretical neuroscience. Because a cost function by itself does not predict how the brain finds its minima, additional assumptions about the optimization method need to be made to ...
Predictive gait simulations currently do not account for environmental or internal noise. We describe a method to solve predictive simulations of human movements in a stochastic environment using a collocation method. The optimization is performed over mul ...
In this article, a method for identification of equivalent stiffness was proposed based on a genetic algorithm by studying the stiffness characteristics of autoeliminating clearance auxiliary bearing devices (ACABDs) in static condition. Subsequently, the ...
In this paper we tackle the problem of regularisation for inverse problems in single shell diffusion weighted image restoration. Our aim is to recover a high-resolution and denoised DWI signal, prior to any model fitting. The main contribution of our metho ...
Least squares estimators, when trained on a few target domain samples, may predict poorly. Supervised domain adaptation aims to improve the predictive accuracy by exploiting additional labeled training samples from a source distribution that is close to th ...
We propose a distributed design method for decentralized control by exploiting the underlying sparsity properties of the problem. Our method is based on chordal decomposition of sparse block matrices and the alternating direction method of multipliers (ADM ...
We present a strikingly simple proof that two rules are sufficient to automate gradient descent: 1) don’t increase the stepsize too fast and 2) don’t overstep the local curvature. No need for functional values, no line search, no information about the func ...
The dynamics of legged systems are characterized by under-actuation, instability, and contact state switching. We present a trajectory optimization method for generating physically consistent motions under these conditions. By integrating a custom solver f ...
In this paper, we propose a novel splitting method for finding a zero point of the sum of two monotone operators where one of them is Lipschizian. The weak convergence the method is proved in real Hilbert spaces. Applying the proposed method to composite m ...
This paper considers a generic convex minimization template with affine constraints over a compact domain, which covers key semidefinite programming applications. The existing conditional gradient methods either do not apply to our template or are too slow ...
