A Fast Splitting Method for efficient Split Bregman Iterations
D. Lazzaro, E. Loli Piccolomini, F. Zama

TL;DR
This paper introduces a new fast splitting algorithm for the Split Bregman method, improving efficiency and accuracy in imaging applications, with proven convergence and demonstrated computational benefits.
Contribution
The paper presents a novel splitting algorithm that accelerates Split Bregman iterations and proves its convergence, enhancing performance in imaging tasks.
Findings
Proposed algorithm converges reliably.
Numerical tests show improved efficiency.
Enhanced accuracy in imaging applications.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Microwave Imaging and Scattering Analysis · Photoacoustic and Ultrasonic Imaging
