一种基于双正交小流变换和格型矢量量化的视频编码算法

本文提出了基于双正交小流变换和格型矢量量化的视频编码算法，在该方案中，小波变换将图像分解成多分辩率的子带图像，多分辩率运动估值技术实现子带图像的帧间预测，格型徉量量化对预测差值子带图像进行编码，从而获得了性能较好的活动图像编码新算法。     

一种多分辨率图像混合编码方案

本文提出一种基于小波变换与神经网络的多分辨率图像混合编码方案，利用小波分解对图像的多分辨率表示来消除图像空间域和频率域的相关性，由于小波图像相邻行之间的复杂关系难以用线性表示式来描述，使用多层神经网络（ＭＬＮＮ）来确定这种未知关系。实验证明，神经网络非线性预测器性能优于线性预测器，对非线性预测后的差值图像用自组织特征映射（ＳＯＦＭ）码书进行矢量量化（ＶＱ）编码，编码图像主观质量好，压缩比高，算法简     

基于四叉树分割量化与关联模型的图像编码算法

本文以整型提升小波变换和SPIHT编码算法为基础，提出了一种基于四叉树分割量化与关联模型的新图像编码算法，该算法的基本工作步骤为：(1)对原图像进行整型提升小波变换，以得到不同分辨率不同方向的多个图像子带；(2)对最低频子带进行DPCM编码，对高频子带进行四叉树分割量化编码；(3)采用关联模型完成最后的算术编码。对比实验表明：本文算法在编解码速度、图像复原质量等方面均优于SPIHT等算法。     

基于塔式格型矢量量化的图像多描述编码算法

多描述编码(MDC)是解决差错信道上图像通信数据包丢失问题的一种新方法，它通过将图像分解为多个独立而又具有一定相关性的描述，并通过不同的信道进行传输，来改善数据丢失条件下的图像解码质量。本文提出了一种图像信号的多描述塔式格型矢量量化编码算法(MDPLVQ)，利用小波树之间的独立性，采用不同的塔式格型矢量量化缩放因子对小波系数进行量化。该算法设计简单，对冗余度的控制容易，实验结果说明了其有效性，其编码压缩性能优于多描述标量量化(MDSQ)、多描述对变换(MDPCT)和多描述零又树(MDEZW)等方法。     

基于小波变换的空间约束矢量量化方法

图像的小波变换能同时提供空间－频率局部化信息，而且小波变换域内矢量量化数据压缩已得到广泛应用，经过小波变换后，各子带小波分量存在相关性和空间约束，同时考虑到人类视觉对水平和垂直方向高频分量比对角方向更加敏感，本文提出了基于空间约束的矢量量化方法，该算法能同时提高编码效率和改善重构图像质量。     

一种基于小波的多光谱图像压缩方法

文章提出一种基于Karhunen2Loeve变换(KLT)和小波量化编码的多光谱图像压缩方法。该法首先使用KL变换步骤来去除谱间冗余,而后对各变换波段图像进行小波变换,并利用均匀阈值网格编码量化方法来量化小波子带图像,最后使用算术编码对量化结果进行熵编码。为使编码器能为所有谱段各子带获取率- 失真意义上最优的量化阈值,本文提出基于子带图像统计特性和网格编码量化器率- 失真特性的比特分配算法。实验表明,本方法能高效地压缩多光谱图像,表现出优异的压缩性能。     

自适应格型预测语音了带编码

提出了一种自适应格型预测带编码的语音编码方法，该方法在输入语音作了带分解的基础上，用自适应格型预测的方法对低频子带进行编码，用矢量量化的方法以高频子带进行编码，在相同码率的情况下，提高了编码的量化信噪比，改善了重建语音的质量。     

图像多小波域矢量量化策略

提出一种基于多小波变换结合矢量量化的图像编码算法(MDWT VQ)。首先对图像进行多小波分解,然后对高频系数用改进后的LBG算法形成的码书进行VQ编码。算法充分利用了多小波域不同分辨率层间各方向子图像的相似性,仅对最高分辨率层进行码书地址索引,低级分辨率层的系数按照一定的组织形式直接套用最高分辨率层的地址索引信息。对比实验的结果验证了该算法在提高图像的重建质量以及在降低位码率方面均比传统的单小波图像编码算法有一定的提高。     

基于BWT和FVQ的极低比特率图像编码算法

该文提出了一种基于双正交小波变换（ＢＷＴ）和模糊矢量量化（ＦＶＱ）的极低比特率图像编码算法。该算法通过构造符合图像小波变换系数特征的跨频带矢量,充分利用了不同频带小波系数之间的相关性,有效地提高了图像的编码效率和重构质量。     

基于方向树结构矢量分类的小波图像网格编码矢量量化

本文提出了采用方向树结构矢量组合并分类对小波图像进行网格编码矢量量化（ＴＣＶＱ）的新方法。该方法矢量构成结合了子带系数的方向性，充分利用了子带系数带间和带内相关性，按能量和活跃度进行两级分类，降低了类中矢量的内部离散度，对活跃和非活跃类矢量实行加权ＴＣＶＱ，利用卷积编码扩展信号空间，用维特比算法搜索最优量化序列，比使用加权 ＶＱ提高了 ０．７ｄｂ左右。该方法编码计算复杂度适中，解码简单，有较好的压缩效果。     

Pyramidal lattice vector quantization for multiscale image coding

Introduces a new image coding scheme using lattice vector quantization. The proposed method involves two steps: biorthogonal wavelet transform of the image, and lattice vector quantization of wavelet coefficients. In order to obtain a compromise between minimum distortion and bit rate, we must truncate and scale the lattice suitably. To meet this goal, we need to know how many lattice points lie within the truncated area. We investigate the case of Laplacian sources where surfaces of equal probability are spheres for the L(1) metric (pyramids) for arbitrary lattices. We give explicit generating functions for the codebook sizes for the most useful lattices like Z(n), D(n), E(s), wedge(16).     

FIR filter banks for hexagonal data processing

Images are conventionally sampled on a rectangular lattice. Thus, traditional image processing is carried out on the rectangular lattice. The hexagonal lattice was proposed more than four decades ago as an alternative method for sampling. Compared with the rectangular lattice, the hexagonal lattice has certain advantages which include that it needs less sampling points; it has better consistent connectivity and higher symmetry; the hexagonal structure is also pertinent to the vision process. In this paper, we investigate the construction of symmetric FIR hexagonal filter banks for multiresolution hexagonal image processing. We obtain block structures of FIR hexagonal filter banks with 3-fold rotational symmetry and 3-fold axial symmetry. These block structures yield families of orthogonal and biorthogonal FIR hexagonal filter banks with 3-fold rotational symmetry and 3-fold axial symmetry. In this paper, we also discuss the construction of orthogonal and biorthogonal FIR filter banks with scaling functions and wavelets having optimal smoothness. In addition, we present a few of such orthogonal and biorthogonal FIR filters banks.     

Orthogonal and Biorthogonal $sqrt 3$-Refinement Wavelets for Hexagonal Data Processing

The hexagonal lattice was proposed as an alternative method for image sampling. The hexagonal sampling has certain advantages over the conventionally used square sampling. Hence, the hexagonal lattice has been used in many areas. A hexagonal lattice allows radic3, dyadic and radic7 refinements, which makes it possible to use the multiresolution (multiscale) analysis method to process hexagonally sampled data. The radic3-refinement is the most appealing refinement for multiresolution data processing due to the fact that it has the slowest progression through scale, and hence, it provides more resolution levels from which one can choose. This fact is the main motivation for the study of radic3-refinement surface subdivision, and it is also the main reason for the recommendation to use the radic3-refinement for discrete global grid systems. However, there is little work on compactly supported radic3 -refinement wavelets. In this paper, we study the construction of compactly supported orthogonal and biorthogonal radic3-refinement wavelets. In particular, we present a block structure of orthogonal FIR filter banks with twofold symmetry and construct the associated orthogonal radic3-refinement wavelets. We study the sixfold axial symmetry of perfect reconstruction (biorthogonal) FIR filter banks. In addition, we obtain a block structure of sixfold symmetric radic3-refinement filter banks and construct the associated biorthogonal wavelets.     

基于全相位反余弦双正交变换的JPEG图像压缩技术

提出了一种新型的基于全相位反余弦双正交变换(APIDCBT)的JPEG图像压缩技术,APIDCBT矩阵是一种新型的变换矩阵,给出它的具体形式,提出了双正交变换与对偶双正交基向量的概念.通过与传统的离散余弦变换(DCT)进行比较,表明了APIDCBT算法可以不用量化表,节省运算时间,与DCT可达到同样的压缩效果,并且在低码率情况下优于DCT.     

MIMO biorthogonal partners and applications

Multiple input multiple output (MIMO) biorthogonal partners arise in many different contexts, one of them being multiwavelet theory. They also play a central role in the theory of MIMO channel equalization, especially with fractionally spaced equalizers. In this paper, we first derive some theoretical properties of MIMO biorthogonal partners. We develop conditions for the existence of MIMO biorthogonal partners and conditions under which FIR solutions are possible. In the process of constructing FIR MIMO biorthogonal partners, we exploit the nonuniqueness of the solution. This will lead to the design of flexible fractionally spaced MIMO zero-forcing equalizers. The additional flexibility in design makes these equalizers more robust to channel noise. Finally, other situations where MIMO biorthogonal partners occur are also considered, such as prefiltering in multiwavelet theory and deriving the vector version of the least squares signal projection problem     

Construction of Arbitrary Dimensional Biorthogonal Multiwavelet Using Lifting Scheme

This paper focuses on the construction of multidimensional biorthogonal multiwavelets and the perfect reconstruction multifilter banks. Based on the Hermite-Neville filter, two lifting structures have been proposed and systematically investigated, and a general design framework has been developed for building biorthogonal multiwavelets and Hermite interpolation filter banks with any multiplicity for any lattice in any dimension with any number of primal and dual vanishing moments. The construction is an important generalization of the Neville-based lifting scheme and inherits all of the advantages of lifting schemes such as fast transform, in-place computation and integer-to-integer transforms. Our multi wavelet systems preserve most of the desirable properties for applications, such as interpolating, short support, symmetry, and high vanishing moments.     

Compactly supported orthogonal and biorthogonal square root 5-refinement wavelets with 4-fold symmetry

Recently, square root 5 -refinement hierarchical sampling has been studied and square root 5-refinement has been used for surface subdivision. Compared with other refinements, such as the dyadic or quincunx refinement, square root 5-refinement has a special property that the nodes in a refined lattice form groups of five nodes with these five nodes having different x and y coordinates. This special property has been shown to be very useful to represent adaptively and render complex and procedural geometry. When square root 5-refinement is used for multiresolution data processing, square root 5-refinement filter banks and wavelets are required. While the construction of 2-D nonseparable (bi)orthogonal wavelets with the dyadic or quincunx refinement has been studied by many researchers, the construction of (bi)orthogonal wavelets with square root 5-refinement has not been investigated. The main goal of this paper is to construct compactly supported orthogonal and biorthogonal wavelets with square root 5 -refinement. In this paper, we obtain block structures of orthogonal and biorthogonal square root 5-refinement FIR filter banks with 4-fold rotational symmetry. We construct compactly supported orthogonal and biorthogonal wavelets based on these block structures.     

Compactly Supported Orthogonal and Biorthogonal $sqrt 5$-Refinement Wavelets With 4-Fold Symmetry

Recently, radic5 -refinement hierarchical sampling has been studied and radic5-refinement has been used for surface subdivision. Compared with other refinements, such as the dyadic or quincunx refinement, radic5-refinement has a special property that the nodes in a refined lattice form groups of five nodes with these five nodes having different x and y coordinates. This special property has been shown to be very useful to represent adaptively and render complex and procedural geometry. When radic5-refinement is used for multiresolution data processing, radic5-refinement filter banks and wavelets are required. While the construction of 2-D nonseparable (bi)orthogonal wavelets with the dyadic or quincunx refinement has been studied by many researchers, the construction of (bi)orthogonal wavelets with radic5-refinement has not been investigated. The main goal of this paper is to construct compactly supported orthogonal and biorthogonal wavelets with radic5 -refinement. In this paper, we obtain block structures of orthogonal and biorthogonal radic5-refinement FIR filter banks with 4-fold rotational symmetry. We construct compactly supported orthogonal and biorthogonal wavelets based on these block structures.     

Overload vector quantisation by selective shell projection inlattice VQ

An efficient overload vector quantisation algorithm is proposed for lattice vector quantisation (LVQ). It selects a projection shell for each overload vector by changing its scaled position along the radial direction to the origin in the truncated lattice and obtains the adjusted overload scaling factor for dequantisation from the orthogonality principle. Experimental results show that this algorithm achieves a good performance in signal to quantisation noise ratio (SQNR) over the conventional algorithm using a single projection of the overload vector on the external shell     

Coherent detection of biorthogonal signals over Rayleigh fadingchannels

A practical coherent detection scheme for biorthogonal signals over Rayleigh fading channels is proposed. The proposed scheme improves the bit error rate (BER) performance compared to the noncoherent detection schemes for biorthogonal signals. It also outperforms the coherent and noncoherent detection schemes for orthogonal signals with comparable bandwidth efficiency. The BER performance for a Rayleigh fading channel with two path diversity combining is obtained by computer simulation. The results show that the required average signal-to-noise ratio per bit γ_b can be reduced by as much as 1.4 dB when we use this system in the CDMA cellular reverse link