共 33 条
Impulse Noise Image Restoration Using Nonconvex Variational Model and Difference of Convex Functions Algorithm
被引:3
作者:
Zhang, Benxin
[1
]
Zhu, Guopu
[2
]
Zhu, Zhibin
[3
]
Zhang, Hongli
Zhou, Yicong
[4
]
Kwong, Sam
[5
]
机构:
[1] Guilin Univ Elect Technol, Sch Elect Engn & Automat, Guilin 541004, Peoples R China
[2] Harbin Inst Technol, Sch Cyberspace Secur, Harbin 150001, Peoples R China
[3] Guilin Univ Elect Technol, Sch Math & Comp Sci, Guilin 541004, Peoples R China
[4] Univ Macau, Dept Comp & Informat Sci, Macau, Peoples R China
[5] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Peoples R China
基金:
中国国家自然科学基金;
关键词:
Difference of convex functions algorithm (DCA);
image restoration;
impulse noise;
nonconvex optimization model;
SPARSE SIGNAL;
EFFICIENT;
D O I:
10.1109/TCYB.2022.3225525
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
this article, the problem of impulse noise image restoration is investigated. A typical way to eliminate impulse noise is to use an L1 norm data fitting term and a total variation (TV) regularization. However, a convex optimization method designed in this way always yields staircase artifacts. In addition, the L1 norm fitting term tends to penalize corrupted and noise free data equally, and is not robust to impulse noise. In order to seek a solution of high recovery quality, we propose a new variational model that integrates the nonconvex data fitting term and the nonconvex TV regularization. The usage of the nonconvex TV regularizer helps to eliminate the staircase artifacts. Moreover, the nonconvex fidelity term can detect impulse noise effectively in the way that it is enforced when the observed data is slightly corrupted, while is less enforced for the severely corrupted pixels. A novel difference of convex functions algorithm is also developed to solve the variational model. Using the variational method, we prove that the sequence generated by the proposed algorithm converges to a stationary point of the nonconvex objective function. Experimental results show that our proposed algorithm is efficient and compares favorably with state-of-the-art methods. f
引用
收藏
页码:2257 / 2270
页数:14
相关论文