Bregman implementation of Meyer's $G-$norm for cartoon + textures decomposition

This addresses the computational efficiency issue in image processing for researchers and practitioners, but it is incremental as it builds on existing models.

The paper tackled the problem of cartoon + textures decomposition by designing a simple algorithm based on Split Bregman iterations to solve Meyer's model, resulting in a significant speed gain compared to Chambolle's nonlinear projectors.