Bregman implementation of Meyer's $G-$norm for cartoon + textures decomposition
Jerome Gilles, Stanley Osher
TL;DR
A very simple algorithm based on Split Bregman iterations to numerically solve the cartoon + textures decomposition model of Meyer results in a significant gain in speed compared to Chambolle's nonlinear projectors.
Abstract
In this paper, we design a very simple algorithm based on Split Bregman iterations to numerically solve the cartoon + textures decomposition model of Meyer. This results in a significant gain in speed compared to Chambolle's nonlinear projectors.
