Person

Matthieu Guerquin-Kern

This person is no longer with EPFL

Related publications (15)

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.

Fast high-resolution brain metabolite mapping on a clinical 3T MRI by accelerated H-1-FID-MRSI and low-rank constrained reconstruction

Dimitri Nestor Alice Van De Ville, Michel Kocher, Matthieu Guerquin-Kern, Jeffrey Adam Kasten, François Lazeyras, Sébastien Courvoisier

Purpose: Epitomizing the advantages of ultra short echo time and no chemical shift displacement error, high-resolution-free induction decay magnetic resonance spectroscopic imaging (FID-MRSI) sequences have proven to be highly effective in providing unbias ...

WILEY2019

Magnetic resonance imaging (MRI) scanners produce raw measurements that are unfit to direct interpretation, unless an algorithmic step, called reconstruction, is introduced. Up to the last decade, this reconstruction was performed by algorithms of moderate ...

EPFL2012

Realistic Analytical Phantoms for Parallel Magnetic Resonance Imaging

Michaël Unser, Matthieu Guerquin-Kern

The quantitative validation of reconstruction algorithms requires reliable data. Rasterized simulations are popular but they are tainted by an aliasing component that impacts the assessment of the performance of reconstruction. We introduce analytical simu ...

IEEE2012

A Fast Wavelet-Based Reconstruction Method for Magnetic Resonance Imaging

Michaël Unser, Matthieu Guerquin-Kern

In this work, we exploit the fact that wavelets can represent magnetic resonance images well, with relatively few coefficients. We use this property to improve magnetic resonance imaging (MRI) reconstructions from undersampled data with arbitrary k-space t ...

Institute of Electrical and Electronics Engineers2011

, ,

Most bioimaging modalities rely on indirect measurements of the quantity under investigation. The image is obtained as the result of an optimization problem involving a physical model of the measurement system. Due to the ill-posedness of the above problem ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

, ,

IEEE2011

Accelerated Wavelet-Regularized Deconvolution For 3-D Fluorescence Microcopy

Michaël Unser, Matthieu Guerquin-Kern, Ilker Bayram, Raquel Terrés Cristofani

Modern deconvolution algorithms are often specified as minimization problems involving a non-quadratic regularization functional. When the latter is a wavelet-domain l(1)-norm that favors sparse solutions, the problem can be solved by a simple iterative sh ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Accelerated Wavelet-Regularized Deconvolution for 3-D Fluorescence Microcopy

Michaël Unser, Matthieu Guerquin-Kern, Ilker Bayram, Raquel Terrés Cristofani

Modern deconvolution algorithms are often specified as minimization problems involving a non-quadratic regularization functional. When the latter is a wavelet-domain

ℓ _{ 1 }

-norm that favors sparse solutions, the problem can be solved by a simple it ...

IEEE2010

, ,

We present an analytical form of ground-truth k-space data for the 2-D Shepp-Logan brain phantom in the presence of multiple and non-homogeneous receiving coils. The analytical form allows us to conduct realistic simulations and validations of reconstructi ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

, ,

IEEE2010

Accelerated Wavelet-Regularized Deconvolution for 3-D Fluorescence Microcopy

Michaël Unser, Matthieu Guerquin-Kern, Ilker Bayram, Raquel Terrés Cristofani

Modern deconvolution algorithms are often specified as minimization problems involving a non-quadratic regularization functional. When the latter is a wavelet-domain

ℓ _{ 1 }

-norm that favors sparse solutions, the problem can be solved by a simple it ...

IEEE2010