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 条
  • [41] Stochastic proximal methods for non-smooth non-convex constrained sparse optimization
    Metel, Michael R.
    Takeda, Akiko
    Journal of Machine Learning Research, 2021, 22
  • [42] Incorporating Non-Convex Operating Characteristics Into Bi-Level Optimization Electricity Market Models
    Ye, Yujian
    Papadaskalopoulos, Dimitrios
    Kazempour, Jalal
    Strbac, Goran
    IEEE TRANSACTIONS ON POWER SYSTEMS, 2020, 35 (01) : 163 - 176
  • [43] Hybrid non-convex regularizers model for removing multiplicative noise
    Liu, Xinwu
    Sun, Ting
    Computers and Mathematics with Applications, 2022, 126 : 182 - 195
  • [44] Hybrid non-convex regularizers model for removing multiplicative noise
    Liu, Xinwu
    Sun, Ting
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2022, 126 : 182 - 195
  • [45] Non-asymptotic Analysis of Stochastic Methods for Non-Smooth Non-Convex Regularized Problems
    Xu, Yi
    Jin, Rong
    Yang, Tianbao
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
  • [46] Complementarity, polarity and triality in non-smooth, non-convex and non-conservative Hamilton systems
    Gao, DY
    PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2001, 359 (1789): : 2347 - 2367
  • [47] A Linearly Convergent Method for Non-Smooth Non-Convex Optimization on the Grassmannian with Applications to Robust Subspace and Dictionary Learning
    Zhu, Zhihui
    Ding, Tianyu
    Tsakiris, Manolis C.
    Robinson, Daniel P.
    Vidal, Rene
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
  • [48] A proximal gradient method for control problems with non-smooth and non-convex control cost
    Natemeyer, Carolin
    Wachsmuth, Daniel
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2021, 80 (02) : 639 - 677
  • [49] Decentralized Gradient-Free Methods for Stochastic Non-smooth Non-convex Optimization
    Lin, Zhenwei
    Xia, Jingfan
    Deng, Qi
    Luo, Luo
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 16, 2024, : 17477 - 17486
  • [50] Classical solutions for the pressure-gradient equations in non-smooth and non-convex domains
    Kim, EH
    Song, K
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2004, 293 (02) : 541 - 550