The Split Bregman Method for L1-Regularized Problems
Tom Goldstein, Stanley Osher · SIAM Journal on Imaging Sciences · 2009
The class of L1-regularized optimization problems has received much attention recently because of the introduction of “compressed sensing,” which allows images and signals to be reconstructed from small amounts of data. Despite this recent attention, many L1-regularized problems still remain difficult to solve, or require techniques that are very problem-specific. In this paper, we show that Bregman iteration can be used to solve a wide variety of constrained optimization problems. Using this technique, we propose a “split Bregman” method, which can solve a very broad class of L1-regularized problems. We apply this technique to the Rudin–Osher–Fatemi functional for image denoising and to a compressed sensing problem that arises in magnetic resonance imaging.
Cited by 4,282 works. doi:10.1137/080725891
Authors
References
- Convex Optimization
- Compressed sensing
- Compressed sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Nonlinear total variation based noise removal algorithms
- Numerical optimization
- Fast approximate energy minimization via graph cuts
- Sparse MRI: The application of compressed sensing for rapid MR imaging
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
- Iterative Methods for Total Variation Denoising