scholarly journals Improved ECG Watermarking Technique Using Curvelet Transform

Sensors ◽  
2020 ◽  
Vol 20 (10) ◽  
pp. 2941 ◽  
Author(s):  
Lalit Mohan Goyal ◽  
Mamta Mittal ◽  
Ranjeeta Kaushik ◽  
Amit Verma ◽  
Iqbaldeep Kaur ◽  
...  

Hiding data in electrocardiogram signals are a big challenge due to the embedded information that can hamper the accuracy of disease detection. On the other hand, hiding data into ECG signals provides more security for, and authenticity of, the patient’s data. Some recent studies used non-blind watermarking techniques to embed patient information and data of a patient into ECG signals. However, these techniques are not robust against attacks with noise and show a low performance in terms of parameters such as peak signal to noise ratio (PSNR), normalized correlation (NC), mean square error (MSE), percentage residual difference (PRD), bit error rate (BER), structure similarity index measure (SSIM). In this study, an improved blind ECG-watermarking technique is proposed to embed the information of the patient’s data into the ECG signals using curvelet transform. The Euclidean distance between every two curvelet coefficients was computed to cluster the curvelet coefficients and after this, data were embedded into the selected clusters. This was an improvement not only in terms of extracting a hidden message from the watermarked ECG signals, but also robust against image-processing attacks. Performance metrics of SSIM, NC, PSNR and BER were used to measure the superiority of presented work. KL divergence and PRD were also used to reveal data hiding in curvelet coefficients of ECG without disturbing the original signal. The simulation results also demonstrated that the clustering method in the curvelet domain provided the best performance—even when the hidden messages were large size.

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.


Author(s):  
Cuizhen Wang ◽  
Zhenxue Chen ◽  
Yan Wang ◽  
Zhifeng Wang

Three-dimensional reconstruction of teeth plays an important role in the operation of living dental implants. However, the tissue around teeth and the noise generated in the process of image acquisition bring a serious impact on the reconstruction results, which must be reduced or eliminated. Combined with the advantages of wavelet transform and bilateral filtering, this paper proposes an image denoising method based on the above methods. The method proposed in this paper not only removes the noise but also preserves the image edge details. The noise in high frequency subbands is denoised using a locally adaptive thresholding and the noise in low frequency subbands is filtered by the bilateral filtering. Peak signal-to-noise ratio (PSNR), structural similarity index measure (SSIM) and 3D reconstruction using the iso-surface extraction method are used to evaluate the denoising effect. The experimental results show that the proposed method is better than the wavelet denoising and bilateral filtering, and the reconstruction results meet the requirements of clinical diagnosis.


2020 ◽  
Vol 9 (4) ◽  
pp. 1461-1467
Author(s):  
Indrarini Dyah Irawati ◽  
Sugondo Hadiyoso ◽  
Yuli Sun Hariyani

In this study, we proposed compressive sampling for MRI reconstruction based on sparse representation using multi-wavelet transformation. Comparing the performance of wavelet decomposition level, which are Level 1, Level 2, Level 3, and Level 4. We used gaussian random process to generate measurement matrix. The algorithm used to reconstruct the image is . The experimental results showed that the use of wavelet multi-level can generate higher compression ratio but requires a longer processing time. MRI reconstruction results based on the parameters of the peak signal to noise ratio (PSNR) and structural similarity index measure (SSIM) show that the higher the level of decomposition in wavelets, the value of both decreases.


Symmetry ◽  
2020 ◽  
Vol 12 (3) ◽  
pp. 378
Author(s):  
Walaa Khalaf ◽  
Ahmad Saeed Mohammad ◽  
Dhafer Zaghar

A novel scheme is presented for image compression using a compatible form called Chimera. This form represents a new transformation for the image pixels. The compression methods generally look for image division to obtain small parts of an image called blocks. These blocks contain limited predicted patterns such as flat area, simple slope, and single edge inside images. The block content of these images represent a special form of data which be reformed using simple masks to obtain a compressed representation. The compression representation is different according to the type of transform function which represents the preprocessing operation prior the coding step. The cost of any image transformation is represented by two main parameters which are the size of compressed block and the error in reconstructed block. Our proposed Chimera Transform (CT) shows a robustness against other transform such as Discrete Cosine Transform (DCT), Wavelet Transform (WT) and Karhunen-Loeve Transform (KLT). The suggested approach is designed to compress a specific data type which are the images, and this represents the first powerful characteristic of this transform. Additionally, the reconstructed image using Chimera transform has a small size with low error which could be considered as the second characteristic of the suggested approach. Our results show a Peak Signal to Noise Ratio (PSNR) enhancement of 2.0272 for DCT, 1.179 for WT and 4.301 for KLT. In addition, a Structural Similarity Index Measure (SSIM) enhancement of 0.1108 for DCT, 0.051 for WT and 0.175 for KLT.


2020 ◽  
Vol 13 (4) ◽  
pp. 10-17
Author(s):  
Fadhil Kadhim Zaidan

In this work, a grayscale image steganography scheme is proposed using a discrete wavelet transform (DWT) and singular value decomposition (SVD). In this scheme, 2-level DWT is applied to a cover image to obtain the high frequency band HL2 which is utilized to embed a secret grayscale image based on the SVD technique. The robustness and the imperceptibility of the proposed steganography algorithm are controlled by a scaling factor for obtaining an acceptable trade-off between them. Peak signal to noise ratio (PSNR) and Structural Similarity Index Measure (SSIM) are used for assessing the efficiency of the proposed approach. Experimental results demonstrate that the proposed scheme still holds its validity under different known attacks such as noise addition, filtering, cropping and JPEG compression


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.


2016 ◽  
Vol 16 (5) ◽  
pp. 109-118
Author(s):  
Xiaolu Xie

Abstract In this paper we propose a new approach for image denoising based on the combination of PM model, isotropic diffusion model, and TV model. To emphasize the superiority of the proposed model, we have used the Structural Similarity Index Measure (SSIM) and Peak Signal to Noise Ratio (PSNR) as the subjective criterion. Numerical experiments with different images show that our algorithm has the highest PSNR and SS1M, as well as the best visual quality among the six algorithms. Experimental results confirm the high performance of the proposed model compared with some well-known algorithms. In a word, the new model outperforms the mentioned three well known algorithms in reducing the Gibbs-type artifacts, edges blurring, and the block effect, simultaneously.


2021 ◽  
Vol 36 (1) ◽  
pp. 642-649
Author(s):  
G. Sharvani Reddy ◽  
R. Nanmaran ◽  
Gokul Paramasivam

Aim: Image is the most powerful tool to analyze the information. Sometimes the captured image gets affected with blur and noise in the environment, which degrades the quality of the image. Image restoration is a technique in image processing where the degraded image can be restored or recovered to its nearest original image. Materials and Methods: In this research Lucy-Richardson algorithm is used for restoring blurred and noisy images using MATLAB software. And the proposed work is compared with Wiener filter, and the sample size for each group is 30. Results: The performance was compared based on three parameters, Power Signal to Noise Ratio (PSNR), Structural Similarity Index Measure (SSIM), Normalized Correlation (NC). High values of PSNR, SSIM and NC indicate the better performance of restoration algorithms. Lucy-Richardson provides a mean PSNR of 10.4086db, mean SSIM of 0.4173%, and NC of 0.7433% and Wiener filter provides a mean PSNR of 6.3979db, SSIM of 0.3016%, NC of 0.3276%. Conclusion: Based on the experimental results and statistical analysis using independent sample T test, image restoration using Lucy-Richardson algorithm significantly performs better than Wiener filter on restoring the degraded image with PSNR (P<0.001) and SSIM (P<0.001).


2020 ◽  
Vol 34 (5) ◽  
pp. 541-551
Author(s):  
Leena Samantaray ◽  
Sabonam Hembram ◽  
Rutuparna Panda

The exploitation capability of the Harris Hawks optimization (HHO) is limited. This problem is solved here by incorporating features of Cuckoo search (CS). This paper proposes a new algorithm called Harris hawks-cuckoo search (HHO-CS) algorithm. The algorithm is validated using 23 Benchmark functions. A statistical analysis is carried out. Convergence of the proposed algorithm is studied. Nonetheless, converting color breast thermogram images into grayscale for segmentation is not effective. To overcome the problem, we suggest an RGB colour component based multilevel thresholding method for breast cancer thermogram image analysis. Here, 8 different images from the Database for Research Mastology with Infrared images are considered for the experiments. Both 1D Otsu’s between-class variance and Kapur's entropy are considered for a fair comparison. Our proposal is evaluated using the performance metrics – Peak Signal to Noise Ratio (PSNR), Feature Similarity Index (FSIM), Structure Similarity Index (SSIM). The suggested method outperforms the grayscale based multilevel thresholding method proposed earlier. Moreover, our method using 1D Otsu’s fitness functions performs better than Kapur’s entropy based approach. The proposal would be useful for analysis of infrared images. Finally, the proposed HHO-CS algorithm may be useful for function optimization to solve real world engineering problems.


Sign in / Sign up

Export Citation Format

Share Document