期刊
SIAM JOURNAL ON IMAGING SCIENCES
卷 2, 期 2, 页码 323-343出版社
SIAM PUBLICATIONS
DOI: 10.1137/080725891
关键词
constrained optimization; L1-regularization; compressed sensing; total variation denoising
类别
资金
- National Science Foundation
- ONR [N000140710810]
- Department of Defense
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据