BDANET: BOOSTED DENSE ATTENTION HIERARCHICAL NETWORK FOR IMAGE DENOISING

被引:0
作者
Jia, Yun [1 ]
Yu, Lidan [1 ]
Zhao, Jie [1 ]
机构
[1] Shandong Technol & Business Univ, Sch Informat & Elect Engn, Yantai 264003, Peoples R China
关键词
Image denoising; U-Net; dense connections; boosting strategy; attention mechanism;
D O I
10.31577/cai_2024_5111
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Deep convolutional networks have been widely applied in image denoising tasks with great success. However, many denoising models extract more feature information by increasing the network depth, which does not fully utilize the shallow features, but also makes it difficult to obtain accurate noise information. In this paper, we introduce a novel modified U-Net structure-based boosted dense attention neural network (BDANet) specifically designed for image denoising. The convolutional block within the encoding layer of BDANet incorporates dense connections and residuals, effectively circumventing the vanishing gradient issue through feature reuse and local residual learning. A boosting strategy is employed in the decoding layer to augment residual information in the noise map. To adeptly process edge details in images, BDANet deploys a polarized self-attentive mechanism to direct the densely connected blocks for depth feature extraction. The network is trained with Gaussian noise at random noise levels in the study to make it flexible to handle images with a wide range of noise levels. In experimental comparisons involving additive Gaussian noise, BDANet outperformed conventional denoising networks and attained competitive results relative to state-of-the-art image denoising networks, with an average improvement of approximately 1.03 dB in terms of PSNR values. Visualization results show that the image after denoising by BDANet network is sharper and richer in texture details than other methods.
引用
收藏
页码:1111 / 1136
页数:26
相关论文
共 59 条
  • [1] NTIRE 2017 Challenge on Single Image Super-Resolution: Dataset and Study
    Agustsson, Eirikur
    Timofte, Radu
    [J]. 2017 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION WORKSHOPS (CVPRW), 2017, : 1122 - 1131
  • [2] 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
  • [3] Boosting with the L2 loss:: Regression and classification
    Bühlmann, P
    Yu, B
    [J]. JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2003, 98 (462) : 324 - 339
  • [4] Burger HC, 2012, PROC CVPR IEEE, P2392, DOI 10.1109/CVPR.2012.6247952
  • [5] A general iterative regularization framework for image denoising
    Charest, Michael R., Jr.
    Elad, Michael
    Milanfar, Peyman
    [J]. 2006 40TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1-4, 2006, : 452 - 457
  • [6] Real-World Image Denoising with Deep Boosting
    Chen, Chang
    Xiong, Zhiwei
    Tian, Xinmei
    Zha, Zheng-Jun
    Wu, Feng
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2020, 42 (12) : 3071 - 3087
  • [7] Deep Boosting for Image Denoising
    Chen, Chang
    Xiong, Zhiwei
    Tian, Xinmei
    Wu, Feng
    [J]. COMPUTER VISION - ECCV 2018, PT XI, 2018, 11215 : 3 - 19
  • [8] Multi-threshold image segmentation using a multi-strategy shuffled frog leaping algorithm
    Chen, Yi
    Wang, Mingjing
    Heidari, Ali Asghar
    Shi, Beibei
    Hu, Zhongyi
    Zhang, Qian
    Chen, Huiling
    Mafarja, Majdi
    Turabieh, Hamza
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2022, 194
  • [9] Trainable Nonlinear Reaction Diffusion: A Flexible Framework for Fast and Effective Image Restoration
    Chen, Yunjin
    Pock, Thomas
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2017, 39 (06) : 1256 - 1272
  • [10] 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