首页> 外文期刊>IEEE signal processing letters >Nonconvex Weighted Minimization Based Group Sparse Representation Framework for Image Denoising
【24h】

Nonconvex Weighted Minimization Based Group Sparse Representation Framework for Image Denoising

机译:基于非凸加权最小化的图像稀疏群稀疏表示框架

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

摘要

Nonlocal image representation or group sparsity has attracted considerable interest in various low-level vision tasks and has led to several state-of-the-art image denoising techniques, such as BM3D, learned simultaneous sparse coding. In the past, convex optimization with sparsity-promoting convex regularization was usually regarded as a standard scheme for estimating sparse signals in noise. However, using convex regularization cannot still obtain the correct sparsity solution under some practical problems including image inverse problems. In this letter, we propose a nonconvex weighted minimization based group sparse representation framework for image denoising. To make the proposed scheme tractable and robust, the generalized soft-thresholding algorithm is adopted to solve the nonconvex minimization problem. In addition, to improve the accuracy of the nonlocal similar patch selection, an adaptive patch search scheme is proposed. Experimental results demonstrate that the proposed approach not only outperforms many state-of-the-art denoising methods such as BM3D and weighted nuclear norm minimization, but also results in a competitive speed.
机译:非本地图像表示或组稀疏性已在各种低级视觉任务中引起了相当大的兴趣,并导致了几种最新的图像去噪技术(例如BM3D),学习的同时稀疏编码。过去,通常采用带有稀疏度促进凸正则化的凸优化作为估计噪声中稀疏信号的标准方案。但是,在某些实际问题(包括图像逆问题)下,使用凸正则化仍无法获得正确的稀疏解。在这封信中,我们提出了一种基于非凸加权最小化的组稀疏表示框架进行图像去噪。为了使所提出的方案易于处理且鲁棒,采用广义的软阈值算法来解决非凸最小化问题。另外,为了提高非局部相似补丁选择的准确性,提出了一种自适应补丁搜索方案。实验结果表明,提出的方法不仅优于许多最新的去噪方法(例如BM3D和加权核规范最小化),而且还具有竞争优势。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号