纯二维小波滤波器组及其在图像压缩中的应用

构造了一组新的纯二维不可分离的小波滤波器——全相位离散反余弦列率滤波器（APDICSF）。该滤波器具有五株排列的交错采样形式和良好的内插性能,适用于图像分解压缩。将其用于提升格式的预测和更新滤波器,得到与可分离小波滤波器组不同的图像分解方式,并用SPIHT实现图像的压缩编码。实验证明,APDICSF组的压缩效果好于经典的Neville滤波器,在图像压缩方面有良好的应用前景。     

纯二维5/3小波变换及其在CT图像无损压缩中的应用

小波变换在数字图像处理领域有着广泛的应用,其对图像的处理常采用行列分离处理方式,这种方式不能完全吻合人眼视觉特性.针对这一情况,构造了一种与人眼视觉特性更加吻合的纯二维小波变换处理方式.首先,由一维5/3小波滤波器组通过McClellan变换构造纯二维5/3小波滤波器组,并用提升格式实现;然后,用该提升格式与纯二维Lazy小波滤波器组相嵌套的形式实现图像的纯二维5/3小波变换.为了便于工程应用,给出了其变换规程.将纯二维5/3小波变换用于CT图像的无损压缩,实验证明:对于512 dpi×512 dpi尺寸的CT图像,纯二维5/3小波变换无损压缩效果高于二维可分离5/3小波变换,每幅图像可平均节省1 989.9 byte.     

纯二维全相位滤波器组及其在图像压缩中的应用

基于全相位理论,设计了3种纯二维全相位滤波器组(ADFB).这些滤波器组可以直接对图像进行纯二维分解和重构,若忽略滤波器的有限精度问题,系统是全重建的.为了减小运算量,纯二维ADFB采用提升格式实现.仿真试验表明,纯二维ADFB具有良好的数据压缩特性.在压缩率相同的情况下,尤其是IDCT-AFB7.7比Daubechies9/7小波重建图像的峰值信噪比(PSNR)最多小0.7 dB,这与采用的适合于可分离二维小波变换的四叉树SPIHT编码方案有关,若采用二叉树SPIHT编码,会使压缩效果得到改善.     

线性完全重构的二维滤波器组的Groebner基设计

为设计线性完全重构的二维滤波器组,引用了计算代数中的Groebner基方法,根据线性相位条件和完全重构条件,分别设计出二维滤波器组的分析滤波器和综合滤波器的多相元矩阵,给出其参数化形式。根据小波构造理论,利用所设计的分析滤波器组构造出一个对称的纯二维小波。设计结果显示了Groebner基方法的有效性,设计方法更为简单。     

二维四通道不可分正交小波的快速算法

针对张量积小波只强调水平、垂直方向的不足,研究了二维小波的性质和特点,给出了二维四通道不可分小波的快速算法及其数学证明,分析了此算法的运算量,探讨了滤波器组的构造方法,理论推导与分析表明此算法运算速度比不抽样的二维不可分小波变换和二维快速Fourier变换更快.通过构造出的滤波器组进行不可分小波的分解实验,并与张量积小波进行比较,结果表明不可分小波变换在对图像进行滤波时能全面提取图像各方向的信息.     

高正则二维小波的构造及在遥感图像编码中的应用

首先根据对称正交二维小波滤波器组的阶因式分解表示,结合正则性条件,建立一组以滤波器组参数为未知数的高阶多元多项式非线性方程组,并将这一组方程分解为两个子方程组,应用计算代数中的Groebner基算法分别求出解其Groebner基后获得二维小波滤波器组的全部参数,从而构造出一种集正交性、对称性和高正则性于一体的完美的"真"二维小波;其次从二维正交多分辨分析出发,推导出二维小波变换的分解和重构快速算法;最后将构造得到的3正则阶二维小波和SPIHT编码算法相结合对某地的遥感图像进行压缩编码.实验结果显示该方法具有较好的编码性能.     

波形匹配小波设计及其在信号数据压缩中的应用

小波变换被广泛应用于信号数据压缩领域,如何选择小波基,达到用稀疏系数最优表示信号是提高压缩比的关键问题之一。该文提出了选用与信号波形最优相似的小波基压缩一维信号,并提出了构造此类小波基的方法。利用结构化小波滤波器组以及新的波形相似准则,给出了构造最优匹配小波基函数的算法。将此小波应用于一维信号数据压缩,结果表明,与其它的小波相比,所构造的最优匹配小波对信号具有更好的压缩性能,说明文中提出的方法是有效可行的。     

航空图像压缩的双正交小波滤波器整数化设计

在航空图像压缩中,通常采用具有线性相位、正则性、消失矩和完全重构,及适于硬件实现、实时等特性的小波。根据小波滤波器设计,提出了一种基于图像压缩的构造整数双正交小波滤波器的设计方法。从选择小波基的原则为出发点,以CDF9-7小波基为参考,以压缩效果为准则来构造出更优的双正交整数小波基,并且采用航空图像为标准训练图像,以压缩比、峰值信噪比、压缩后保留能量百分比为参数,来寻找最优的小波基。试验结果证明,此方法可以实施非常简单的、无浮点乘法的运算,因而减少运算复杂性以及降低小波硬件实现的难度。     

用余弦调制PR－FIR方法构造正交小波基

离散小波变换将离散时间信号分解为一系列不同分辨率下的离散近似信号和离散细节，紧支的正交规范小波与完全重构正交镜象滤波器（ＰＲ－ＱＭＦ）相对应。本文在“二带”正交小波基的构造条件下，利用余弦调制完全重构滤波器组的方法，实现了正交小波基的构造，计算模拟表明该方法非常简单、有效。     

基于双正交小波的光阑小波滤波器

提出了一种应用于4f光学系统的光学小波滤波器的设计与制作方法.结合光学信号的优势与小波变换的优点,利用双正交小波的共轭镜像特性构造出了频域形式的分解和重构滤波器.通过将滤波器放置在4f系统的频谱面上对图像成功实现了二维分解和重构.另外还根据信息处理要求和采样器件的特性,制作了振幅型和位相型两种小波滤波器.这两套滤波器都...     

空间二维相关K分布杂波建模与仿真

针对雷达杂波在空间二维相关的特点,提出了一种相关K分布杂波模型及仿真方法:首先提出了基于1-范数的空间相关性假设,然后利用修正的球不变随机过程(SIRP)法得到相关K分布随机场,最后,利用计算机仿真实验验证了该杂波建模方法的正确性。     

Two Classes of Cosine-Modulated IIR/IIR and IIR/FIR NPR Filter Banks

This paper introduces two classes of cosine-modulated causal and stable filter banks (FBs) with near perfect reconstruction (NPR) and low implementation complexity. Both classes have the same infinite-length impulse response (IIR) analysis FB but different synthesis FBs utilizing IIR and finite-length impulse response (FIR) filters, respectively. The two classes are preferable for different types of specifications. The IIR/FIR FBs are preferred if small phase errors relative to the magnitude error are desired, and vice versa. The paper provides systematic design procedures so that PR can be approximated as closely as desired. It is demonstrated through several examples that the proposed FB classes, depending on the specification, can have a lower implementation complexity compared to existing FIR and IIR cosine-modulated FBs (CMFBs). The price to pay for the reduced complexity is generally an increased delay. Furthermore, two additional attractive features of the proposed FBs are that they are asymmetric in the sense that one of the analysis and synthesis banks has a lower computational complexity compared to the other, which can be beneficial in some applications, and that the number of distinct coefficients is small, which facilitates the design of FBs with large numbers of channels.     

Reduction of transients during lifting based spatial switching of two-channel filter banks

Time/space varying filter banks (FBs) are useful for non-stationary images. Lifting factorization of FBs results in structural perfect reconstruction even during the transition from one FB to other. This allows spatial switching between arbitrary FBs, avoiding the need to design border FBs. However, we show that lifting based switching between arbitrarily designed FBs induces spurious transients in the subbands during the transition. In this paper, we study the transients in lifting based switching of two-channel FBs. We propose two solutions to overcome the transients. One solution consists of a boundary handling mechanism to switch between any arbitrarily designed FBs, while the other solution proposes to design the FBs with a set of conditions applied on lifting steps. Both solutions maintain good frequency response during the transition and eliminate the transients. Using the proposed methods, we develop a spatial adaptive transform by switching between the long length FBs (either the JPEG2000 9/7 FB or the newly designed 13/11 FB) and the short length FBs (JPEG2000 5/3 FB) for lossy image compression. This adaptive transform shows PSNR improvement for images over JPEG2000 9/7 FB in low bit rate region (up to 0.2 bpp) and subjective improvements with reduced ringing up to medium bit rates (up to 0.6 bpp).     

Lapped unimodular transforms: lifting factorization and structural regularity

In this paper, the lifting factorization and structural regularity of the lapped unimodular transforms (LUTs) are studied. The proposed M-channel lifting factorization is complete, is minimal in the McMillan sense, and has diagonal entries of unity. In addition to allowing for integer-to-integer mapping and guaranteeing perfect reconstruction even under finite precision, the proposed lifting factorization structurally ensures unimodularity. For regular LUT design, structural conditions that impose (1,1)-, (1,2)- and (2,1)-regularity onto the filter banks (FBs) are presented. Consequently, the optimal filter coefficients can be obtained through unconstrained optimizations. A special lifting-based lattice structure is used for parameterizing nonsingular matrices, which not only helps impose regularity but also has rational-coefficient unimodular FBs as a by-product. The regular LUTs can be transformed to the lifting domain with the proposed factorization for faster and multiplierless implementations. The lifting factorization and the regularity conditions are derived for two different (Type-I and Type-II) factorizations of the first-order unimodular FBs. Design examples are presented to confirm the proposed theory.     

Reduced-rank multistage receivers for DS-CDMA in frequency-selective fading channels

Multistage (MS) implementation of the minimum mean-square error (MMSE), minimum output energy (MOE), best linear unbiased estimation (BLUE), and maximum-likelihood (ML) filter banks (FBs) is developed based on the concept of the MS Wiener filtering (MSWF) introduced by Goldstein et al. These FBs are shown to share a common MS structure for interference suppression, modulo a distinctive scaling matrix at each filter's output. Based on this finding, a framework is proposed for joint channel estimation and multiuser detection (MUD) in frequency-selective fading channels. Adaptive reduced-rank equal gain combining (EGC) schemes for this family of FBs (MMSE, MOE, BLUE, and ML) are proposed for noncoherent blind MUD of direct-sequence code-division multiple-access systems, and contrasted with the maximal ratio combining counterparts that are also formed with the proposed common structure under the assumption of known channel-state information. The bit-error rate, steady-state output signal-to-interference plus noise ratio (SINR), and convergence of the output SINRs are investigated via computer simulation. Simulation results indicate that the output SINRs attain full-rank performance with much lower rank for a highly loaded system, and that the adaptive reduced-rank EGC BLUE/ML FBs outperform the EGC MMSE/MOE FBs, due to the unbiased nature of the implicit BLUE channel estimators employed in the EGC BLUE/ML schemes.     

Orthonormal FBs With Rational Sampling Factors and Oversampled DFT-Modulated FBs: A Connection and Filter Design

Methods widely used to design filters for uniformly sampled filter banks (FBs) are not applicable for FBs with rational sampling factors and oversampled discrete Fourier transform (DFT)-modulated FBs. In this paper, we show that the filter design problem (with regularity factors/vanishing moments) for these two types of FBs is the same. Following this, we propose two finite-impulse-response (FIR) filter design methods for these FBs. The first method describes a parameterization of FBs with a single regularity factor/vanishing moment. The second method, which can be used to design FBs with an arbitrary number of regularity factors/vanishing moments, uses results from frame theory. We also describe how to modify this method so as to obtain linear phase filters. Finally, we discuss and provide a motivation for iterated DFT-modulated FBs.     

Design of perfect-reconstruction nonuniform recombination filter banks with flexible rational sampling factors

This paper studies the design of a class of perfect-reconstruction (PR) nonuniform filter banks (FBs) called recombination nonuniform FBs (RNFBs). They are constructed by merging subbands in a uniform FB with sets of transmultiplexers (TMUXs). It generalizes the RNFBs previously proposed by the authors to allow more general choice of the sampling factors. The spectral inversion and spurious response suppression problems of these new RNFBs using cosine modulation are analyzed, and a simple design method based on a matching condition is proposed. It is also found that the FB and the TMUX in the recombination structure can be designed separately to satisfy the matching condition. In addition, real-time adaptive merging of the channels to provide dynamic nonuniform frequency partitioning is feasible. Another advantage of the RNFBs is that the recombination and processing of the subband signal can be done at the decimated domain of the uniform FB, which greatly reduces its implementation complexity. Design examples show that high quality nonuniform PR FBs with low implementation complexity and variable time-frequency resolution can be obtained by the proposed method.     

A high-resolution interpolator for incremental encoders based onthe quadrature PLL method

This paper presents a new high-resolution interpolator for incremental encoders based on the quadrature phase-locked loop method proposed by Emura. Until now, this method has been applied to controllers of high-precision servomechanisms and has shown excellent performance. In this paper, the authors apply the method for the first time to an interpolator for incremental encoders. The experimental results show that high-speed interpolation is possible, with a maximum output frequency of 25 MHz-20 times higher than that of conventional interpolators. The interpolator proposed was also tested for noise rejection with a high-speed numerically controlled gear grinding machine, and has shown good noise rejection capability. This paper presents the design of the interpolator and the experimental results     

New design and realization techniques for a class of perfect reconstruction two-channel FIR filterbanks and wavelets bases

This paper proposes two new methods for designing a class of two-channel perfect reconstruction (PR) finite impulse response (FIR) filterbanks (FBs) and wavelets with K-regularity of high order and studies its multiplier-less implementation. It is based on the two-channel structural PR FB proposed by Phoong et al (1995). The basic principle is to represent the K-regularity condition as a set of linear equality constraints in the design variables so that the least square and minimax design problems can be solved, respectively, as a quadratic programming problem with linear equality constraints (QPLC) and a semidefinite programming (SDP) problem. We also demonstrate that it is always possible to realize such FBs with sum-of-powers-of-two (SOPOT) coefficients while preserving the regularity constraints using Bernstein polynomials. However, this implementation usually requires long coefficient wordlength and another direct-form implementation, which can realize multiplier-less wavelets with K-regularity condition up to fifth order, is proposed. Several design examples are given to demonstrate the effectiveness of the proposed methods.     

移动Ad Hoc网络中一种分布式QoS保证的多址接入协议

基于随机竞争和冲突解决的思想,本文为多跳移动Ad Hoc网络提出了一种分布式服务质量(QoS)保证的多址接入(QMA)协议.该协议中,节点在发送业务分组前利用预报突发进行竞争接入,节点根据业务分组时延情况和最早失效优先原则确定预报突发的长度,所发预报突发能持续到最后的节点优先获得接入.同时,具有实时业务的节点可以按照其优先级在更早的竞争微时隙中开始发送预报突发,而有非实时业务的节点只能在前面竞争微时隙空闲的情况下,才能在后面的微时隙开始发送预报突发,因此发送实时业务的节点可以比发送非实时业务的节点更优先接入信道,从而在移动Ad Hoc网络中实现了对多媒体业务的QoS保证.最后利用OPNET仿真评估了QMA协议的多址性能,并与IEEE 802.11e协议的性能做了比较,结果表明QMA协议可以提供较高的吞吐量和较低的实时业务时延.