Illumination compensation by using singular value decomposition and discrete wavelet transform

A Modified DWT-SVD Algorithm for T1-w Brain MR Images Contrast Enhancement

This paper presents a new robust hybrid multiple watermarking technique using fusion of discrete wavelet transforms (DWT), discrete cosine transforms (DCT), and singular value decomposition (SVD) instead of applying DWT, DCT and SVD individually or combination of DWT-SVD / DCT-SVD. For identity authentication purposes, multiple watermarks are embedded into the same medical image / multimedia objects simultaneously, which provides extra level of security with acceptable performance in terms of robustness and imperceptibility. In the embedding process, the cover image is decomposed into first level discrete wavelet transforms where the A (approximation/lower frequency sub-band) is transformed by DCT and SVD. The watermark image is also transformed by DWT, DCT and SVD. The S vector of watermark information is embedded in the S component of the cover image. The watermarked image is generated by inverse SVD on modified S vector and original U, V vectors followed by inverse DCT and inverse DWT. The watermark is extracted using an extraction algorithm. Furthermore, the text watermark is embedding at the second level of the D (diagonal sub-band) of the cover image. The security of the text watermark considered as EPR (Electronic Patient Record) data is enhanced by using encryption method before embedding into the cover. The results are obtained by varying the gain factor, size of the text watermark, and cover medical images. The method has been extensively tested and analyzed against known attacks and is found to be giving superior performance for robustness, capacity and reduced storage and bandwidth requirements compared to reported techniques suggested by other authors.

This paper proposes the enhancement of low contrast satellite images based on intensity transformation. The intensity transformation is achieved using gamma correction on discrete wavelet transform (DWT) and the better illumination is achieved by singular value decomposition (SVD) technique. The DWT decomposes the input image in four different frequency sub-bands; low-low (LL), low-high (LH), high-low (HL) and high-high (HH). The gamma correction is applied only on LL sub-band to preserve the edge information. To improve the illumination, these gamma corrected LL sub-band information are passed through SVD. The enhanced image obtained is reconstructed by taking inverse discrete wavelet transform (IDWT). The performance measure is carried out in terms of EME, entropy and signals to noise ratio.

In this paper, a blind image watermarking scheme based on discrete wavelet transform (DWT) and singular value decomposition (SVD) is proposed. In this scheme, DWT is applied on ROI (region of interest) of the medical image to get different frequency subbands of its wavelet decomposition. On the low frequency subband LL of the ROI, block-SVD is applied to get different singular matrices. A pair of elements with similar values is identified from the left singular value matrix of these selected blocks. The values of these pairs are modified using certain threshold to embed a bit of watermark content. Appropriate threshold is chosen to achieve the imperceptibility and robustness of medical image and watermark contents respectively. For authentication and identification of original medical image, one watermark image (logo) and other text watermark have been used. The watermark image provides authentication whereas the text data represents electronic patient record (EPR) for identification. At receiving end, blind recovery of both watermark contents is performed by a similar comparison scheme used during the embedding process. The proposed algorithm is applied on various groups of medical images like X-ray, CT scan and mammography. This scheme offers better visibility of watermarked image and recovery of watermark content due to DWT-SVD combination. Moreover, use of Hamming error correcting code (ECC) on EPR text bits reduces the BER and thus provides better recovery of EPR. The performance of proposed algorithm with EPR data coding by Hamming code is compared with the BCH error correcting code and it is found that later one perform better. A result analysis shows that imperceptibility of watermarked image is better as PSNR is above 43 dB and WPSNR is above 52 dB for all set of images. In addition, robustness of the scheme is better than existing scheme for similar set of medical images in terms of normalized correlation coefficient (NCC) and bit-error-rate (BER). An analysis is also carried out to verify the performance of the proposed scheme for different size of watermark contents (image and EPR data). It is observed from analysis that the proposed scheme is also appropriate for watermarking of color image. Using proposed scheme, watermark contents are extracted successfully under various noise attacks like JPEG compression, filtering, Gaussian noise, Salt and pepper noise, cropping, filtering and rotation. Performance comparison of proposed scheme with existing schemes shows proposed scheme has better robustness against different types of attacks. Moreover, the proposed scheme is also robust under set of benchmark attacks known as checkmark attacks.

Purpose:To design and implement a GPU‐based discrete wavelet transformation (DWT) to be used in medical image reconstruction, image processing, and data compression. DWTs are widely used in medical physics, but the computation of DWTs is time consuming for large volumetric data. An efficient parallel implementation of DWTs is essential for many time sensitive applications, such as 4DCT.Methods:We choose Daubechies wavelet transformations as a benchmark, implementing both DWT and inverse DWT (IDWT). The reference CPU code is from “Numerical Recipes in C”. We implemented GPU‐based codes using C++ with CUDA 7.5. A GPU is specialized processors with a highly parallel structure originally designed for manipulating computer graphics. GPU computation is highly memory‐bounded. To optimize GPU memory access pattern and achieve best performance for transformation along Y‐direction, the data are transposed before and after the DWT (IDWT), which can sharply reduce computing efforts. Both CPU and GPU codes are unit‐tested and the result differences between two implementations are verified to be within rounding error. The hardware platform was a desktop with Intel Xeon E5‐1607 3.00 GHz CPU and NVIDIA Quadro K2000 GPU.Results:With the GPU implemented code, we process a medical CT image size of 512×512×256 in 0.5 seconds, which is 60 times faster than the CPU implementation. A naive non‐optimized GPU implementation by direct parallelization approaches only 10 times speedup for 2‐D and 3‐D DWT and IDWT. In comparison, the optimization of GPU memory access pattern can obtain an extra 6x speedup.Conclusion:We developed an efficient implementation of GPU‐based DWT/IDWT for medical image processing. To achieve the best performance of any medical imaging processing algorithm, developers should pay attention to memory access pattern optimization when implementing on GPU architecture.This project is supported by CPRIT grant under RP150485.

The Discrete Wavelet Transform (DWT) is a signal processing technique popularised by its results in data compression. Considerable work has been done in designing novel architectures to perform the DWT, including a systolic architecture designed by the authors, but little attention has been given to the inverse DWT which is needed in applications such as data compression for signal reconstruction. Despite the fact that the inverse DWT is computationally the reverse of the DWT, the hardware design for the architecture is not simply mirrored. Existing designs expect the architecture for the inverse DWT to be a simple follow-on step from the DWT design, however this is not the case. We present one such problem here, showing the FIFO buffering required on the input of the inverse architecture. We show how the size of this buffer can be calculated and compare it to a fixed data array implementation. This work is based on our systolic array design and is an integral part of the inverse DWT design we are working on for image and video compression.

This paper proposes a new watermarking algorithm based on the shuffled singular value decomposition and the visual cryptography for copyright protection of digital images. It generates the ownership and identification shares of the image based on visual cryptography. It decomposes the image into low and high frequency sub-bands. The low frequency sub-band is further divided into blocks of same size after shuffling it and then the singular value decomposition is applied to each randomly selected block. Shares are generated by comparing one of the elements in the first column of the left orthogonal matrix with its corresponding element in the right orthogonal matrix of the singular value decomposition of the block of the low frequency sub-band. The experimental results show that the proposed scheme clearly verifies the copyright of the digital images, and is robust to withstand several image processing attacks. Comparison with the other related visual cryptography-based algorithms reveals that the proposed method gives better performance. The proposed method is especially resilient against the rotation attack.

In this paper, we proposed a novel watermarking scheme based on adaptive quantization index modulation and singular value decomposition in the hybrid discrete wavelet transform (DWT) and discrete cosine transform (DCT). The secret watermark bits are embedded on the singular values vector of blocks within low frequency subband in host image hybrid DWT-DCT domain. To embed watermark imperceptibly, robustly and securely, we model the adaptive quantization steps by utilizing human visual system (HVS) characteristics and particle swarm optimization (PSO) algorithm. Experimental results demonstrate that the proposed scheme is robust to variety of image processing attacks. In the proposed algorithm the quantized embedding strategy is adopted, so no host image is needed for blind extraction of watermarking image.

In this paper, a new robust and secure video watermarking scheme based on discrete Wavelet Transform (DWT), singular value decomposition (SVD), and Laplacian pyramid is proposed for copyright protection applications. The main contributions of this work are: 1) Increasing watermark robustness towards common signal processing attacks by separating the watermark image into a high-frequency image and a low-frequency image using laplacian pyramid. Then, the singular values of each of the low-frequency watermark image and the high-frequency watermark image are hidden in two different DWT subbands of the original video frame. Separating the watermark and hiding its two parts in two different subbands of the DWT of the video frame makes it robust towards noise, filtering, and compression attacks. 2) Improving the quality of the extracted watermarks via correcting the received watermarked videos using SURF points when those videos are geometrically attacked, mainly by rotation, scaling, and shear attacks. 3) Increasing security and avoiding false positive problems (FPP) associated with SVD by using perceptual image hashing in the proposed scheme. Through experimental results and comparisons to other techniques, the proposed scheme has shown very high imperceptibility for the tested watermarked videos in terms of peak signal to noise ratio (PSNR). Also, the proposed scheme has demonstrated high watermark robustness towards various types of attacks, and an improvement in the quality of the extracted watermarks from 4 to 20 dB compared to other techniques.

Most Discrete Wavelet Transform(DWT)/Singular Value Decomposition(SVD) watermark methods are robust to common attacks, such as loss compression, noise and filtering attacks, but they cannot resist geometrical attacks. As Scale Invariant Feature Transform(SIFT) feature points are invariant to rotation, scaling and translation, a blind DWT-SVD watermark method against geometrical attacks based on SIFT is proposed. The square of the inscribed circle of the host image matrix is chosen as the watermark embedding area. Firstly, the watermark embedding area is decomposed with 1-level DWT and the low-frequency sub-band is divided into non-overlapping blocks; then the SVD is applied to every block. Secondly, the watermark is embedded by quantifying the maximum singular value of each block. Finally, SIFT feature points of the watermarked image are saved to detect and correct possible geometrical attacks. The experimental results show that the proposed method not only has the robustness to any angle of rotation attacks, wide range of scaling attacks and translation attacks, but also can achieve blind extraction.

Singular value decomposition (SVD) is a valuable transform technique used in watermarking applications. Instead of using singular values (SV) to embed the watermark as in other SVD based methods, the reference of the original image is obtained from truncated SVD by using some of the singular values, and the watermarking is done according to difference of the original and its reference image. The method is compared with discrete wavelet transform (DWT) based approach and its performance against some attacks is discussed.

In this work, we have proposed a new image contrast enhancement technique based on complex wavelet transform (CWT) and singular value decomposition (SVD). The technique decomposes the input image into the eight frequency subbands by using CWT and estimates the singular value matrix of the real and complex low-low subbands, and then it reconstructs the enhanced image by applying the inverse CWT (ICWT). The technique is compared with the conventional image equalization techniques such as standard general histogram equalization (GHE) and local histogram equalization (LHE), as well as state-of-art technique such as Brightness Preserving Dynamic Histogram Equalization (BPDHE) and singular value equalization (SVE). The experimental results are showing the superiority of the proposed method over the conventional and the state-of-art techniques.

The clinical assistant diagnosis has a high requirement for the visual effect of medical images. However, the low frequency subband coefficients obtained by the NSCT decomposition are not sparse, which is not conducive to maintaining the details of the source image. To solve these problems, a medical image fusion algorithm combined with sparse representation and pulse coupling neural network is proposed. First, the source image is decomposed into low and high frequency subband coefficients by NSCT transform. Secondly, the K singular value decomposition (K-SVD) method is used to train the low frequency subband coefficients to get the overcomplete dictionary D, and the orthogonal matching pursuit (OMP) algorithm is used to sparse the low frequency subband coefficients to complete the fusion of the low frequency subband sparse coefficients. Then, the pulse coupling neural network (PCNN) is excited by the spatial frequency of the high frequency subband coefficients, and the fusion coefficients of the high frequency subband coefficients are selected according to the number of ignition times. Finally, the fusion medical image is reconstructed by NSCT inverter. The experimental results and analysis show that the algorithm of gray and color image fusion is about 34% and 10% higher than the contrast algorithm in the edge information transfer factor QAB/F index, and the performance of the fusion result is better than the existing algorithm.

In this article, a new contrast enhancement approach is presented for quality enhancement of low-contrast satellite images. The proposed technique is based on the Artificial Bee Colony (ABC) algorithm using Discrete Wavelet Transform and Singular Value Decomposition (DWT-SVD). The method employs the ABC technique to learn the parameters of the adaptive thresholding function required for optimum enhancement. In this approach, the input image is primarily decomposed into four sub-bands through DWT, and then each sub-band of DWT is optimized through the ABC algorithm. After that, a singular value matrix of the low–low thresholded sub-band image is estimated and, finally, the enhanced image is constructed by applying inverse DWT. The results obtained through this method reveal that the proposed methodology gives better performance in terms of peak signal-to-noise ratio (PSNR), mean square error (MSE), and mean and standard deviation as compared to General Histogram Equalization (GHE), Discrete Cosine Transform and Singular Value Decomposition (DCT-SVD), DWT-SVD, Particle Swarm Optimization (PSO), and modified versions of the PSO-based enhancement approach.

In this paper, we propose a new super-resolution technique based on interpolation of the high-frequency subband images obtained by discrete wavelet transform (DWT) and the input image. The proposed technique uses DWT to decompose an image into different subband images. Then the high-frequency subband images and the input low-resolution image have been interpolated, followed by combining all these images to generate a new super-resolved image by using inverse DWT. The proposed technique has been tested on Lena, Elaine, Pepper, and Baboon. The quantitative peak signal-to-noise ratio (PSNR) and visual results show the superiority of the proposed technique over the conventional and state-of-art image resolution enhancement techniques. For Lena's image, the PSNR is 7.93 dB higher than the bicubic interpolation.