A NON-CONVEX NON-SMOOTH BI-LEVEL PARAMETER LEARNING FOR IMPULSE AND GAUSSIAN NOISE MIXTURE REMOVING

被引:15
|
作者
Nachaoui, Mourad [1 ]
Afraites, Lekbir [1 ]
Hadri, Aissam [2 ]
Laghrib, Amine [1 ]
机构
[1] Univ Sultan Moulay Slimane, EMI FST Beni Mellal, Beni Mellal, Morocco
[2] Univ IBN ZOHR Agadir, Lab SIE, Agadir, Morocco
关键词
  Non-convex function; mixture noise; learning parameter; bi-level optimization; OPTIMALITY CONDITIONS; BILEVEL OPTIMIZATION; PROGRAMS; MODEL;
D O I
10.3934/cpaa.2022018
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper introduce a novel optimization procedure to reduce mixture of Gaussian and impulse noise from images. This technique exploits a non-convex PDE-constrained characterized by a fractional-order operator. The used non-convex term facilitated the impulse component approximation controlled by a spatial parameter-y. A non-convex and non-smooth bi-level optimization framework with a modified projected gradient algorithm is then proposed in order to learn the parameter-y. Denoising tests confirm that the non-convex term and learned parameter-y lead in general to an improved reconstruction when compared to results of convex norm and manual parameter lambda choice.
引用
收藏
页码:1249 / 1291
页数:43
相关论文
共 50 条
  • [21] Non-smooth Non-convex Bregman Minimization: Unification and New Algorithms
    Peter Ochs
    Jalal Fadili
    Thomas Brox
    Journal of Optimization Theory and Applications, 2019, 181 : 244 - 278
  • [22] Cutting Plane Oracles to Minimize Non-smooth Non-convex Functions
    Noll, Dominikus
    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
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2019, 181 (01) : 244 - 278
  • [24] Convergence guarantees for a class of non-convex and non-smooth optimization problems
    Khamaru, Koulik
    Wainwright, Martin J.
    JOURNAL OF MACHINE LEARNING RESEARCH, 2019, 20
  • [25] Relaxed Majorization-Minimization for Non-Smooth and Non-Convex Optimization
    Xu, Chen
    Lin, Zhouchen
    Zhao, Zhenyu
    Zha, Hongbin
    THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, : 812 - 818
  • [26] Inexact Proximal Gradient Methods for Non-Convex and Non-Smooth Optimization
    Gu, Bin
    Wang, De
    Huo, Zhouyuan
    Huang, Heng
    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
  • [27] Fast Proximal Gradient Descent for A Class of Non-convex and Non-smooth Sparse Learning Problems
    Yang, Yingzhen
    Yu, Jiahui
    35TH UNCERTAINTY IN ARTIFICIAL INTELLIGENCE CONFERENCE (UAI 2019), 2020, 115 : 1253 - 1262
  • [28] Cutting Plane Oracles to Minimize Non-smooth Non-convex Functions
    Dominikus Noll
    Set-Valued and Variational Analysis, 2010, 18 : 531 - 568
  • [29] Optimal, Stochastic, Non-smooth, Non-convex Optimization through Online-to-Non-convex Conversion
    Cutkosky, Ashok
    Mehta, Harsh
    Orabona, Francesco
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 202, 2023, 202
  • [30] NON-CONVEX TV DENOISING CORRUPTED BY IMPULSE NOISE
    Jung, Moon Mo
    Jeong, Taeuk
    Yun, Sangwoon
    INVERSE PROBLEMS AND IMAGING, 2017, 11 (04) : 689 - 702