A block parallel majorize-minimize memory gradient algorithm - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

A block parallel majorize-minimize memory gradient algorithm


In the field of 3D image recovery, huge amounts of data need to be processed. Parallel optimization methods are then of main interest since they allow to overcome memory limitation issues, while benefiting from the intrinsic acceleration provided by recent multicore computing architectures. In this context, we propose a Block Parallel Majorize-Minimize Memory Gradient (BP3MG) algorithm for solving large scale optimization problems. This algorithm combines a block coordinate strategy with an efficient parallel update. The proposed method is applied to a 3D microscopy image restoration problem involving a depth-variant blur, where it is shown to lead to significant computational time savings with respect to a sequential approach.
Fichier principal
Vignette du fichier
icip2016.pdf (150.85 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01418417 , version 1 (16-12-2016)


Public Domain



Sara Cadoni, Emilie Chouzenoux, Jean-Christophe Pesquet, Caroline Chaux. A block parallel majorize-minimize memory gradient algorithm. IEEE International Conference on Image Processing (ICIP 2016), Sep 2016, Phoenix, AZ, United States. pp.3194 - 3198, ⟨10.1109/ICIP.2016.7532949⟩. ⟨hal-01418417⟩
564 View
334 Download



Gmail Facebook X LinkedIn More