基于某微型飞行器的2种图像导航算法性能比较

导航系统是微型飞行器中必不可少的重要部分,在城市、建筑物内部或强电磁干扰等环境下,要实现导航必须采用全新的技术。图像导航是其有效技术之一。根据微型飞行器导航系统实时性和算法精准性的要求,研究了2种图像导航算法：互相关匹配法和局部熵差法。为了降低计算量,使其易于工程实现,采用了分层搜索等技术,并对2种算法进行了改进。仿真结果表明：“互相关匹配法”更适合微型飞行器的图像导航。     

离散混沌系统类随机性的符号熵分析法

采用符号熵分析法,分析和讨论了经典的Logistic映射和Henon映射的类随机性强弱.先将离散混沌系统产生的实数序列转化为二进制序列,然后进行编码,计算其符号熵,绘制其符号熵图,并深入讨论了系统参数和初始值对符号熵的影响.数值仿真分析表明,符号熵法能定量区别不同离散混沌系统类随机性的强弱.同时作为随机源,Logistic映射比Henon映射好.     

不等权泛组合运算模型研究

实际复杂系统中的各因素一般具有不同的权重,针对现有的泛组合运算模型描述的是一种理想的等权情况,给出了两种广义加权算子模型,并据此提出了一种不等权泛组合运算模型,从而可以更准确地处理复杂系统中各因素间关系的不确定性问题.     

Topological entropy and data rate for practical stability: a scalar case

A special class of nonlinear systems, i.e. expanding piecewise affine discrete‐time scalar systems with limited data rate, is used to investigate the role of topological entropy and date rate in a practical stability problem. This special class of nonlinear system as an abstract model is an extension of discrete‐time unstable scalar systems, a well‐known model for quantized feedback design. For such systems with finite quantization levels, how to design a quantized feedback controller to achieve practical stability is considered as a boundability problem. Unlike the existing results about topological entropy for nonlinear stabilization and optimal control for linear systems, for the boundability problem under consideration, the feedback topological entropy defined in this paper is not equal to the minimum number of the quantization interval (i.e. the minimal information rate) and only provides a necessary condition for the boundability of our system under some condition. A necessary and sufficient condition for the boundability is also presented in terms of an inequality related to data rate and the minimum number of quantization intervals. Copyright © 2009 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Application of maximum entropy principle for reliability-based design optimization

The maximum entropy principle (MEP) is used to generate a natural probability distribution among the many possible that have the same moment conditions. The MEP can accommodate higher order moment information and therefore facilitate a higher quality PDF model. The performance of the MEP for PDF estimation is studied by using more than four moments. For the case with four moments, the results are compared with those by the Pearson system. It is observed that as accommodating higher order moment, the estimated PDF converges to the original one. A sensitivity analysis formulation of the failure probability based on the MEP is derived for reliability-based design optimization (RBDO) and the accuracy is compared with that by finite difference method (FDM). Two RBDO examples including a realistic three-dimensional wing design are solved by using the derived sensitivity formula and the MEP-based moment method. The results are compared with other methods such as TR-SQP, FAMM + Pearson system, FFMM + Pearson system in terms of accuracy and efficiency. It is also shown that an improvement in the accuracy by including more moment terms can increase numerical efficiency of optimization for the three-dimensional wing design. The moment method equipped with the MEP is found flexible and well adoptable for reliability analysis and design.     

信息系统属性约简的比较研究

属性约简是粗糙集理论研究的核心问题之一。利用信息熵定义了信息系统的熵约简,从代数与信息熵两种不同角度出发对属性约简进行讨论。通过比较分析,分别在信息系统、协调与不协调决策表中得到这两种观点下属性约简的一些等价关系和蕴含关系,揭示了不同意义下属性约简的本质联系。     

一种基于脉冲耦合神经网络的语音情感识别新方法

针对汉语语音情感识别问题,提出了一种基于脉冲耦合神经网络(PCNN)的识别方法。该方法将语音转化为语谱图后输入到PCNN,得到输出图像的神经元点火序列及其熵序列作为语音情感的特征,利用其特征实现语音情感识别。实验结果表明,该方法可以有效地识别“高兴”与“平常”这两种不同的情感。该方法将PCNN引入到语音情感识别的应用研究中,开拓了语音和图像信号结合处理的新领域,同时对于PCNN的理论研究和实际应用具有重要的现实意义。     

基于微粒群算法和脉冲耦合神经网络的图像分割算法

脉冲耦合神经网络（Pulse Coded Neural Network,PCNN）在图像处理中得到了十分广泛的应用,但是其多个参数的设置给实际应用造成很大的困难。尤其是在图像分割中,不同类型的图像要求不同的分割参数,不同的参数对图像分割的结果影响很大。而微粒群优化算法（Partide Swarm Optimization,PSO）具有对参数自动寻优的优势,为此,将PSO和PCNN相结合,以改进的最大熵函数为适应度函数,提出了一种基于PSO和PCNN算法的图像自动分割算法。实验仿真结果验证了该方法的有效性,即不仅可以正确地实现图像分割,而且参数可以自动设置,省去了人工实验的麻烦,同时分割速度也有所提高。     

Analogy and duality of texture analysis by harmonics or indicators

According to the classic harmonic approach, an orientation density function (odf)f is expanded into its corresponding Fourier orthogonal series with respect to generalized spherical harmonics, and a pole density function (pdf) into its corresponding Fourier orthogonal series with respect to spherical harmonics. While pdfs are even (antipodally symmetric) functions, odfs are generally not. Therefore, the part of the odf which cannot be determined from normal diffraction pdfs can be mathematically represented as the odd portion of its series expansion. If the odff is given, the even part can be mathematically represented explicitly in terms off itself. Thus, it is possible to render maps ofharmonic orientation ghosts, and to evaluatevariants of mathematical standard odfs resulting in identical pdfs independent of pdf data. However, if only normal diffraction pdfs are known, the data-dependentvariation width of feasible odfs remained unaccessible, and within the harmonic approach a measure of confidence in a solution of the pdf-to-odf inversion problem does not exist.According to any discrete approach, an odff defined on some setG of orientations is expanded into its corresponding Fourier orthogonal series with respect to indicator functions of the elements of a partition ofG, and a pdf defined on the upper (lower) unit hemisphereS ₊ ^{3 3} into its corresponding Fourier orthogonal series with respect to indicator functions of the elements of a partition ofS ₊ ³ . The ambiguity of the pdf-to-odf inversion problem is discussed in terms of column-rank deficiency of the augmented projection matrix. The implication of the harmonic approach to split an odf into auniquely determined and anundetermined part does no longer seem to be reasonable. However, it is possible to numerically determine data-dependent confidence intervals for the Fourier coefficients with respect to the indicator functions which can be immediately interpreted as mean orientation densities within the elements of the partition ofG. Doing so for all Fourier coefficients in the finite series expansion, i.e. for all elements of the partition of the setG, eventually results in the data-dependent variation width of odfs feasible with respect to given pdf data, and to the partitions ofG andS ₊ ³ .Thus it is confirmed that the appearance of orientation ghosts, in particular correlations oftrue andghost orientation components, depends on the representation of an odf. It may be questioned whether in practical applications the implicit assumption of the harmonic method that the even part can be determined uniquely and free of error is generally a reasonable initial condition to develop ghost correction procedures.