Rational wavelet decompositions of transfer functions in hardy-sobolev classes

The model approximation of transfer functions using rational wavelets (or molecular decompositions) is considered. By using techniques from Hardy-Sobolev spaces it is shown that Hilbert space methods such as a modified matching-pursuit algorithm and least-squares technique can be employed to obtain good approximations in bothH ² andH norms. Several theoretical results are given on rates of convergence when the methods are applied to delay systems and fractional filters.The research of the first author was supported by E.P.S.R.C.     

结合l1/2范数与显著性约束的背景减除

传统背景减除模型在背景静止和前景对象移动较快时提取到的前景效果较好,但当背景变化或前景对象移动缓慢时容易将动态背景误判为前景或检测出的前景有较多空洞。针对传统背景减除模型在动态背景和前景对象移动缓慢条件下存在前景检测精度下降的问题,提出一种基于l_1/2范数与显著性约束的背景减除模型。将观测数据分为低秩背景、运动前景和动态干扰3类,利用l_1/2范数约束运动前景加强前景稀疏性,有效抑制动态背景对前景提取造成的干扰,提高运动前景在动态背景中的检测精度。引入视频每一帧的显著性约束,通过对每一帧图像进行低秩稀疏分解来检测移动缓慢的目标。实验结果表明,该模型对于复杂场景具有较强的适应能力,可有效去除动态背景对前景的干扰,快速检测出移动缓慢的前景对象,相比于l_1/1/2-RPCA背景减除模型的平均查全率、查准率和调和平均值分别提升了9、14和10个百分点。     

Robust Stabilization of Nonlinear Systems via Normalized Coprime Factor Representations

A reasonably complete theory for the synthesis of robust controllers for a broad class of nonlinear systems is now available. We use this theory to generalize the linear theory of normalized coprime factor robustness optimization to the case of affine input nonlinear systems. In particular, we show that the equilibrium controller may be characterized in terms of the stabilizing and destabilizing solutions of the Hamilton–Jacobi equation used to calculate the normalized (right) coprime factors of the plant. We also show that the optimal robustness margin of

相似文献   

高脉冲重复频率雷达混合滤波解距离模糊方法

针对高脉冲重复雷达距离模糊问题,提出一种新的混合滤波解距离模糊方法.通过把脉冲间隔数和脉冲间隔变化量作为目标待估计状态,对离散的脉冲间隔数、间隔变化量和连续的目标状态(位置和速度)进行混合滤波,从而将解距离模糊问题转换为对脉冲间隔数的估计问题.初始时刻,由于距离量测模糊,利用多个高脉冲重复频率(HPRF)采用欧氏距离对混合状态进行初始化.在滤波过程中,为了避免门限选择,首先根据脉冲间隔变化量的有限个离散取值,将六维向量的混合滤波模型等效为有限个五维向量的混合滤波模型;然后对量测分别进行混合滤波;最后通过对各模型得到的新息的2范数进行比较获得混合状态估计,从而实现解距离模糊.混合滤波解距离模糊方法为实现高脉冲重复频率雷达实时解距离模糊提供了一种新的研究思路,仿真结果表明,本文提出的混合滤波方法在只有一个脉冲重复频率获得目标量测时较现有多假设方法收敛速度快,并且可以克服多假设方法在脉冲间隔数变化时发生的解模糊错误.     

t-Norm based cuts of intuitionistic fuzzy sets

We consider the system of intuitionistic fuzzy sets (IF-sets) in a universe X and study the cuts of an IF-set. Suppose a left continuous triangular norm is given. The t-norm based cut (level set) of an IF-set is defined in a way that binds the membership and nonmembership functions via the triangular norm. This is an extension of usual cuts of IF-sets. We show that the system of these cuts fulfils analogical properties as usual systems of cuts. However, it is not possible to reconstruct an IF-set from the system of t-norm based cuts.     

Reliable control for a class of uncertain singular systems with interval time‐varying delay

This paper is concerned with the reliable controller design problem for a class of singular systems with interval time‐varying delay and norm‐bounded uncertainties. A more practical model of actuator failures than outages is considered. First, by constructing a novel Lyapunov–Krasovskii functional combined with Finsler's Lemma, an improved delay‐range‐dependent stability criterion for the nominal unforced singular time‐delay system is established in terms of linear matrix inequality (LMI). Then, based on this criterion, an LMI condition for the design of a reliable state feedback controller is presented such that, for all parameter uncertainties and actuator failures, the resultant closed‐loop system is regular, impulse‐free and stable. Numerical examples are proposed to illustrate the effectiveness of the proposed method. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

基于最小平方误差逼近的线性阀体的设计

针对线性阀体的内孔筒设计问题,建立了一个以过流面积和其逼近直线之间的平方误差最小为目标的泛函优化模型.     

An EDBoost algorithm towards robust face recognition in JPEG compressed domain

In this paper, we describe a novel multiclass boosting algorithm, EDBoost, to achieve robust face recognition directly in JPEG compressed domain. In comparison with existing boosting algorithms, the proposed EDBoost exploits Euclidean distance (ED) to eliminate non-effective weak classifiers in each iteration of the boosted learning, and hence improves both feature selection and classifier learning by using fewer weak classifiers and producing lower error rates. When applied to face recognition, the EDBoost algorithm is capable of selecting the most discriminative DCT features directly in JPEG compressed domain to achieve high recognition performances. In addition, a new DC replacement scheme is also proposed to reduce the effect of illumination changes. In comparison with the existing techniques, the proposed scheme achieves robust face recognition without losing the important information carried by all DC coefficients. Extensive experiments support the conclusion that the proposed algorithm outperforms all representative existing techniques in terms of boosted learning, multiclass classification, lighting effect reduction and face recognition rates.     

Finding an Euclidean anti--centrum location of a set of points

An obnoxious facility is to be located inside a polygonal region of the plane, maximizing the sum of the k smallest weighted Euclidean distances to n given points, each protected by some polygonal forbidden region. For the unweighted case and k fixed an O(n²logn) time algorithm is presented. For the weighted case a thorough study of the relevant structure of the multiplicatively weighted order-k-Voronoi diagram leads to the design of an O(kn³+n³logn) time algorithm for finding an optimal solution to the anti-t-centrum problem for every t=1,…,k, simultaneously.     

一种改进的FCM聚类研究

针对模糊C-均值（FCM）算法在解决各数据样本对聚类中心具有同样影响权重问题的不足以及对噪声和孤立点数据敏感,提出了改进和提高的方法：利用相似关系理论,为每一个样本加一个特征权值,构造加权目标函数,让不同的样本在聚类中起不同的作用,并对欧式距离进行加权,减少少数异常点对确定聚类中心的影响;同时对隶属度函数进行改进,以消除孤立点对聚类结果的影响。实验结果表明改进后的算法比经典FCM具有更好的鲁棒性和聚类效果。