Matthias Joachim Ehrhardt

Matthias Joachim Ehrhardt

Auto-generated profile, based on publicly available information

Matthias Joachim Ehrhardt

Department of Mathematical Sciences University of Bath BA2 7AY Bath UK

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2018 in SIAM Journal on Optimization
Verified
Journal Article
Open access
ACAntonin Chambolle
Antonin Chambolle
MEMatthias J. Ehrhardt
Matthias J. Ehrhardt
PRPeter Richtárik
Peter Richtárik
CSCarola-Bibiane Schönlieb
Carola-Bibiane Schönlieb
We propose a stochastic extension of the primal-dual hybrid gradient algorithm studied by Chambolle and Pock in 2011 to solve saddle point problems that are separable in the dual variable. The analysis is carried out for general convex-concave saddle point problems and problems that are either partially smooth, strongly convex or fully smooth, strongly convex. We perform the analysis for arbitrary samplings of dual variables, and we obtain known deterministic results as a special case. Several variants of our stochastic method significantly outperform the deterministic variant on a variety of imaging tasks.

10 December 2014 in Inverse Problems
Verified
Journal Article
Open access
MEMatthias J Ehrhardt
Matthias J Ehrhardt
KTKris Thielemans
Kris Thielemans
LPLuis Pizarro
Luis Pizarro
DADavid Atkinson
David Atkinson
SOSébastien Ourselin
Sébastien Ourselin
SASimon R Arridge
Simon R Arridge

1 January 2016 in SIAM Journal on Imaging Sciences
Verified
Journal Article
Open access
MEMatthias J. Ehrhardt
Matthias J. Ehrhardt
MBMarta M. Betcke
Marta M. Betcke
Magnetic resonance imaging (MRI) is a versatile imaging technique that allows different contrasts depending on the acquisition parameters. Many clinical imaging studies acquire MRI data for more th...

14 April 2016 in IEEE Transactions on Medical Imaging
Verified
Journal Article
Open access
MEMatthias J. Ehrhardt
Matthias J. Ehrhardt
PMPawel Markiewicz
Pawel Markiewicz
MLMaria Liljeroth
Maria Liljeroth
Anna BarnesAnna Barnes
Anna Barnes
Ville KolehmainenVille Kolehmainen
Ville Kolehmainen
SASimon R. Arridge
Simon R. Arridge
The combination of positron emission tomography (PET) and magnetic resonance imaging (MRI) offers unique possibilities. In this paper we aim to exploit the high spatial resolution of MRI to enhance the reconstruction of simultaneously acquired PET data. We propose a new prior to incorporate structural side information into a maximum a posteriori reconstruction. The new prior combines the strengths of previously proposed priors for the same problem: it is very efficient in guiding the reconstruction at edges available from the side information and it reduces locally to edge-preserving total variation in the degenerate case when no structural information is available. In addition, this prior is segmentation-free, convex and no a priori assumptions are made on the correlation of edge directions of the PET and MRI images. We present results for a simulated brain phantom and for real data acquired by the Siemens Biograph mMR for a hardware phantom and a clinical scan. The results from simulations show that the new prior has a better trade-off between enhancing common anatomical boundaries and preserving unique features than several other priors. Moreover, it has a better mean absolute bias-to-mean standard deviation trade-off and yields reconstructions with superior relative $\ell ^{2}$ -error and structural similarity index. These findings are underpinned by the real data results from a hardware phantom and a clinical patient confirming that the new prior is capable of promoting well-defined anatomical boundaries.

17 August 2020 in IEEE Transactions on Medical Imaging
Verified
Journal Article
Closed access
FSFerdia Sherry
Ferdia Sherry
MBMartin Benning
Martin Benning
JRJuan Carlos De Los Reyes
Juan Carlos De Los Reyes
MGMartin J. Graves
Martin J. Graves
GMGeorg Maierhofer
Georg Maierhofer
MEMatthias J. Ehrhardt
Matthias J. Ehrhardt
The discovery of the theory of compressed sensing brought the realisation that many inverse problems can be solved even when measurements are "incomplete". This is particularly interesting in magnetic resonance imaging (MRI), where long acquisition times can limit its use. In this work, we consider the problem of learning a sparse sampling pattern that can be used to optimally balance acquisition time versus quality of the reconstructed image. We use a supervised learning approach, making the assumption that our training data is representative enough of new data acquisitions. We demonstrate that this is indeed the case, even if the training data consists of just 7 training pairs of measurements and ground-truth images; with a training set of brain images of size 192 by 192, for instance, one of the learned patterns samples only 35% of k-space, however results in reconstructions with mean SSIM 0.914 on a test set of similar images. The proposed framework is general enough to learn arbitrary sampling patterns, including common patterns such as Cartesian, spiral and radial sampling.

1 January 2019 in Journal of Computational Dynamics
Verified
Journal Article
Open access
PDF file
MBMartin Benning
Martin Benning
ECElena Cellodoni
Elena Cellodoni
MEMatthias J. Ehrhardt
Matthias J. Ehrhardt
BOBrynjulf Owren
Brynjulf Owren
CSCarola-Bibiane Schönlieb
Carola-Bibiane Schönlieb
We consider recent work of [18] and [9], where deep learning neural networks have been interpreted as discretisations of an optimal control problem subject to an ordinary differential equation constraint. We review the first order conditions for optimality, and the conditions ensuring optimality after discretisation. This leads to a class of algorithms for solving the discrete optimal control problem which guarantee that the corresponding discrete necessary conditions for optimality are fulfilled. The differential equation setting lends itself to learning additional parameters such as the time discretisation. We explore this extension alongside natural constraints (e.g. time steps lie in a simplex). We compare these deep learning algorithms numerically in terms of induced flow and generalisation ability.