A Multicore Convex Optimization Algorithm with Applications to Video Restoration
Lists
Only you see this
Abstract
In this paper, we present a new distributed algorithm for minimizing a sum of non-necessarily differentiable convex functions composed with arbitrary linear operators. The overall cost function is assumed strongly convex. Each involved function is associated with a node of a hypergraph having the ability to communicate with neighboring nodes sharing the same hyperedge. Our algorithm relies on a primal-dual splitting strategy with established convergence guarantees. We show how it can be efficiently implemented to take full advantage of a multicore architecture. The good numerical performance of the proposed approach is illustrated in a problem of video sequence denoising, where a significant speedup is achieved.
BibTeX
@inproceedings{abboud2018multicore,
author = {Feriel Abboud and Émilie Chouzenoux and Jean-Christophe Pesquet and Hugues Talbot},
title = {{A Multicore Convex Optimization Algorithm with Applications to Video Restoration}},
booktitle = {ICIP},
year = {2018},
doi = {10.1109/icip.2018.8451798},
}Loading related content...