scholarly journals Spatiotemporal Video Denoising Based on Adaptive Thresholding and Clustering

2017 ◽  
Vol 2017 ◽  
pp. 1-11
Author(s):  
Ali Abdullah Yahya ◽  
Jieqing Tan ◽  
Benyu Su ◽  
Kui Liu ◽  
Ali Naser Hadi

In this paper we propose a novel video denoising method based on adaptive thresholding and K-means clustering. In the proposed method the adaptive thresholding is applied rather than the conventional hard-thresholding of the VBM3D method. The adaptive thresholding has a high ability to adapt and change according to the amount of noise. More specifically, hard-thresholding is applied on the higher noise areas while soft-thresholding is applied on the lower noise areas. Consequently, we can successfully remove the noise effectively and at the same time preserve the edges of the image, because the clustering approach saves more computation time and is more capable of finding relevant patches than the block-matching approach. So, the K-means clustering method in the final estimate in this paper is adopted instead of the block-matching method in the VBM3D method in order to restrict the search of the candidate patches within the region of the reference patch and therefore improve the grouping. Experimental results emphasize the superiority of the new method over the reference methods in terms of visual quality, Peak Signal-to-Noise Ratio (PSNR), and Image Enhancement Factor (IEF). Execution time of the proposed algorithm consumes less time in denoising than that in the VBM3D algorithm.

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Chenglin Zuo ◽  
Yu Liu ◽  
Xin Tan ◽  
Wei Wang ◽  
Maojun Zhang

We propose a video denoising method based on a spatiotemporal Kalman-bilateral mixture model to reduce the noise in video sequences that are captured with low light. To take full advantage of the strong spatiotemporal correlations of neighboring frames, motion estimation is first performed on video frames consisting of previously denoised frames and the current noisy frame by using block-matching method. Then, current noisy frame is processed in temporal domain and spatial domain by using Kalman filter and bilateral filter, respectively. Finally, by weighting the denoised frames from Kalman filtering and bilateral filtering, we can obtain a satisfactory result. Experimental results show that the performance of our proposed method is competitive when compared with state-of-the-art video denoising algorithms based on both peak signal-to-noise-ratio and structural similarity evaluations.


2021 ◽  
Author(s):  
Mina Sharifymoghaddam

Image denoising is an inseparable pre-processing step of many image processing algorithms. Two mostly used image denoising algorithms are Nonlocal Means (NLM) and Block Matching and 3D Transform Domain Collaborative Filtering (BM3D). While BM3D outperforms NLM on variety of natural images, NLM is usually preferred when the algorithm complexity is an issue. In this thesis, we suggest modified version of these two methods that improve the performance of the original approaches. The conventional NLM uses weighted version of all patches in a search neighbourhood to denoise the center patch. However, it can include some dissimilar patches. Our first contribution, denoted by Similarity Validation Based Nonlocal Means (NLM-SVB), eliminates some of those unnecessary dissimilar patches in order to improve the performance of the algorithm. We propose a hard thresholding pre-processing step based on the exact distribution of distances of similar patches. Consequently, our method eliminates about 60% of dissimilar patches and improves NLM in terms of Peak Signal to Noise Ratio (PSNR) and Stracuteral Similarity Index Measure (SSIM). Our second contribution, denoted by Probabilistic Weighting BM3D (PW-BM3D), is the result of our thorough study of BM3D. BM3D consists of two main steps. One is finding a basic estimate of the noiseless image by hard thresholding coefficients. The second one is using this estimate to perform wiener filtering. In both steps the weighting scheme in the aggregation process plays an important role. The current weighting process depends on the variance of retrieved coefficients after denoising which results in a biased weighting. In PW-BM3D, we propose a novel probabilistic weighting scheme which is a function of the probability of similarity of noiseless patches in each 3D group. The results show improvement over BM3D in terms of PSNR for an average of about 0.2dB.


2021 ◽  
Author(s):  
Mina Sharifymoghaddam

Image denoising is an inseparable pre-processing step of many image processing algorithms. Two mostly used image denoising algorithms are Nonlocal Means (NLM) and Block Matching and 3D Transform Domain Collaborative Filtering (BM3D). While BM3D outperforms NLM on variety of natural images, NLM is usually preferred when the algorithm complexity is an issue. In this thesis, we suggest modified version of these two methods that improve the performance of the original approaches. The conventional NLM uses weighted version of all patches in a search neighbourhood to denoise the center patch. However, it can include some dissimilar patches. Our first contribution, denoted by Similarity Validation Based Nonlocal Means (NLM-SVB), eliminates some of those unnecessary dissimilar patches in order to improve the performance of the algorithm. We propose a hard thresholding pre-processing step based on the exact distribution of distances of similar patches. Consequently, our method eliminates about 60% of dissimilar patches and improves NLM in terms of Peak Signal to Noise Ratio (PSNR) and Stracuteral Similarity Index Measure (SSIM). Our second contribution, denoted by Probabilistic Weighting BM3D (PW-BM3D), is the result of our thorough study of BM3D. BM3D consists of two main steps. One is finding a basic estimate of the noiseless image by hard thresholding coefficients. The second one is using this estimate to perform wiener filtering. In both steps the weighting scheme in the aggregation process plays an important role. The current weighting process depends on the variance of retrieved coefficients after denoising which results in a biased weighting. In PW-BM3D, we propose a novel probabilistic weighting scheme which is a function of the probability of similarity of noiseless patches in each 3D group. The results show improvement over BM3D in terms of PSNR for an average of about 0.2dB.


2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Shengnan Zhang ◽  
Lei Wang ◽  
Chunhong Chang ◽  
Cong Liu ◽  
Longbo Zhang ◽  
...  

To overcome the disadvantages of the traditional block-matching-based image denoising method, an image denoising method based on block matching with 4D filtering (BM4D) in the 3D shearlet transform domain and a generative adversarial network is proposed. Firstly, the contaminated images are decomposed to get the shearlet coefficients; then, an improved 3D block-matching algorithm is proposed in the hard threshold and wiener filtering stage to get the latent clean images; the final clean images can be obtained by training the latent clean images via a generative adversarial network (GAN).Taking the peak signal-to-noise ratio (PSNR), structural similarity (SSIM for short) of image, and edge-preserving index (EPI for short) as the evaluation criteria, experimental results demonstrate that the proposed method can not only effectively remove image noise in high noisy environment, but also effectively improve the visual effect of the images.


2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Chengzhi Ruan ◽  
Dean Zhao ◽  
Weikuan Jia ◽  
Chen Chen ◽  
Yu Chen ◽  
...  

In order to improve the image denoising ability, the wavelet transform (WT) and independent component analysis (ICA) are both introduced into image denoising in this paper. Although these two algorithms have their own advantages in image denoising, they are unable to reduce noises completely, which makes it difficult to achieve ideal effect. Therefore, a new image denoising method is proposed based on the combination of WT with ICA (WT-ICA). For verifying the WT-ICA denoising method, we adopt four image denoising methods for comparison: median filtering (MF), wavelet soft thresholding (WST), ICA, and WT-ICA. From the experimental results, it is shown that WT-ICA can significantly reduce noises and get lower-noise image. Moreover, the average of WT-ICA denoising image’s peak signal to noise ratio (PSNR) is improved by 20.54% compared with noisy image and 11.68% compared with the classical WST denoising image, which demonstrates its advantage. From the performance of texture and edge detection, denoising image by WT-ICA is closer to the original image. Therefore, the new method has its unique advantage in image denoising, which lays a solid foundation for the realization of further image processing task.


2021 ◽  
Vol 11 (2) ◽  
pp. 673
Author(s):  
Guangli Ben ◽  
Xifeng Zheng ◽  
Yongcheng Wang ◽  
Ning Zhang ◽  
Xin Zhang

A local search Maximum Likelihood (ML) parameter estimator for mono-component chirp signal in low Signal-to-Noise Ratio (SNR) conditions is proposed in this paper. The approach combines a deep learning denoising method with a two-step parameter estimator. The denoiser utilizes residual learning assisted Denoising Convolutional Neural Network (DnCNN) to recover the structured signal component, which is used to denoise the original observations. Following the denoising step, we employ a coarse parameter estimator, which is based on the Time-Frequency (TF) distribution, to the denoised signal for approximate estimation of parameters. Then around the coarse results, we do a local search by using the ML technique to achieve fine estimation. Numerical results show that the proposed approach outperforms several methods in terms of parameter estimation accuracy and efficiency.


2014 ◽  
Vol 556-562 ◽  
pp. 6328-6331
Author(s):  
Su Zhen Shi ◽  
Yi Chen Zhao ◽  
Li Biao Yang ◽  
Yao Tang ◽  
Juan Li

The LIFT technology has applied in process of denoising to ensure the imaging precision of minor faults and structure in 3D coalfield seismic processing. The paper focused on the denoising process in two study areas where the LIFT technology is used. The separation of signal and noise is done firstly. Then denoising would be done in the noise data. The Data of weak effective signal that is from the noise data could be blended with the original effective signal to reconstruct the denoising data, so the result which has high signal-to-noise ratio and preserved amplitude is acquired. Thus the fact shows that LIFT is an effective denoising method for 3D seismic in coalfield and could be used widely in other work area.


Author(s):  
Maryam Abedini ◽  
Horriyeh Haddad ◽  
Marzieh Faridi Masouleh ◽  
Asadollah Shahbahrami

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.


2021 ◽  
Author(s):  
Ching-Yu Yang ◽  
Wen-Fong Wang

Abstract In this work, we present an improved steganography for electrocardiogram (ECG) hosts to solve the issues of existing ECG steganographic methods, which have less hiding capacity and insufficient signal-to-noise ratio (SNR)/ peak SNR (PSNR). Based on the integer wavelet transform (IWT) domain, sensitive (or private) data such as patients’ data and personal information can be efficiently embedded in an ECG host via the IWT coefficient adjustment and the least significant bit (LSB) technique. Simulations confirmed that the SNR/ PSNR, and payload of the proposed method outperform those of existing techniques. In addition, the proposed method is capable of resisting attacks, such as cropping, Gaussian noise-addition inversion, scaling, translation, and truncation attacks from third parties (or adversaries). Due to the fast computation time, the proposed method can be employed in portable biometric devices or wearable electronics.


Sign in / Sign up

Export Citation Format

Share Document