Non-convex and non-smooth variational decomposition for image restoration

被引:28
|
作者
Tang Liming [1 ]
Zhang Honglu [1 ]
He Chuanjiang [2 ]
Fang Zhuang [1 ]
机构
[1] Hubei Univ Nationalities, Sch Sci, Enshi 445000, Peoples R China
[2] Chongqing Univ, Coll Math & Stat, Chongqing 401331, Peoples R China
关键词
Variational decomposition; Image restoration; Non-convex; Non-smooth; IRL1; algorithm; ADMM algorithm; TOTAL VARIATION MINIMIZATION; VARIATION MODEL; NOISE REMOVAL; REGULARIZATION; ALGORITHM; RECONSTRUCTION; OPTIMIZATION; SIGNALS;
D O I
10.1016/j.apm.2018.12.021
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The variational image decomposition model decomposes an image into a structural and an oscillatory component by regularization technique and functional minimization. It is an important task in various image processing methods, such as image restoration, image segmentation, and object recognition. In this paper, we propose a non-convex and non-smooth variational decomposition model for image restoration that uses non-convex and non-smooth total variation (TV) to measure the structure component and the negative Sobolev space H-1 to model the oscillatory component. The new model combines the advantages of non-convex regularization and weaker-norm texture modeling, and it can well remove the noises while preserving the valuable edges and contours of the image. The iteratively reweighted l(1) (IRL1) algorithm is employed to solve the proposed non-convex minimization problem. For each subproblem, we use the alternating direction method of multipliers (ADMM) algorithm to solve it. Numerical results validate the effectiveness of the proposed model for both synthetic and real images in terms of peak signal-to-noise ratio (PSNR) and mean structural similarity index (MSSIM). (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码:355 / 377
页数:23
相关论文
共 50 条
  • [21] Inertial Block Proximal Methods For Non-Convex Non-Smooth Optimization
    Le Thi Khanh Hien
    Gillis, Nicolas
    Patrinos, Panagiotis
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 119, 2020, 119
  • [22] Cutting Plane Oracles to Minimize Non-smooth Non-convex Functions
    Noll, Dominikus
    [J]. SET-VALUED AND VARIATIONAL ANALYSIS, 2010, 18 (3-4) : 531 - 568
  • [23] Non-smooth Non-convex Bregman Minimization: Unification and New Algorithms
    Ochs, Peter
    Fadili, Jalal
    Brox, Thomas
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2019, 181 (01) : 244 - 278
  • [24] Non-smooth Non-convex Bregman Minimization: Unification and New Algorithms
    Peter Ochs
    Jalal Fadili
    Thomas Brox
    [J]. Journal of Optimization Theory and Applications, 2019, 181 : 244 - 278
  • [25] Convergence guarantees for a class of non-convex and non-smooth optimization problems
    Khamaru, Koulik
    Wainwright, Martin J.
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2019, 20
  • [26] Relaxed Majorization-Minimization for Non-Smooth and Non-Convex Optimization
    Xu, Chen
    Lin, Zhouchen
    Zhao, Zhenyu
    Zha, Hongbin
    [J]. THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, : 812 - 818
  • [27] Inexact Proximal Gradient Methods for Non-Convex and Non-Smooth Optimization
    Gu, Bin
    Wang, De
    Huo, Zhouyuan
    Huang, Heng
    [J]. THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 3093 - 3100
  • [28] A study of non-smooth convex flow decomposition
    Yuan, J
    Schnörr, C
    Steidl, G
    Becker, F
    [J]. VARIATIONAL, GEOMETRIC, AND LEVEL SET METHODS IN COMPUTER VISION, PROCEEDINGS, 2005, 3752 : 1 - 12
  • [29] Cutting Plane Oracles to Minimize Non-smooth Non-convex Functions
    Dominikus Noll
    [J]. Set-Valued and Variational Analysis, 2010, 18 : 531 - 568
  • [30] Optimal, Stochastic, Non-smooth, Non-convex Optimization through Online-to-Non-convex Conversion
    Cutkosky, Ashok
    Mehta, Harsh
    Orabona, Francesco
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 202, 2023, 202