Discrete Wavelet Transform on Consumer-Level Graphics Hardware

Discrete wavelet transform (DWT) has been heavily studied and developed in various scientific and engineering fields. Its multiresolution and locality nature facilitates applications requiring progressiveness and capturing high-frequency details. However, when dealing with enormous data volume, its performance may drastically reduce. On the other hand, with the recent advances in consumer-level graphics hardware, personal computers nowadays usually equip with a graphics processing unit (GPU) based graphics accelerator which offers SIMD-based parallel processing power. This paper presents a SIMD algorithm that performs the convolution-based DWT completely on a GPU, which brings us significant performance gain on a normal PC without extra cost. Although the forward and inverse wavelet transforms are mathematically different, the proposed algorithm unifies them to an almost identical process that can be efficiently implemented on GPU. Different wavelet kernels and boundary extension schemes can be easily incorporated by simply modifying input parameters. To demonstrate its applicability and performance, we apply it to wavelet-based geometric design, stylized image processing, texture-illuminance decoupling, and JPEG2000 image encoding     

Fermi架构下的时域高斯滤波并行算法

为提高图形图像处理中高斯滤波算法模块的计算速度,将高斯滤波与Fermi平台相结合,设计了一种高斯滤波时域的并行算法。数据测试结果显示,与基于CPU的实现相比,采用Fermi架构的GPU处理不仅可以得到误差精度小于0.0001的计算结果,而且可以取得较大的加速效果。在数据规模为512×112×128和滤波窗口大小为11的情况下能够达到约210倍的加速效果。     

Three‐dimensional thinning algorithms on graphics processing units and multicore CPUs

Three‐dimensional curve skeletons are a very compact representation of three‐dimensional objects with many uses and applications in fields such as computer graphics, computer vision, and medical imaging. An important problem is that the calculation of the skeleton is a very time‐consuming process. Thinning is a widely used technique for calculating the curve skeleton because of the properties it ensures and the ease of implementation. In this paper, we present parallel versions of a thinning algorithm for efficient implementation in both graphics processing units and multicore CPUs. The parallel programming models used in our implementations are Compute Unified Device Architecture (CUDA) and Open Computing Language (OpenCL). The speedup achieved with the optimized parallel algorithms for the graphics processing unit achieves 106.24x against the CPU single‐process version and more than 19x over the CPU multithreaded version. Copyright © 2011 John Wiley & Sons, Ltd.     

CUDA体系结构上的一层浅水系统的模拟

对于使用支持NVIDACUDA程序设计模型的GPU的二维一层浅水系统,给出了如何加速平衡性良好的有限体积模式的数值解,同时给出并实现了在单双浮点精度下使用CUDA模型利用潜在数据并行的算法。数值实验表明,CUDA体系结构的求解程序比CPU并行实现求解程序高效。     

Secure and imperceptible digital image steganographic algorithm based on diamond encoding in DWT domain

This paper presents a new efficient embedding algorithm in the wavelet domain of digital images based on the diamond encoding (DE) scheme. Current discrete wavelet transform (DWT) steganography adds an unacceptable distortion to the images and is considered as an ineffective in terms of security. Applying the DE scheme to the current DWT steganographic methods solves the problems of these methods, and reduces the distortion added to the images, and thus improves the embedding efficiency. The proposed algorithm first converts the secret image into a sequence of base-5 digits. After that, the cover image is transformed into the DWT domain and segmented into 2?×?1 coefficient pairs. The DE scheme is used then to change at most one coefficient of each coefficient pair to embed the base-5 digits. Experimental results depict that the proposed algorithm is more efficient in embedding compared to other methods in terms of embedding payload and image quality. Moreover, the proposed algorithm is attacked by well-known steganalysis software. Results are showing that the proposed algorithm is secure against the powerful universal steganalyzer “ensemble classifier” and the histogram attack. The results also reveal that the proposed algorithm is robust against different image processing attacks such as compression, added noise, and cropping attacks.     

基于Fibonacci置乱的小波域数字图像盲水印算法

针对数字图像的版权保护问题,提出一种基于Fibonacci置乱的小波域数字图像盲水印方案。将原图像中的感兴趣区域(ROI)作为水印来源,以此提高水印的隐蔽性。在水印嵌入过程中,将原图像进行分块,对每个块进行Fibonacci置乱和离散小波变换(DWT),选择出低频子带,用于水印嵌入。同时,对水印也执行DWT,选择出低频子带,通过Fibonacci置乱得到置乱矩阵,将水印的置乱矩阵嵌入到主图像的块中。在水印提取过程中,根据嵌入过程中设定的秘钥,通过逆Fibonacci置乱和逆DWT过程提取水印。在多种图像攻击下的仿真结果表明,该水印方案具有较高的安全性、鲁棒性和隐蔽性。     

图像小波分解的FPGA实现

小波分析作为信号处理领域中的一种重要方法,在信号处理、模式分析和图像处理等方面得到了广泛的应用。然而小波变换巨大的运算量却使得它在实时处理领域中的应用受到了限制。本文根据离散小波变换的Mallat算法,提出了一种EPGA实现高速小波分解的方法,设计出的小波变换模块结构清晰而且规则,易于级联,可实现多级变换。同时,,运算精度和处理速度均满足实时图像处理的要求。     

Robust watermarking based on DWT and nonnegative matrix factorization

This paper presents a novel blind robust digital image watermarking scheme using nonnegative matrix factorization (NMF) in DWT domain. Firstly, the original image is transformed into some subband coefficients using discrete wavelet transformation (DWT), and then a Gaussian pseudo-random watermark sequence is embedded in the factorized decomposition coefficients using NMF. Because of the multiresolution decomposition for DWT and physically meaningful factorization for NMF, the proposed scheme can achieve good robustness, which is also demonstrated in the following experiments.     

GPU-based anisotropic diffusion algorithm for video image denoising

Image filtering is the process of removing noise which perturbs image analysis methods. In some applications like segmentation, denoising is intended to smooth homogeneous areas while preserving the contours. Real-time denoising is required in a lot of applications like image-guided surgical interventions, video analysis and visual serving. This paper presents an anisotropic diffusion method named the Oriented Speckle Reducing Anisotropic Diffusion (OSRAD) filter. The OSRAD works very well for denoising images with speckle noise. However, this filter has a powerful computational complexity and is not suitable for real time implementation. The purpose of this study is to decrease the processing time implementation of the OSRAD filter using a parallel processor through the optimization of the graphics processor unit. The results show that the suggested method is very effective for real-time video processing. This implementation yields a denoising video rate of 25 frames per second for 128 × 128 pixels. The proposed model magnifies the acceleration of the image filtering to 30 × compared to the standard implementation of central processing units (CPU). A quantitative comparison measure is given by parameters like the mean structural similarity index, the peak signal-to-noise ratio and the figure of merit. The modified filter is faster than the conventional OSRAD and keeps a high image quality compared to the bilateral filter and the wavelet transformation.     

Parallel Implementation of the 2D Discrete Wavelet Transform on Graphics Processing Units: Filter Bank versus Lifting

The widespread usage of the discrete wavelet transform (DWT) has motivated the development of fast DWT algorithms and their tuning on all sorts of computer systems. Several studies have compared the performance of the most popular schemes, known as filter bank scheme (FBS) and lifting scheme (LS), and have always concluded that LS is the most efficient option. However, there is no such study on streaming processors such as modern Graphics Processing Units (GPUs). Current trends have transformed these devices into powerful stream processors with enough flexibility to perform intensive and complex floating-point calculations. The opportunities opened up by these platforms, as well as the growing popularity of the DWT within the computer graphics field, make a new performance comparison of great practical interest. Our study indicates that FBS outperforms LS in current-generation GPUs. In our experiments, the actual FBS gains range between 10 percent and 140 percent, depending on the problem size and the type and length of the wavelet filter. Moreover, design trends suggest higher gains in future-generation GPUs.     

基于3维提升可分离小波变换的图像水印方案

鲁棒水印技术通常被用于版权保护和所有权声明等目的。许多提出的水印方案通常把水印嵌入在变换域内,如2维的DFT域、DCT域和DWT域以及3维的DCT域、WT域。前3个域主要被用于2维的图像载体,而后2个域主要被用于3维的视频载体和3维的图像载体。在本文中,一种基于3维提升可分离小波(3-D SWT)的灰度图像水印方案被提出。首先,通过之字扫描把灰度图像分解为3维的图像序列,然后使用3-D SWT变换这些图像序列。同时通过相对熵理论证明了3-D SWT变换系数符合广义高斯分布。为了平衡鲁棒性和不可感知性,新的适用于3维的人类视觉模型被重构并用于调整水印的嵌入强度。在水印的检测方面,最优检测器实现水印的盲检测。实验表明本方案对各种攻击是强鲁棒的。     

基于模糊聚类的小波域数字图像水印算法*

结合人眼视觉系统的感知特性与图像的局部相关特性,提出了一种基于模糊聚类的小波域数字图像水印嵌入方案.该方案首先对原始载体图像实施小波变换;然后结合视觉感知特性,在小波域内进行模糊C-均值(FCM)聚类分析,自适应确定出数字水印的嵌入位置与嵌入强度;最后利用图像自身的局部相关性,通过修改小波系数值,将数字水印嵌入到宿主图像内.该方案在提取数字水印信息时,不需要原始载体图像.实验结果表明,该自适应小波域图像水印嵌入技术不仅具有较好的透明性,而且对诸如叠加噪声、JPEG压缩、平滑滤波、几何剪切、图像增强、马赛克效果等攻击均具有较好的鲁棒性.     

超光谱图像的三维小波嵌入零块压缩编码

超光谱图像作为一种三维图像,其海量的数据导致在有限带宽信道上传输和存储非常困难,必须对它进行有效的压缩编码.提出了一种基于非对称三维小波变换(3D wavelet transform,简称3DWT)和三维集合块分裂的超光谱遥感图像压缩方法.因为大多数超光谱图像在各个方向上具有非对称的统计特性,所以利用非对称三维小波变换去除图像的谱间和空间冗余.与传统的对称三维小波变换相比,非对称的三维小波变换能够更有效地去除相邻谱段间的冗余.提出了一种改进的3DSPECK(3D set partitioning embedded block)算法--非对称三维集合分裂块算法(asymmetric transform 3DSPECK,简称AT-3DSPECK),并被用于编码变换后的系数.根据变换系数的能量分布特点,三维零块分裂和三维octave子带分裂方法被有效地结合在所提出的AT-3DSPECK算法中.为了优化率失真和加速编码速度,也给出了一种零块优化排序的快速算法.实验测试表明:AT-3DSPECK算法的平均PSNR(peak signal to noise ratio)分别比AT-3DSPIHT(asymmetric transform 3D set partitioning in hierarchical trees)和3DSPECK算法高0.4dB和1.4dB.此外,AT-3DSPECK还具有比零树算法更快的编码速度.     

基于FPGA的高性能离散小波变换设计

针对db8(Daubechies 8)小波设计了高速正、反变换系统,用DE2开发板进行了系统验证。正、反变换的最高时钟频率分别达到217.72 MHz和217.58 MHz。对比同类文献中的设计,本设计在最高处理速度方面具有明显优势。基于此,考虑通用性,还设计了一种通用小波变换FPGA架构。该架构通用性强,可高性能实现多种小波变换。采用DA算法、LUT结构、流水线技术等对设计进行了优化。     

基于PDF417和提升小波的数字图像水印算法

根据PDF417与提升小波变换的特点,提出一种基于PDF417和提升小波变换的数字图像水印算法。首先将水印信息进行PDF417编码,并在密钥控制下进行混沌序列置乱后得到二值水印图像;最后使用小波提升技术对原始图像进行小波三级变换,在小波变换域低频子带中嵌入二值水印图像。实验结果证明：该算法能很好地保持图像质量,对常见的图像处理具有很强的鲁棒性,同时不仅能保持传统小波多分辨率图像水印的优势,而且处理速度更快,对图像尺寸没有特殊要求。     

Simulation of shallow-water systems using graphics processing units

This paper addresses the speedup of the numerical solution of shallow-water systems in 2D domains by using modern graphics processing units (GPUs). A first order well-balanced finite volume numerical scheme for 2D shallow-water systems is considered. The potential data parallelism of this method is identified and the scheme is efficiently implemented on GPUs for one-layer shallow-water systems. Numerical experiments performed on several GPUs show the high efficiency of the GPU solver in comparison with a highly optimized implementation of a CPU solver.     

A new robust reference watermarking scheme based on DWT-SVD

This paper presents a new semi-blind reference watermarking scheme based on discrete wavelet transform(DWT) and singular value decomposition(SVD) for copyright protection and authenticity. We are using a gray scale logo image as watermark instead of randomly generated Gaussian noise type watermark. For watermark embedding, the original image is transformed into wavelet domain and a reference sub-image is formed using directive contrast and wavelet coefficients. We embed watermark into reference image by modifying the singular values of reference image using the singular values of the watermark. A reliable watermark extraction scheme is developed for the extraction of watermark from distorted image. Experimental evaluation demonstrates that the proposed scheme is able to withstand a variety of attacks. We show that the proposed scheme also stands with the ambiguity attack also.     

基于提升框架的实时视频降噪方法

针对基于离散小波变换的视频降噪方法难于实时处理的问题,提出了一种基于提升框架的可实时处理的视频降噪方法。首先,对每帧图像利用提升框架进行多级小波分解,得到尺度系数和小波系数;然后,对不同层次的小波系数采用软阈值收缩方法进行滤波;小波逆变换后,利用时间域滤波方法进一步提高降噪效果。实验结果表明,该方法具有较好的实时性和去噪效果。     

Fast Gabor texture feature extraction with separable filters using GPU

Gabor wavelet transform is one of the most effective texture feature extraction techniques and has resulted in many successful practical applications. However, real-time applications cannot benefit from this technique because of the high computational cost arising from the large number of small-sized convolutions which require over 10 min to process an image of 256 × 256 pixels on a dual core CPU. As the computation in Gabor filtering is parallelizable, it is possible and beneficial to accelerate the feature extraction process using GPU. Conventionally, this can be achieved simply by accelerating the 2D convolution directly, or by expediting the CPU-efficient FFT-based 2D convolution. Indeed, the latter approach, when implemented with small-sized Gabor filters, cannot fully exploit the parallel computation power of GPU due to the architecture of graphics hardware. This paper proposes a novel approach tailored for GPU acceleration of the texture feature extraction algorithm by using separable 1D Gabor filters to approximate the non-separable Gabor filter kernels. Experimental results show that the approach improves the timing performance significantly with minimal error introduced. The method is specifically designed and optimized for computing unified device architecture and is able to achieve a speed of 16 fps on modest graphics hardware for an image of 256² pixels and a filter kernel of 32² pixels. It is potentially applicable for real-time applications in areas such as motion tracking and medical image analysis.     

Fermi架构下超声成像组织运动可视化并行算法

在临床超声实时成像系统中组织运动情况是医生想要获取的重要诊断信息, 例如心脏运动. 基于线积分卷积的二维矢量场可视化技术可以同时展现运动矢量场的强度和方向. 但这一算法在处理时涉及大量的复杂计算, 尤其是流线追踪处理部分, 使其成为临床实时成像系统中的一大性能提升瓶颈. 为此研究并提出了一种基于新兴的高性能并行计算平台Fermi架构GPU(graphics processing unit图形处理单元)的并行运动可视化算法. 数据测试结果显示, 与基于CPU的实现相比, 采用Fermi架构的GPU处理不仅可