[1]XU Jiucheng,WANG Nan,WANG Yuyao,et al.Non-convex weighted-Lp-norm sparse-error constraint for image denoising[J].CAAI Transactions on Intelligent Systems,2019,14(3):500-507.[doi:10.11992/tis.201804057]
Copy
CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume:
14
Number of periods:
2019 3
Page number:
500-507
Column:
学术论文—机器感知与模式识别
Public date:
2019-05-05
- Title:
-
Non-convex weighted-Lp-norm sparse-error constraint for image denoising
- Author(s):
-
XU Jiucheng1; 2; WANG Nan1; 2; WANG Yuyao1; 2; XU Zhanwei1; 2
-
1. College of Computer and Information Engineering, He’nan Normal University, Xinxiang 453007, China;
2. Engineering Technology Research Center for Computing Intelligence and Data Mining in Colleges and University of He’nan Province, Xinxiang 453007, C
-
- Keywords:
-
image denoising; sparse representation; sparse coefficient; prior knowledge; l1 norm; non-convex weighted lp norm; sparse error constraint; peak signal-to-noise ratio
- CLC:
-
TP391
- DOI:
-
10.11992/tis.201804057
- Abstract:
-
Due to noise during image denoising, it is difficult to learn accurate prior knowledge. Therefore, obtaining a desirable sparse coefficient proves to be difficult. To solve this problem, this paper proposes an image denoising method based on the non-convex weighted-lp-norm sparse-error constraint. This algorithm decomposes the coefficient-solving process into two sub-problems. First, the algorithm solves the sparse coefficient in the lp norm by the generalized soft threshold value algorithm and then uses the surrogate algorithm to solve the sparse coefficient in the sparse-error constraint. Finally, the algorithm obtains a robust sparse coefficient according to its average value. The experimental results show that the proposed algorithm features a high peak signal-to-noise ratio and high efficiency in terms of the running time. Simultaneously, a desirable visual perception is obtained.