...
首页> 外文期刊>Computational optimization and applications >Bregman operator splitting with variable stepsize for total variation image reconstruction
【24h】

Bregman operator splitting with variable stepsize for total variation image reconstruction

机译:Bregman算子以可变步长分割以进行总变化图像重建

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

This paper develops a Bregman operator splitting algorithm with variable stepsize (BOSVS) for solving problems of the form minphi(Bu)_(+1/2)Au- _2 ~2, where may be nonsmooth. The original Bregman Operator Splitting (BOS) algorithm employed a fixed stepsize, while BOSVS uses a line search to achieve better efficiency. These schemes are applicable to total variation (TV)-based image reconstruction. The stepsize rule starts with a Barzilai-Borwein (BB) step, and increases the nominal step until a termination condition is satisfied. The stepsize rule is related to the scheme used in SpaRSA (Sparse Reconstruction by Separable Approximation). Global convergence of the proposed BOSVS algorithm to a solution of the optimization problem is established. BOSVS is compared with other operator splitting schemes using partially parallel magnetic resonance image reconstruction problems. The experimental results indicate that the proposed BOSVS algorithm is more efficient than the BOS algorithm and another split Bregman Barzilai-Borwein algorithm known as SBB.
机译:本文提出了一种可变步长(BOSVS)的Bregman算子分裂算法,用于解决minphi(Bu)_(+ 1/2)Au- _2〜2形式的问题,其中可能是非光滑的。最初的Bregman运算符拆分(BOS)算法采用了固定的步长,而BOSVS使用行搜索来实现更高的效率。这些方案适用于基于总变化(TV)的图像重建。步长规则从Barzilai-Borwein(BB)步骤开始,并增加名义步长,直到满足终止条件为止。步长规则与SpaRSA(可分离近似的稀疏重构)中使用的方案有关。建立了所提出的BOSVS算法对优化问题求解的全局收敛性。使用部分平行的磁共振图像重建问题,将BOSVS与其他算子拆分方案进行了比较。实验结果表明,提出的BOSVS算法比BOS算法和另一种称为SBB的分裂Bregman Barzilai-Borwein算法效率更高。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号