A complex-valued majorize-minimize memory gradient method with application to parallel MRI

Abstract : Complex-valued data are encountered in many application areas of signal and image processing. In the context of optimization of functions of real variables, subspace algorithms have recently attracted much interest, due to their efficiency in solving large-size problems while simultaneously offering theoretical convergence guarantees. The goal of this paper is to show how some of these methods can be successfully extended to the complex case. More precisely, we investigate the properties of the proposed complex-valued Majorize- Minimize Memory Gradient (3MG) algorithm. An important practical application of these results arises for image reconstruction in Parallel Magnetic Resonance Imaging (PMRI). Comparisons with existing optimization methods confirm the good performance of our approach for PMRI reconstruction.
Type de document :
Communication dans un congrès
21st European Signal Processing Conference (EUSIPCO 2013), Sep 2013, Marrakech, Morocco. pp.14283743.1-14283743.5, 2013
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00866800
Contributeur : Emilie Chouzenoux <>
Soumis le : vendredi 27 septembre 2013 - 10:38:41
Dernière modification le : jeudi 9 février 2017 - 15:48:00

Identifiants

  • HAL Id : hal-00866800, version 1

Citation

Anisia Florescu, Emilie Chouzenoux, Jean-Christophe Pesquet, Philippe Ciuciu, Silviu Ciochina. A complex-valued majorize-minimize memory gradient method with application to parallel MRI. 21st European Signal Processing Conference (EUSIPCO 2013), Sep 2013, Marrakech, Morocco. pp.14283743.1-14283743.5, 2013. <hal-00866800>

Partager

Métriques

Consultations de la notice

313