基于小波变换和矢量量化的人脸图像压缩

提出一种新的在小波域内进行矢量量化的算法.该算法在对图像进行多级小波变换后,构造三个方向的跨频带矢量,同时采用分类矢量量化,非线性插补矢量量化和基于人眼视觉特性的加权矢量量化,提高了图像的编码效率和重构质量.仿真结果表明,该算法实现简单,在较低的编码率下,可达到较好的压缩效果.     

基于小波系数相对模糊关系的水印方法

提出一种基于带参数整数小波变换和相对小波系数模糊关系的数字水印算法.应用基于视觉系统小波域量化噪声的视觉权重分析方法,自适应的构造模糊关系矩阵,在水印的提取过程中实现了盲检测.本方法与经典的密码理论以及高级加密算法相结合.应用Rabin方法生成单向Hash函数,信息隐藏算法可以完全公开.水印算法不可感知性好,鲁棒性强,是一种有效的版权保护方法.     

一种利用多通道小波变换去噪的算法

通过对多通道小波和小波变换以及奇异信号的小波变换特性的讨论和分析,提出了一种利用M道小波变换去噪的算法,并利用此算法对加噪信号进行了模拟实验,实验结果表明,该算法简便,易于编程实现且去噪效果理想。     

基于小波变换的Laws纹理测度在植被分割中的应用

针对从全色航空影像中进行植被区域提取的随机性和复杂性,阐述了一种基于小波的Laws纹理测度进行植被提取的新算法,它的特点是先用小波变换将图像变换到不同的尺度层上,然后再在多尺度层上提取Laws纹理测度,形成植被区域的特征.与传统的植被提取方法比,它用到了不同频率上纹理的Laws信息,从而更准确的刻画了植被区域的纹理特征,试验结果表明:基于小波变换的Laws纹理测度对植被有较好的分割效果.     

一种新的信号处理方法——线调频小波变换

线调频小波变换是处理非平稳信号一种新的方法 .本文分析了线调频小波变换是短时 Fourier变换和小波变换的时频分析的统一形式 ,并能根据信号的特点生成新的时频分析方法 ,说明了线调频小波变换具有传统处理方法无法比拟的优点     

正交小波变换的向量空间算法

本文揭示了一个事实，小波不仅可构成Ｌ２空间中的正交基，小波分解与重构滤波还可产生Ｎ维空间中的正交基．在本文提出修改的小波变换算法之下，Ｎ点信号的小波变换等价于Ｎ维空间中的正交变换．用该算法进行信号或图象压缩，无需对信号或图象进行周期延拓，可严格地在Ｎ维空间中进行．     

多小波图像插值算法研究

与单小波变换一样,多小波变换同样具有多分辨分析的特性,1次多小波变换可以将图像分解成4个低频子带和12个高频子带,而且原图像的大小是每个子带的4倍.根据多小波变换的这一特点,利用原图像与经过1次多小波变换后的各高频子带的信息,并考虑各子带的分形维数,提出了一种新颖的灰度图像插值算法.实验结果表明,与传统的插值算法相比,例如双线性插值与双三次多项式插值,该算法的插值效果较好,且克服了单小波插值中出现的斑点干扰.     

基于小波变换的信号奇异性分析

本文研究得出了用小波变换进行奇异性检测时的小波基的一些选取原则和检测算法，并应用实例予以验证，从而证明了这些原则的有效性，为小波变换在奇异性检测中的实践运用奠定了一定的理论基础．     

声表面波式小波变换器件的波形失真问题研究

声表面波式小波变换器件的误差主要包括两个方面:一个是小波变换算法本身产生的误差;另一个是声表面波换能器产生的误差,而引起后者误差的主要因素是声表面波式小波变换器件输入输出叉指的波形失真问题.该研究针对引起声表面波式小波变换器件波形失真的4类问题,对4种误差来源做出分析,最终针对波形失真的不同产生原因提出减小误差的具体解决方法.     

傅立叶变换与小波变换的比较教学

本文针对小波变换教学中小流变换概念理解困难的问题，提出了一种比较教学方法，通过分析小波变换与傅立叶变换之间的联系，并从四个方面进行对比，清楚地描述了小波变换的本质，从而对加深对小波变换的理解。     

Wavelet Image Compressor—MinImage

Nowadays, still images are used everywhere in the digital world. The shortages of storage capacity and transmission bandwidth make efficient compression solutions essential. A revolutionary mathematics tool, wavelet transform, has already shown its power in image processing. MinImage, the major topic of this paper, is an application that compresses still images by wavelets. MinImage is used to compress grayscale images and true color images. It implements the wavelet transform to code standard BMP image files to LET wavelet image files, which is defined in MinImage. The code is written in C++ on the Microsoft Windows NT platform. This paper illustrates the design and implementation details in Min-Image according to the image compression stages. First, the preprocessor generates the wavelet transform blocks. Second, the basic wavelet decomposition is applied to transform the image data to the wavelet coefficients. The discrete wavelet transforms are the kernel component of MinImage and are discussed in detail. The different wavelet transforms can be plugged in to extend the functionality of MinImage. The third step is the quantization. The standard scalar quantization algorithm and the optimized quantization algorithm, as well as the dequantization, are described. The last part of MinImage is the entropy-coding schema. The reordering of the coefficients based on the Peano Curve and the different entropy coding methods are discussed. This paper also gives the specification of the wavelet compression parameters adjusted by the end user. The interface, parameter specification, and analysis of MinImage are shown in the final appendix.     

Fractal compression coding based on wavelet transform with diamond search

In this paper, a fractal image compression coding scheme based on wavelet transform with diamond search is proposed. The goal is to offer fast positioning. According to search pattern and search path of diamond search, the proposed scheme just needs to search in the domain blocks in the fixed place around the range blocks. Our proposed method has benefits in reducing the search time and enhancing the coding speed compared with other image compression techniques.     

具有一定消失矩的优化线性相位滤波器

利用消失矩特性和编码误差最小,给出了一类有限长线性相位的双正交小波滤波器组BNVF的构造方法,BNVF的综合低通和分解高通的系数为二进分数,将其用于图像的分解与重构时,可避免一些乘法运算．三组BNVF用于图像变换编码时,其压缩性能不亚于Cohen,Daubechies等构造的9／7步滤波器组CDF-9／7,且计算复杂度更低．     

Image inpainting using complex 2-D dual-tree wavelet transform

The dual-tree complex wavelet transform is a useful tool in signal and image processing. In this paper, we propose a dual-tree complex wavelet transform (CWT) based algorithm for image inpainting problem. Our approach is based on Cai, Chan, Shen and Shen’s framelet-based algorithm. The complex wavelet transform outperforms the standard real wavelet transform in the sense of shift-invariance, directionality and anti-aliasing. Numerical results illustrate the good performance of our algorithm.     

An ultra-fast smoothing algorithm for time–frequency transforms based on Gabor functions

Gabor functions, Gaussian wave packets, are optimally localized in time and frequency, and thus in principle ideal as (frame) basis functions for a wavelet, windowed Fourier or wavelet-packet transform for the detection of events in noisy signals or for data compression. A major obstacle for their use is that a tailored efficient operator acting on the transform coefficients for altering the width of the wave packets does not exist. However, by virtue of a curious property of the Gabor functions it is possible to change the width of the wave packets using just one-dimensional convolutions with very short kernels. The cost of a wavelet-type transform based on the scheme presented below is similar to that of a low order wavelet transform for a compact kernel and significantly less than the algorithme à trous. The scheme can hence easily be employed for the processing of signals in real time.     

Fast Wavelet Transform for Toeplitz Matrices and Property Analysis

Fast wavelet transform algorithms for Toeplitz matrices are proposed in this paper. Distinctive from the well known discrete trigonometric transforms, such as the discrete cosine transform （DCT） and the discrete Fourier transform （DFT） for Toeplitz matrices, the new algorithms are achieved by compactly supported wavelet that preserve the character of a Toeplitz matrix after transform, which is quite useful in many applications involving a Toeplitz matrix. Results of numerical experiments show that the proposed method has good compression performance similar to using wavelet in the digital image coding. Since the proposed algorithms turn a dense Toeplitz matrix into a band-limited form, the arithmetic operations required by the new algorithms are O（N） that are reduced greatly compared with O（N log N） by the classical trigonometric transforms.     

Sparse representation based down-sampling image compression

In this paper, we give an analytical model of the compression error of down-sampled compression based on wavelet transform, which explains why down-sampling before compression can improve coding performance. And we approximate the missing details due to down-sampling and compression by using the linear combination of a set of basis vectors with L₁ norm. Then we propose a down-sampled and high frequency information approximated coding scheme and apply it to natural images, and achieve gains of both subjective quality and objective quality compared with JPEG2000.     

Inverse radon transform with one-dimensional wavelet transform

1. IntroductionSince Radon obtained the inverse formula of Radon transform in 1917, different inversemethods such as Fourier inversion, convolution back-projection inversion etc. have beeninvestigated['l']. Wavelet as a useful tool is interested in the inversion of Radon transformin recent years['--']. The application of wavelet analysis to Radon transform was proposedin I4] and [5]. An inversion formula based on continuous wavelet transform was derivedin [6] and [7]. This formula was based…