Adaptive iterative global image denoising method based on SVD

被引:2
作者
Liu, Yepeng [1 ,2 ]
Li, Xuemei [1 ,3 ]
Guo, Qiang [4 ,5 ]
Zhang, Caiming [1 ,3 ,5 ]
机构
[1] Shandong Univ, Sch Software, Jinan 250101, Peoples R China
[2] Shandong Technol & Business Univ, Sch Comp Sci & Technol, Yantai 264005, Peoples R China
[3] Shandong Coinnovat Ctr Future Intelligent Comp, Yantai 264025, Peoples R China
[4] Shandong Univ Finance & Econ, Sch Comp Sci & Technol, Jinan 250014, Peoples R China
[5] Digital Media Technol Key Lab Shandong Prov, Jinan 250014, Peoples R China
关键词
image denoising; iterative methods; image classification; singular value decomposition; matrix algebra; video signal processing; image restoration; SVD; image self-similarity; similar image patch matrix; multiscale similarity measure; video restoration; target recognition; adaptive iterative global image denoising; PSNR; FSIM; SPARSE; DICTIONARY; ALGORITHM; MODEL;
D O I
10.1049/iet-ipr.2020.0082
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Based on the image self-similarity and singular value decomposition (SVD) techniques, the authors propose an iterative adaptive global denoising method. For the structural differences between image patches, they adaptively determine the size of the search window. In each window, a similar image patch matrix is constructed based on the multi-scale similarity measure. In order to ensure the speed of the method, the adaptive step size and the number of image patches are introduced, and all image patches are denoised in different iterations. This not only ensures the speed of the method, suppresses residual noise, but also reduces the artefacts caused by the fixed step size and the number of image patches. Therefore, the problem of image denoising is converted to the estimation of low-rank matrix. New singular values are estimated according to the noise level, and similar image patch matrices without noise are estimated using them and corresponding singular vectors. Experimental results show that compared with the state-of-the-art denoising algorithms, this method has a higher PSNR and FSIM, and has a good visual effect. The new method can be applied to image and video restoration, target recognition and image classification.
引用
收藏
页码:3028 / 3038
页数:11
相关论文
共 39 条
  • [1] K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
    Aharon, Michal
    Elad, Michael
    Bruckstein, Alfred
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) : 4311 - 4322
  • [2] [Anonymous], 2018, P IEEE C COMP VIS PA
  • [3] A non-local algorithm for image denoising
    Buades, A
    Coll, B
    Morel, JM
    [J]. 2005 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 2, PROCEEDINGS, 2005, : 60 - 65
  • [4] An Efficient Noisy Pixels Detection Model for CT Images using Extreme Learning Machines
    Caliskan, Abidin
    Cevik, Ulus
    [J]. TEHNICKI VJESNIK-TECHNICAL GAZETTE, 2018, 25 (03): : 679 - 686
  • [5] Patch-Based Near-Optimal Image Denoising
    Chatterjee, Priyam
    Milanfar, Peyman
    [J]. IEEE TRANSACTIONS ON IMAGE PROCESSING, 2012, 21 (04) : 1635 - 1649
  • [6] Dabov K., 2009, BM3D IMAGE DENOISING
  • [7] Image denoising by sparse 3-D transform-domain collaborative filtering
    Dabov, Kostadin
    Foi, Alessandro
    Katkovnik, Vladimir
    Egiazarian, Karen
    [J]. IEEE TRANSACTIONS ON IMAGE PROCESSING, 2007, 16 (08) : 2080 - 2095
  • [8] Non-local Methods with Shape-Adaptive Patches (NLM-SAP)
    Deledalle, Charles-Alban
    Duval, Vincent
    Salmon, Joseph
    [J]. JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2012, 43 (02) : 103 - 120
  • [9] Nonlocally Centralized Sparse Representation for Image Restoration
    Dong, Weisheng
    Zhang, Lei
    Shi, Guangming
    Li, Xin
    [J]. IEEE TRANSACTIONS ON IMAGE PROCESSING, 2013, 22 (04) : 1618 - 1628
  • [10] Nonlocal Image Restoration With Bilateral Variance Estimation: A Low-Rank Approach
    Dong, Weisheng
    Shi, Guangming
    Li, Xin
    [J]. IEEE TRANSACTIONS ON IMAGE PROCESSING, 2013, 22 (02) : 700 - 711