A Nonlocal Image Denoising Algorithm Using the Structural Similarity Metric

2019 ◽  
Vol 45 (4) ◽  
pp. 141-146 ◽  
Author(s):  
A. A. Dovganich ◽  
A. S. Krylov
Keyword(s):  
Image Denoising ◽  
Structural Similarity ◽  
Similarity Metric

scholarly journals GPR B-Scan Image Denoising via Multi-Scale Convolutional Autoencoder with Data Augmentation

Electronics ◽  
2021 ◽  
Vol 10 (11) ◽  
pp. 1269
Author(s):  
Jiabin Luo ◽  
Wentai Lei ◽  
Feifei Hou ◽  
Chenghao Wang ◽  
Qiang Ren ◽  
...  
Keyword(s):  
Image Denoising ◽  
Data Augmentation ◽  
Noise Suppression ◽  
Random Noise ◽  
Similarity Index ◽  
Structural Similarity ◽  
Training Dataset ◽  
Generative Adversarial Network ◽  
Multi Scale ◽  
Convolutional Autoencoder

Ground-penetrating radar (GPR), as a non-invasive instrument, has been widely used in civil engineering. In GPR B-scan images, there may exist random noise due to the influence of the environment and equipment hardware, which complicates the interpretability of the useful information. Many methods have been proposed to eliminate or suppress the random noise. However, the existing methods have an unsatisfactory denoising effect when the image is severely contaminated by random noise. This paper proposes a multi-scale convolutional autoencoder (MCAE) to denoise GPR data. At the same time, to solve the problem of training dataset insufficiency, we designed the data augmentation strategy, Wasserstein generative adversarial network (WGAN), to increase the training dataset of MCAE. Experimental results conducted on both simulated, generated, and field datasets demonstrated that the proposed scheme has promising performance for image denoising. In terms of three indexes: the peak signal-to-noise ratio (PSNR), the time cost, and the structural similarity index (SSIM), the proposed scheme can achieve better performance of random noise suppression compared with the state-of-the-art competing methods (e.g., CAE, BM3D, WNNM).

scholarly journals A Multi-Scale Feature Extraction-Based Normalized Attention Neural Network for Image Denoising

Electronics ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 319
Author(s):  
Yi Wang ◽  
Xiao Song ◽  
Guanghong Gong ◽  
Ni Li
Keyword(s):  
Neural Network ◽  
Feature Extraction ◽  
Image Denoising ◽  
Color Image ◽  
Rapid Development ◽  
Similarity Index ◽  
Structural Similarity ◽  
Convolutional Network ◽  
Scale Feature ◽  
Multi Scale

Due to the rapid development of deep learning and artificial intelligence techniques, denoising via neural networks has drawn great attention due to their flexibility and excellent performances. However, for most convolutional network denoising methods, the convolution kernel is only one layer deep, and features of distinct scales are neglected. Moreover, in the convolution operation, all channels are treated equally; the relationships of channels are not considered. In this paper, we propose a multi-scale feature extraction-based normalized attention neural network (MFENANN) for image denoising. In MFENANN, we define a multi-scale feature extraction block to extract and combine features at distinct scales of the noisy image. In addition, we propose a normalized attention network (NAN) to learn the relationships between channels, which smooths the optimization landscape and speeds up the convergence process for training an attention model. Moreover, we introduce the NAN to convolutional network denoising, in which each channel gets gain; channels can play different roles in the subsequent convolution. To testify the effectiveness of the proposed MFENANN, we used both grayscale and color image sets whose noise levels ranged from 0 to 75 to do the experiments. The experimental results show that compared with some state-of-the-art denoising methods, the restored images of MFENANN have larger peak signal-to-noise ratios (PSNR) and structural similarity index measure (SSIM) values and get better overall appearance.

Image Denoising Using Sparse Representation and Principal Component Analysis

2021 ◽  
pp. 2250033
Author(s):  
Maryam Abedini ◽  
Horriyeh Haddad ◽  
Marzieh Faridi Masouleh ◽  
Asadollah Shahbahrami
Keyword(s):  
Principal Component Analysis ◽  
Sparse Representation ◽  
Image Denoising ◽  
Matching Pursuit ◽  
Signal To Noise Ratio ◽  
Principal Component ◽  
Structural Similarity ◽  
Component Analysis ◽  
Block Matching ◽  
Discrete Wavelet

This study proposes an image denoising algorithm based on sparse representation and Principal Component Analysis (PCA). The proposed algorithm includes the following steps. First, the noisy image is divided into overlapped [Formula: see text] blocks. Second, the discrete cosine transform is applied as a dictionary for the sparse representation of the vectors created by the overlapped blocks. To calculate the sparse vector, the orthogonal matching pursuit algorithm is used. Then, the dictionary is updated by means of the PCA algorithm to achieve the sparsest representation of vectors. Since the signal energy, unlike the noise energy, is concentrated on a small dataset by transforming into the PCA domain, the signal and noise can be well distinguished. The proposed algorithm was implemented in a MATLAB environment and its performance was evaluated on some standard grayscale images under different levels of standard deviations of white Gaussian noise by means of peak signal-to-noise ratio, structural similarity indexes, and visual effects. The experimental results demonstrate that the proposed denoising algorithm achieves significant improvement compared to dual-tree complex discrete wavelet transform and K-singular value decomposition image denoising methods. It also obtains competitive results with the block-matching and 3D filtering method, which is the current state-of-the-art for image denoising.

A compensating total variation image denoising model combining L1 and L2 norm

2020 ◽  
pp. 002072092092330
Author(s):  
Liqiong Zhang ◽  
Min Li ◽  
Xiaohua Qiu
Keyword(s):  
Image Denoising ◽  
Total Variation ◽  
Structural Information ◽  
Signal To Noise Ratio ◽  
Similarity Index ◽  
Structural Similarity ◽  
Isotropic Diffusion ◽  
Model Combining ◽  
L2 Norm ◽  
Staircase Effect

To overcome the “staircase effect” while preserving the structural information such as image edges and textures quickly and effectively, we propose a compensating total variation image denoising model combining L1 and L2 norm. A new compensating regular term is designed, which can perform anisotropic and isotropic diffusion in image denoising, thus making up for insufficient diffusion in the total variation model. The algorithm first uses local standard deviation to distinguish neighborhood types. Then, the anisotropic diffusion based on L1 norm plays the role of edge protection in the strong edge region. The anisotropic and the isotropic diffusion simultaneously exist in the smooth region, so that the weak textures can be protected while overcoming the “staircase effect” effectively. The simulation experiments show that this method can effectively improve the peak signal-to-noise ratio and obtain the higher structural similarity index and the shorter running time.

Based on Local Structural Similarity Image Denoising Algorithm

2013 ◽  
Vol 756-759 ◽  
pp. 3313-3317
Author(s):  
Ze Hua Zhou ◽  
Wei Tang Zhang
Keyword(s):  
Image Processing ◽  
Image Denoising ◽  
Information Source ◽  
Structural Similarity ◽  
Redundant Information ◽  
Research Focus ◽  
Edge Information ◽  
Search Area ◽  
Computer Image Processing ◽  
And Storage

The image is a kind of important information source, through the image processing can help people understand the connotation of the information. However, the image in the process of generation and transmission by all kinds of the noise, the information processing, transfer and storage caused tremendous influence. So the image denoising always all is the computer image processing and computer in the vision of a research focus. Proposed an algorithm of image denoising based on the local structural similarity. Which utilizes the redundant information, and by establishing a similar function to the search area calculation of point and to pixels similarity of weights, and then to the search area at the weighted, obtained the last to pixels gray value varies. This algorithm in texture, of the edge information denoising ways than the current many denoising algorithm are excellent.

scholarly journals New model for local fractional integral of Chebyshev polynomials for image denoising

2019 ◽  
pp. 22-28
Author(s):  
Suzan J Obaiys ◽  
Hamid A Jalab ◽  
Rabha W Ibrahim
Keyword(s):  
Image Denoising ◽  
Chebyshev Polynomials ◽  
Fractional Integral ◽  
Signal To Noise Ratio ◽  
Similarity Index ◽  
Structural Similarity ◽  
Input Image ◽  
Convolution Product ◽  
Local Fractional Integral ◽  
Image Pixels

The use of local fractional calculus has increased in different applications of image processing. This study proposes a new algorithm for image denoising to remove Gaussian noise in digital images. The proposed algorithm is based on local fractional integral of Chebyshev polynomials. The proposed structures of the local fractional windows are obtained by four masks created for x and y directions. On four directions, a convolution product of the input image pixels with the local fractional mask window has been performed. The visual perception and peak signal-to-noise ratio (PSNR) with the structural similarity index (SSIM) are used as image quality measurements. The experiments proved that the accomplished filtering results are better than the Gaussian filter. Keywords: local fractional; Chebyshev polynomials; Image denoising

Sign in / Sign up

Export Citation Format

Share Document