A Fast Splitting Method for efficient Split Bregman Iterations
arXiv:1809.111356 citations
Originality Incremental advance
AI Analysis
This work offers an incremental improvement in optimization methods for imaging tasks, providing a faster variant of an existing algorithm.
The paper proposes a fast splitting algorithm for the Weighted Split Bregman minimization problem, demonstrating convergence and showing improved accuracy and computational efficiency across various imaging applications.
In this paper we propose a new fast splitting algorithm to solve the Weighted Split Bregman minimization problem in the backward step of an accelerated Forward-Backward algorithm. Beside proving the convergence of the method, numerical tests, carried out on different imaging applications, prove the accuracy and computational efficiency of the proposed algorithm.