具有线性相位的4带正交滤波器的参数化

该文得到了具有线性相位的4带正交尺度滤波器的参数化形式,同时给出了构造相应的小波滤波器的一个简单的构造方法.应用所给出的参数化形式,得到了具有紧支撑的对称正交的尺度函数,进而也获得了相应的小波.     

三元双正交小波滤波器的刻画

研究由三元双正交插值尺度函数构造对应的双正交小波滤波器的矩阵扩充问题.当给定的一对三元双正交尺度函数中有一个为插值函数时,利用提升思想与矩阵多相分解方法,给出一类三元双正交小波滤波器的显示构造公式和一个计算实例.讨论了三元双正交小波包的的性质.     

小波分式滤波器

1．引言用小波处理实际问题时，对称性具有重要的意义．如果小波不具有对称性，则在信号重构时可能导致失真．我们知道，用多项式滤波器构造的正交小波不具有对称性，这是一个重要的缺欠．本文讨论了分式滤波器，它作为多项式滤波器的最自然的推广和进展，且包含了B样条小波滤波器，可随意构造出对称性小波函数，对实际应用提供了有意义的构造性方法．在小波计算中，为了回避hllrl＊r逆变换，人们通常喜欢用Mdl时算法山，即对尺度函数方程为造迭代格式为了得到迭代收敛（n。、v）条件，通常把滤波器其中以及时，迭代格式（2）逐点收敛于尺…     

Meyer型正交小波基的构造与性质

本文基于多分辨分析理论与A．W．W方法将Meyer正交小波的构造规范化,给出其设计方法,并证明此类Meyer型小波母函数ψ（x)及相应的尺度函数ψ(x)具有优良的性质,如速降性O（│x│^-N-1(│x│→∞）、N阶消失矩、线性相位、对称性、频谱有限性、并且双尺度序列（滤波器）hn=ψ（n/2）等,并给出N＝2时构造小波函的具体实例。     

构造正交小波基的基本方法之一

本文不仅给出一种构造局部性好的正交小波基的方法,并且给出了构造各种优良性质的正交小波基的一般思想方法。其特点:使构造的小波母函数有具体的表达式,既有较好的光滑性,又有很好的局部性,并且其收敛速度与│t│~（-（3k 1））同阶,其中k为任意自然数。这种方法不需要每次重新构造函数,只要改变k的值,就能满足不同实际问题的需要。     

二维正交小波滤波器的逼近

提出了一种二维正交小波滤波器逼近的方法,采用分步优化的方法来构造小波滤波器,最后通过实验给出低通的小波滤波器.     

紧支撑三元正交小波滤波器的参数化

高维小波分析是分析和处理多维数字信号的有力工具．非张量积多元小波被广泛地应用在模式识别、纹理分析和边缘检测等领域．本文给出方体域上三元正交滤波器的一种参数化构造算法,三元小波滤波器的这种构造方法使我们能更方便地研究非张量积的三元正交小波．最后给出数值算例．     

基于仿酉矩阵的紧支撑二元正交小波滤波器组的构造

高维小波是处理多维信号的有力工具,张量积和栅格结构的小波有其自身的特点,但在实际应用中,我们仍需要构造小波滤波器来满足特定情形下的需要以提高滤波的效果,而构造正交滤波器,在多相域里就等价于构造仿酉阵,在本文中,我们通过对仿酉矩阵的研究,证明二元一次对称的仿酉阵一定能够块对角化,利用这种性质,给出了不可分离的二元正交小波滤波器组及线性相位小波滤波器的构造,并给出了相应的例子．     

一维参数化正交小波滤波器的解析性质与优化逼近

本文给出了一维参数化正交小波滤波器系数向量的解析表达式和它的递推计算公式,还给出了它的一阶变分及二阶变分公式．利用这些结果和最优化方法,给出了FIR正交小波滤波器的逼近和设计问题的优化模型和数值例子．     

中心对称仿酉矩阵的构造及二元具有线性相位正交小波滤波器组的参数化

中心对称仿酉矩阵(简记为CSPM)在线性相位的小波滤波器组的构造中起着重要的作用,本文给出偶数阶CSPM的表达式,矩阵中的元素为二元一次多项式.基于已给出的CSPM,给出具有线性相位的二元正交小波滤波器组的参数化,通过选取不同的参数可以得到的具有线性相位的正交小波滤波器组.最后给出算例.     

Symmetric orthogonal filters and wavelets with linear-phase moments

In this paper we study symmetric orthogonal filters with linear-phase moments, which are of interest in wavelet analysis and its applications. We investigate relations and connections among the linear-phase moments, sum rules, and symmetry of an orthogonal filter. As one of the results, we show that if a real-valued orthogonal filter a is symmetric about a point, then a has sum rules of order m if and only if it has linear-phase moments of order 2m. These connections among the linear-phase moments, sum rules, and symmetry help us to reduce the computational complexity of constructing symmetric real-valued orthogonal filters, and to understand better symmetric complex-valued orthogonal filters with linear-phase moments. To illustrate the results in the paper, we provide many examples of univariate symmetric orthogonal filters with linear-phase moments. In particular, we obtain an example of symmetric real-valued 4-orthogonal filters whose associated orthogonal 4-refinable function lies in C²(R).     

适应于图像压缩的11/9小波基构造

根据正交多分辨分析理论,利用求解低通和高通滤波的系数,可构造出多种正交小波.但正交小波中只有Haar小波满足对称性,这不适合在图像处理方面的应用.在提升格式的小波变换出现之前,小波分解通过Mallat算法来完成,而提升格式的小波有显著的优点,运算量少,不同小波运算量减少程度不一样,一般减少在25%到50%之间.文章根据双正交对称紧支集小波的消失矩、对称性、短支撑等一系列条件和其他构造原理,构造出一个适应图像压缩的11/9双正交提升小波,并满足Cohen-Daubechies准则.同时,为了便于小波变换的硬件实现,最佳的状态是,分解和重构滤波系数为二进制分数,且根据不同参数取值,让子带编码增益G_(SBC)达到最大.     

一类向量值正交小波的设计与性质

引入整数因子伸缩的向量值正交小波与向量值小波包的概念.运用仿酉向量滤波器理论和矩阵理论,给出具有整数因子伸缩的向量值正交小波存在的充要条件.提供了紧支撑向量值正交的构建算法,给出了相应的构建算例.利用时频分析方法与算子理论,刻画了一类向量值正交小波包的性质,得到了整数伸缩的向量值小波包的正交公式.     

适合于图像压缩的7/5小波基的构造

通过利用提升算法和检验双正交小波稳定性的充分必要条件Cohen-Daubechies准则,构造了一个适合于图像压缩的7/5双正交小波基.为了便于小波变换的硬件实现,选取四个提升系数中的三个为二进制分数,而另一提升因子为1/10的倍数.本文中所构造的7/5小波基虽然在压缩性能上低于CDF9/7小波,但由于提升系数为二进制分数和1/10的倍数,所以该小波基的小波变换更易于采用硬件来实现,并且其小波变换速度比CDF9/7小波要快.实验的结果表明该小波的压缩性能优于Daubechies5/3小波,同时与[6]所构造的两组7/5小波基相比较,该小波变换不仅能方便于硬件的实现,而且其压缩性能优于或相当于[6]中的两组7/5小波基.     

N DIMENSIONAL FINITE WAVELET FILTERS

In this paper, a large class of n dimensional orthogonal and biorthognal wavelet filters(lowpass and highpass) are presented in explicit expression. We also characterize orthogonal filters with linear phase in this case. Some examples are also given, including non separable orhogonal and biorthogonal filters with linear phase.     

Symmetric orthogonal filters and wavelets with linear-phase moments

In this paper we study symmetric orthogonal filters with linear-phase moments, which are of interest in wavelet analysis and its applications. We investigate relations and connections among the linear-phase moments, sum rules, and symmetry of an orthogonal filter. As one of the results, we show that if a real-valued orthogonal filter $a$ is symmetric about a point, then $a$ has sum rules of order $m$ if and only if it has linear-phase moments of order $2m$. These connections among the linear-phase moments, sum rules, and symmetry help us to reduce the computational complexity of constructing symmetric real-valued orthogonal filters, and to understand better symmetric complex-valued orthogonal filters with linear-phase moments. To illustrate the results in the paper, we provide many examples of univariate symmetric orthogonal filters with linear-phase moments. In particular, we obtain an example of symmetric real-valued 4-orthogonal filters whose associated orthogonal 4-refinable function lies in $C^2\left(\mathbb{R}\right)$.     

An Algebraic Structure of Orthogonal Wavelet Space

In this paper we study the algebraic structure of the space of compactly supported orthonormal wavelets over real numbers. Based on the parameterization of wavelet space, one can define a parameter mapping from the wavelet space of rank 2 (or 2-band, scale factor of 2) and genus gto the (g−1) dimensional real torus (the products of unit circles). By the uniqueness and exactness of factorization, this mapping is well defined and one-to-one. Thus we can equip the rank 2 orthogonal wavelet space with an algebraic structure of the torus. Because of the degenerate phenomenon of the paraunitary matrix, the parameterization map is not onto. However, there exists an onto mapping from the torus to the closure of the wavelet space. And with such mapping, a more complete parameterization is obtained. By utilizing the factorization theory, we present a fast implementation of discrete wavelet transform (DWT). In general, the computational complexity of a rank morthogonal DWT is O(m²g). In this paper we start with a given scaling filter and construct additional (m−1) wavelet filters so that the DWT can be implemented in O(mg). With a fixed scaling filter, the approximation order, the orthogonality, and the smoothness remain unchanged; thus our fast DWT implementation is quite general.     

Shift products and factorizations of wavelet matrices

A class of so-called shift products of wavelet matrices is introduced. These products are based on circulations of columns of orthogonal banded block circulant matrices arising in applications of discrete orthogonal wavelet transforms (or paraunitary multirate filter banks) or, equivalently, on augmentations of wavelet matrices by zero columns (shifts). A special case is no shift; a product which is closely related to the Pollen product is then obtained. Known decompositions using factors formed by two blocks are described and additional conditions such that uniqueness of the factorization is guaranteed are given. Next it is shown that when nonzero shifts are used, an arbitrary wavelet matrix can be factorized into a sequence of shift products of square orthogonal matrices. Such a factorization, as well as those mentioned earlier, can be used for the parameterization and construction of wavelet matrices, including the costruction from the first row. Moreover, it is also suitable for efficient implementations of discrete orthogonal wavelet transforms and paraunitary filter banks.and Cooperative Research Centre for Sensor Signal and Information ProcessingThis author is an Overseas Postgraduate Research Scholar supported by the Australian Government.