Computationally Efficient FIR Filtering of Polynomial Signals in DFT Domain

Fast unbiased finite impulse response (UFIR) filtering of polynomial signals can be provided in the discrete Fourier transform (DFT) domain employing fast Fourier transform (FFT). We show that the computation time can further be reduced by utilizing properties of UFIR filters in the DFT domain. The transforms have been found and investigated in detail for low-degree FIRs most widely used in practice. As a special result, we address an explicit unbiasedness condition uniquely featured to UFIR filters in DFT domain. The noise power gain and estimation error bound have also been discussed. An application is given for state estimation in a crystal clock employing the Global Positioning System based measurement of time errors provided each second. Based upon it, it is shown that filtering in the time domain takes about 1?second, which is unacceptable for real-time applications. The Kalman-like algorithm reduces the computation time by the factor of about 8, the FFT-based algorithm by about 18, and FFT with the UFIR filter DFT properties by about 20.     

A novel robust filtering strategy for systems with Non-Gaussian noises

For estimating the states of moving targets in the nonlinear system with non-Gaussian noise, the combination of Gaussian Sum Filter (GSF) and other nonlinear filters has been chosen as the filtering algorithm conventionally. The Smooth Variable Structure Filter (SVSF) is a new predictor-corrector method used for state and parameter estimation, which has good stability and robustness. In this paper we propose a new strategy called the modified GS-EKF-SVSF, which inherits good robustness of Gaussian Sum and Smooth Variable Structure Filter (GS-SVSF) and high accuracy of Gaussian Sum and Extended Kalman Filter (GS-EKF). A nonlinear system with non-Gaussian noise for target tracking is used to test the proposed new strategy. The simulation results demonstrate that our proposed strategy has higher accuracy and better robustness when there are modelling uncertainties existing in the system.     

一种适用于强脉冲噪声下的对数型恒模盲均衡算法

针对脉冲噪声下恒模算法(Constant Modulus Algorithm,CMA)失败的问题,通过分析脉冲噪声的影响,提出了一种基于最小均方（Least Mean Square,LMS）准则的对数型恒模算法（Logarithmic-type CMA,LT-CMA）。LT-CMA利用对数函数的非线性变换特性自适应地抑制强脉冲噪声对误差函数的影响,并且利用l2-范数进行信号归一化处理以增强算法的稳健性。仿真结果表明,所提出的LT-CMA可以适应于高斯噪声环境和脉冲噪声环境;与经典自适应均衡算法相比,在收敛速度和稳健性两方面上,所提出的LT-CMA都有显著的提升。     

一种残差模糊匹配的非线性目标跟踪改进算法

为解决目标跟踪中因系统滤波初值不准确和噪声统计特性未知引起标准非线性卡尔曼算法估计误差变大问题,该文提出一种基于残差的模糊自适应(RTSFA)非线性目标跟踪算法。在确定采样型滤波基本框架的基础上,给出了在线性化误差约束条件下高斯权值的积分一般形式,并利用李雅普诺夫第二方法证明了该算法估计误差有界收敛的充分条件。进一步构建自适应噪声协方差矩阵在线估计噪声特性,并引入Takagi-Sugeno模型和量测椭球界限规则选择噪声估计器调节因子,有效提高了算法的收敛速度和滤波精度。通过滤波初值信息不明和量测噪声时变的纯方位目标跟踪模型,验证了非线性目标跟踪算法具有更好的跟踪精度和更强的鲁棒性。     

核递归最小平均P范数算法

在强脉冲噪声干扰背景中,核递归最小二乘(Kernel Recursive Least Square,KRLS)算法和核递归最大相关熵(Kernel Recursive Maximum Correntropy,KRMC)算法对非线性信号预测性能严重退化,对此提出一种核递归最小平均P范数（Kernel Recursive Least Mean P-norm,KRLMP）算法。首先运用核方法将输入数据映射到再生核希尔伯特空间。其次基于最小平均P范数准则和正则化方法,推导得到自适应滤波器的最佳权向量,其降低了非高斯脉冲和样本量少的影响。然后利用矩阵求逆理论,推导得到矩阵的递归公式。最后利用核技巧得到在输入空间高效计算的滤波器输出和算法的迭代公式。alpha稳定分布噪声背景下Mackey-Glass时间序列预测的仿真结果表明:KRLMP算法与KRLS算法和KRMC算法相比,抗脉冲噪声能力强,鲁棒性好。      

Oversampled filter banks as error correcting codes: theory and impulse noise correction

Oversampled filter banks (OFBs) provide an overcomplete representation of their input signal. This paper describes how OFBs can be considered as error-correcting codes acting on real or complex sequences, very much like classical binary convolutional codes act on binary sequences. The structured redundancy introduced by OFBs in subband signals can be used to increase robustness to noise. In this paper, we define the notions of code subspace, syndrome, and parity-check polynomial matrix for OFBs. Furthermore, we derive generic expressions for projection-based decoding, suitable for the case when a simple second-order model completely characterizes the noise incurred by subband signals. We also develop a nonlinear hypotheses-test based decoding algorithm for the case when the noise in subbands is constituted by a Gaussian background noise and impulsive errors (a model that adequately describes the action of both quantization noise and transmission errors). Simulation results show that the algorithm effectively removes the effect of impulsive errors occurring with a probability of 10/sup -3/.     

Novel Adaptive Nonlinear Predistorters Based on the Direct Learning Algorithm

The adaptive nonlinear predistorter is an effective technique to compensate for the nonlinear distortion existing in digital communication and control systems. However, available adaptive nonlinear predistorters using indirect learning are sensitive to measurement noise and do not perform optimally. Other available types are either slow to converge, complicated in structure and computationally expensive, or do not consider the memory effects in nonlinear systems such as a high power amplifier (HPA). In this paper, we first propose several novel adaptive nonlinear predistorters based on direct learning algorithms - the nonlinear filtered-x RLS (NFXRLS) algorithm, the nonlinear adjoint LMS (NALMS) algorithm, and the nonlinear adjoint RLS (NARLS) algorithm. Using these new learning algorithms, we design adaptive nonlinear predistorters for an HPA with memory effects or for an HPA following a linear system. Because of the direct learning algorithm, these novel adaptive predistorters outperform nonlinear predistorters that are based on the indirect learning method in the sense of normalized mean square error (NMSE), bit error rate (BER), and spectral regrowth. Moreover, our developed adaptive nonlinear predistorters are computationally efficient and/or converge rapidly when compared to other adaptive nonlinear predistorters that use direct learning, and furthermore can be easily implemented. We further simplify our proposed algorithms by exploring the robustness of our proposed algorithm as well as by examining the statistical properties of what we call the "instantaneous equivalent linear" (IEL) filter. Simulation results confirm the effectiveness of our proposed algorithms     

An iterative algorithm for X-ray CT fluoroscopy

X-ray computed tomography fluoroscopy (CTF) enables image guidance of interventions, synchronization of scanning with contrast bolus arrival, and motion analysis. However, filtered backprojection (FB), the current method for CTF image reconstruction, is subject to motion and metal artifacts from implants, needles, or other surgical instruments. Reduced target lesion conspicuity may result from increased image noise associated with reduced tube current. In this report, the authors adapt the row-action expectation-maximization (EM) algorithm for CTF. Because time-dependent variation in images is localized during CTF, the row-action EM-like algorithm allows rapid convergence. More importantly, this iterative CTF algorithm has fewer metal artifacts and better low-contrast performance than FB     

A New Sequential Block Partial Update Normalized Least Mean M-Estimate Algorithm and its Convergence Performance Analysis

This paper proposes a new sequential block partial update normalized least mean square (SBP-NLMS) algorithm and its nonlinear extension, the SBP-normalized least mean M-estimate (SBP–NLMM) algorithm, for adaptive filtering. These algorithms both utilize the sequential partial update strategy as in the sequential least mean square (S–LMS) algorithm to reduce the computational complexity. Particularly, the SBP–NLMM algorithm minimizes the M-estimate function for improved robustness to impulsive outliers over the SBP–NLMS algorithm. The convergence behaviors of these two algorithms under Gaussian inputs and Gaussian and contaminated Gaussian (CG) noises are analyzed and new analytical expressions describing the mean and mean square convergence behaviors are derived. The robustness of the proposed SBP–NLMM algorithm to impulsive noise and the accuracy of the performance analysis are verified by computer simulations.     

Robust Detectors for Signals in Non-Gaussian Noise

The robustness of suboptimal nonlinear detectors for known discrete-time signals in non-Gaussian noise is investigated. The measure of robustness used is the degradation of asymptotic relative efficiency (compared to a linear detector) from that achieved by an optimal nonlinear detector. The first order density of non-Gaussian noise is modeled as a mixture of a small variance Gaussian background noise pdf and a large variance impulsive pdf.     

Robust watermarking against print and scan attack through efficient modeling algorithm

This article proposes a blind discrete wavelet transform-discrete cosine transform (DWT-DCT) composite watermarking scheme that is robust against print and scan distortions. First, two-dimensional DWT is applied to the original image to obtain the mid-frequency subbands. Then, a one-dimensional DCT is applied to the selected mid-frequency subbands to extract the final coefficients for embedding the watermark. To specify watermarking parameters, we utilize a Genetic Algorithm to achieve a predefined image quality after watermark insertion. Suitable locations for watermarking are determined by analyzing the effect of a modeling algorithm. This model simulates noise and nonlinear attacks in printers and scanners through noise estimation and system identification methods. The experimental results demonstrate that the proposed algorithm has a high robustness against print and scan attack such that its robustness is higher than related watermarking algorithms.     

基于非线性抗噪声估计的视觉显著性弱小目标检测

针对红外图像处理技术中弱小目标检测的重要性及关键性,提出一种基于非线性抗噪声估计的检测算法来解决高可靠性、高鲁棒性的弱小目标检测问题。提出的方法基于传统视觉显著度算法及空间距离处理方法,对目标及背景区域采用非线性加权方法进行估计,在不显著降低目标信号信噪比的基础上,削弱孤立微小噪声点对检测算法性能的影响,可提高抗噪性能。首先,采用模块化及非线性映射方式预测背景;然后,融入距离相关因子滤除噪声干扰;最后,在处理结束的图像上进行二值化阈值分割,自动检测并向下一级处理软件输出目标位置信息。实验结果表明:提出的算法与近年来先进的弱小目标检测算法相比,在受试者测试曲线上,在相同的虚警率下,可获得更高的检测率,对背景噪声的抑制很明显;在局部信噪比及背景抑制因子的测试比对数据上,提出的算法可获得更高的检测指标。缺点是算法采用了非线性处理技术,运算效率较低,需进一步优化算法以提高计算速度,实现算法的实时目标检测。     

稳定分布噪声下基于高斯近似粒子滤波的干扰源定位算法

民航地空通信受到无线电干扰会严重危及民航飞机的正常飞行,本文在深入研究利用接收飞机散射信号的多普勒频移信息定位地面干扰源方法的基础上,提出基于高斯近似粒子滤波（GAPF）的定位算法。本文的主要贡献可以总结为:第一,对多普勒频移与干扰源坐标之间非线性关系进行深入研究,构建状态方程及观测方程。第二,考虑更能准确描述散射信道模型的对称alpha稳定分布(SaS)噪声作为叠加的背景噪声,并提出 噪声下的高斯近似粒子滤波算法。计算机仿真实验表明,与扩展卡尔曼滤波（EKF）及无迹卡尔曼滤波（UKF）算法相比,本文算法的估计性能优势明显,并且对SaS噪声具有较强的鲁棒性。      

基于学生t分布的鲁棒分层模糊算法及其在图像分割中的应用

著名的模糊C均值算法（FCM）一直被视为图像分割应用中一个强有力的工具.然而,由于FCM中距离函数选择问题使得其对图像噪声的鲁棒性不足.本文提出了一个新的分层模糊C均值算法,使得传统的模糊C均值算法对于图像噪声和离群点有更好的鲁棒性.在此基础上引入了一个更加灵活的函数,即将距离函数本身看作是一个子学生t分布函数.使分层模型具有更好的通用性和灵活性.本文提出的算法可以扩展到其他基于FCM模型的算法实现,以获得更优的鲁棒性.实验结果表明本文提出新的分层模糊C均值算法的鲁棒性确实有效.     

ICA去除EEG中眼动伪差和工频干扰方法研究

眼动伪差和工频干扰是临床脑电图(EEG)中常见噪声,严重影响其有用信息提取.本文尝试采用独立分量分析(Independent Component Analysis,ICA)方法分离EEG中此类噪声.通过对早老性痴呆症(Alzheimer disease,AD)患者临床EEG信号(含眼动伪差和混入工频干扰,信噪比仅0dB)作ICA分析,比较了最大熵(Infomax)和扩展最大熵(Extended Infomax)ICA算法的分离效果,证实虽然最大熵算法可以分离出眼动慢波,但难以消除工频干扰,为此需采用扩展的最大熵算法;并知ICA方法在极低信噪比时也有较好的抗干扰性,且在处理非平稳信号时有好的鲁棒性;文中还结合近似熵(approximate entropy,ApEn)分析说明利用ICA去除干扰后有助于恢复和保持原始EEG信号的非线性特征.研究结果表明ICA方法在生物医学信号处理中具有潜在的重要应用价值,值得深入研究和推广.     

Results on principal component filter banks: colored noisesuppression and existence issues

We have made explicit the precise connection between the optimization of orthonormal filter banks (FBs) and the principal component property: the principal component filter bank (PCFB) is optimal whenever the minimization objective is a concave function of the subband variances of the FB. This explains PCFB optimality for compression, progressive transmission, and various hitherto unnoticed white-noise, suppression applications such as subband Wiener filtering. The present work examines the nature of the FB optimization problems for such schemes when PCFBs do not exist. Using the geometry of the optimization search spaces, we explain exactly why these problems are usually analytically intractable. We show the relation between compaction filter design (i.e., variance maximization) and optimum FBs. A sequential maximization of subband variances produces a PCFB if one exists, but is otherwise suboptimal for several concave objectives. We then study PCFB optimality for colored noise suppression. Unlike the case when the noise is white, here the minimization objective is a function of both the signal and the noise subband variances. We show that for the transform coder class, if a common signal and noise PCFB (KLT) exists, it is, optimal for a large class of concave objectives. Common PCFBs for general FB classes have a considerably more restricted optimality, as we show using the class of unconstrained orthonormal FBs. For this class, we also show how to find an optimum FB when the signal and noise spectra are both piecewise constant with all discontinuities at rational multiples of π     

自适应序贯M估计算法及其性能分析

针对复杂噪声环境下的参数估计问题,提出了一种稳健的自适应序贯M估计算法(Adaptive Recursive M-Estimation,ARME),并从理论分析和Monte Carlo实验仿真两方面分析了该算法的收敛性、渐进无偏特性和稳健性.理论分析和仿真试验表明:在高斯白噪声背景下,ARME具有与序贯最小二乘算法(Recursive Least Square,RLS)相近的性能;在有突出干扰等非高斯噪声背景下,与RLS相比,ARME的参数估计收敛速度更快,估计误差更小,而且在稳健性上大大优于RLS.     

基于CF-RSF算法的航天器姿态确定

针对复杂环境下航天器姿态确定系统中的模型和噪声不确定问题,提出一种基于求容积规则的风险敏感滤波(CF-RSF)的航天器姿态确定算法。该算法通过引入风险敏感算子来解决由于系统的不确定性而导致滤波器鲁棒性差,甚至发散的问题,并通过求容积规则来解决非线性积分问题。该方法不仅提高了滤波算法对系统不确定性问题的鲁棒性,而且一定程度上提高了滤波的精度,降低了滤波的计算复杂性。仿真结果表明了算法的有效性。     

Robust parameter estimation of a deterministic signal in impulsivenoise

This paper presents a robust class of estimators for the parameters of a deterministic signal in impulsive noise. The proposed technique has the structure of the maximum likelihood estimator (MLE) but has an extra degree of freedom: the choice of a nonlinear function (which is different from the score function suggested by the MLE) that can be adjusted to improve robustness. The effect of this nonlinear function is studied analytically via an asymptotic performance analysis. We investigate the covariance of the estimates and the loss of efficiency induced by nonoptimal choices of the nonlinear function, giving special attention to the case of α-stable noise. Finally, we apply the theoretical results to the problem of estimating the parameters of a sinusoidal signal in impulsive noise     

Improvement of robustness of vector-controlled induction motorsusing feedforward and feedback control

The authors propose a combined feedforward and feedback (FF/FB) control to improve robustness of vector-controlled induction motors. This FF/FB system maintains the quick response of the slip-frequency-type and is insensitive to parameter variation in cooperation with field-orientation control. Furthermore, the authors propose a neural network (NNW)-based vector control as a final goal of the FF/FB system