Efficient total variation algorithm for fetal MRI reconstruction
Data(s) |
01/09/2014
|
---|---|
Resumo |
Fetal MRI reconstruction aims at finding a high-resolution image given a small set of low-resolution images. It is usually modeled as an inverse problem where the regularization term plays a central role in the reconstruction quality. Literature has considered several regularization terms s.a. Dirichlet/Laplacian energy [1], Total Variation (TV)based energies [2,3] and more recently non-local means [4]. Although TV energies are quite attractive because of their ability in edge preservation, standard explicit steepest gradient techniques have been applied to optimize fetal-based TV energies. The main contribution of this work lies in the introduction of a well-posed TV algorithm from the point of view of convex optimization. Specifically, our proposed TV optimization algorithm for fetal reconstruction is optimal w.r.t. the asymptotic and iterative convergence speeds O(1/n(2)) and O(1/root epsilon), while existing techniques are in O(1/n) and O(1/epsilon). We apply our algorithm to (1) clinical newborn data, considered as ground truth, and (2) clinical fetal acquisitions. Our algorithm compares favorably with the literature in terms of speed and accuracy. |
Identificador |
http://serval.unil.ch/?id=serval:BIB_211046481FEA doi:10.1007/978-3-319-10470-6_32 isiid:000347686400032 isbn:978-3-319-10470-6 |
Idioma(s) |
en |
Fonte |
17th International Conference on Medical Image Computing and Computer Assisted Intervention |
Palavras-Chave | #fetal imaging, magnetic resonance, image reconstruction, super-resolution, total-variation, optimisation |
Tipo |
info:eu-repo/semantics/conferenceObject inproceedings |