A Nonconvex Nonsmooth Image Prior Based on the Hyperbolic Tangent Function

被引:0
作者
Fang Li
Xiao-Guang Lv
机构
[1] East China Normal University,School of Mathematical Sciences, Ministry of Education Key Laboratory of Mathematics and Engineering Applications & Shanghai Key Laboratory of PMMP
[2] Chongqing Institute of East China Normal University,Chongqing Key Laboratory of Precision Optics
[3] Jiangsu Ocean University,School of Science
来源
Journal of Scientific Computing | 2023年 / 97卷
关键词
Nonconvex nonsmooth function; Hyperbolic tangent prior; Regularization; Image restoration; Image reconstruction; 94A08; 68U10; 47A52;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, we propose a nonconvex and nonsmooth image prior based on the hyperbolic tangent function and apply it as a regularization term for image restoration and reconstruction problems. Theoretically, we analyze the properties of the function and the minimizers of its associated proximal problem. Since the proximal problem has no closed-form solution, we propose a derivative-free Nelder-Mead simplex based selection algorithm to find the global minimizer. To reduce the computational cost, we only solve a small 1D problem and then use the 1D solution template as a look-up table to interpolate high-dimension data. Moreover, we consider a variational model based on the proposed image prior. Then we use the alternating direction method of multipliers algorithm on the nonconvex model to derive efficient numerical algorithms. Various experiments on image denoising, image deblurring, and image reconstruction demonstrate that the proposed nonconvex prior is competitive with the existing priors. In particular, it outperforms others in recovering piecewise constant images.
引用
收藏
相关论文
共 102 条
  • [1] Bian W(2015)Linearly constrained non-lipschitz optimization for image restoration SIAM J. Imag. Sci. 8 2294-2322
  • [2] Chen X(2005)Aspects of total variation regularized L1 function approximation SIAM J. Appl. Math. 65 1817-1837
  • [3] Chan TF(2017)An augmented lagrangian method for non-lipschitz nonconvex programming SIAM J. Numer. Anal. 55 168-193
  • [4] Esedoglu S(2001)Variable selection via nonconcave penalized likelihood and its oracle properties J. Am. Stat. Assoc. 96 1348-1360
  • [5] Chen X(1993)A statistical view of some chemometrics regression tools Technometrics 35 109-135
  • [6] Guo L(2012)Fast sparse regression and classification Int. J. Forecast. 28 722-738
  • [7] Zhaosong L(1995)Nonlinear image recovery with half-quadratic regularization IEEE Trans. Image Process. 4 932-946
  • [8] Ye JJ(2009)The split Bregman method for L1-regularized problems SIAM J. Imag. Sci. 2 323-343
  • [9] Fan J(2017)A TVSCAD approach for image deblurring with impulsive noise Inverse Prob. 33 125008-208
  • [10] Li R(2017)Weighted nuclear norm minimization and its applications to low level vision Int. J. Comput. Vision 121 183-22