首页> 外文会议>International Conference on Control, Artificial Intelligence, Robotics amp;amp;amp;amp;amp;amp; Optimization >Alternating Minimization Algorithms for Convex Minimization Problem with Application to Image Deblurring and Denoising
【24h】

Alternating Minimization Algorithms for Convex Minimization Problem with Application to Image Deblurring and Denoising

机译:凸起最小化问题的交替最小化算法与映像去孔和去噪

获取原文

摘要

In this paper, we propose algorithm to restore blurred and noisy images based on the discretized total variation minimization technique. The proposed method is based on an alternating technique for image deblurring and denoising. Start by finding an approximate image using a Tikhonov regularization method. This corresponds to a deblurring process with possible artifacts and noise remaining. In the denoising step, we use fast iterative shrinkage-thresholding algorithm (SFISTA) or fast gradient-based algorithm (FGP). Besides, we prove the convergence of the proposed algorithm. Numerical results demonstrate the efficiency and viability of the proposed algorithm to restore the degraded images.
机译:在本文中,我们提出了基于离散的总变化最小化技术恢复模糊和噪声图像的算法。所提出的方法基于用于图像去纹身和去噪的交替技术。首先使用Tikhonov正规方法查找近似图像。这对应于具有可能伪像和剩余噪声的去纹理过程。在去噪步骤中,我们使用快速迭代收缩阈值算法(SFISTA)或基于快速梯度的算法(FGP)。此外,我们证明了所提出的算法的融合。数值结果展示了所提出的算法恢复降级图像的效率和可行性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号