快速二维最小交叉Tsallis熵的图像阈值分割

目前二维最小交叉Tsallis熵阈值分割法有较好的分割性能,但由于计算复杂度高,使得分割速度慢。针对此问题,提出了一种基于二维最小交叉Tsallis熵的快速图像分割方法。首先对二维最小交叉Tsallis熵法公式进行推导找出需要递推的几个量,然后对二维直方图投影进行分析得到二维直方图的特性;最后利用此特性导出新型的快速递推算法来减少计算时间。实验结果表明:相对于当前二维最小交叉Tsallis熵阈值法,提出的方法在保持分割效果的情况下,其速度提高了20倍以上,其运行时间小于0.2 s。     

非均匀采样系统的一种递推辨识方法

在非均匀采样系统辨识方法中, 通常利用重采样、数值积分等方法来处理非均匀采样数据, 所用模型多为连续有理分式传递函数, 在递推形式下非均匀采样对象又常局限于``数据缺失'的情况. 本文研究更为一般的异步非均匀采样的多变量系统, 采用连续时间状态空间模型描述, 推导了模型参数、参数梯度和系统状态之间的相互递推关系, 构成一种可变迭代间隔的递推辨识算法, 在每次输出采样点上仅更新模型中受当前采样数据影响的参数. 这种辨识方法可以适用于任意非均匀采样系统, 多采样率系统也可作为一种特例适用于本算法. 仿真结果表明, 所提的方法是可行有效的.     

Semi-linear Stochastic Difference Equations

We consider in this paper a class of vector valued processes that have the form Y _n + 1 = A _n ( Y _n ) + B _n . B _n is assumed to be stationary ergodic and A _n is assumed to have a divisibility property. This class includes linear stochastic difference equations as well as multi-type branching processes (with a discrete or with a continuous state space). We derive explicit expressions for the probability distribution as well as for the two first moments of state vectors at the stationary regime. We then apply this approach to derive two formalisms to describe the infinite server queue. The first is based on a branching process approach adapted to phase type service time distributions. The second is based on a linear stochastic difference equation and is adapted to independent and generally distributed service times with bounded support. In both cases we allow for generally distributed arrival process (not necessarily i.i.d. nor Markovian).

基于DOM树和递归X—Y分割算法的Zone树模型

在分析DOM树的基础上提出一种基于DOM树和递归X—Y分割算法,可以根据网页的几何布局生成Zone树模型。描述了将Zone树模型和递归X—Y算法应用到文献数据检索的优越性,给出构建Zone树模型的算法。该模型主要用于在线文献的数据提取,具有速度快、准确性高等特点,优于目前大多数浏览器所采用的DOM树结构。     

Generating strictly binary trees at random based on convex polygon triangulations

A set of maximal non-intersecting diagonals can decompose a polygon into triangles, and the edges and diagonals can be converted into the external and internal nodes of a strictly binary tree. This paper gives algorithms to generate all types of triangulations and triangulations at random. Based on that, this paper gives an algorithm to generate strictly binary trees at random. The experimental results show that the numbers of various shapes of strictly binary trees generated are nearly equal. The algorithm to generate strictly binary trees at random can be transformed to the algorithm to randomly generate binary trees.     

Simultaneous state estimation and parameter identification in linear fractional order systems using coloured measurement noise

In the present paper, the identification and estimation problem of a single-input–single-output (SISO) fractional order state-space system will be addressed. A SISO state-space model is considered in which parameters and also state variables should be estimated. The canonical fractional order state-space system will be transformed into a regression equation by using a linear transformation and a shift operator that are appropriate for identification. The identification method provided in this paper is based on a recursive identification algorithm that has the capability of identifying the parameters of fractional order state-space system recursively. Another subject that will be addressed in this paper is a novel fractional order Kalman filter suitable for the systems with coloured measurement noise. The promising performance of the proposed methods is verified using two stable fractional order systems.     

A kernel machine-based secure data sensing and fusion scheme in wireless sensor networks for the cyber-physical systems

Wireless sensor networks (WSNs) as one of the key technologies for delivering sensor-related data drive the progress of cyber-physical systems (CPSs) in bridging the gap between the cyber world and the physical world. It is thus desirable to explore how to utilize intelligence properly by developing the effective scheme in WSN to support data sensing and fusion of CPS. This paper intends to serve this purpose by proposing a prediction-based data sensing and fusion scheme to reduce the data transmission and maintain the required coverage level of sensors in WSN while guaranteeing the data confidentiality. The proposed scheme is called GM–KRLS, which is featured through the use of grey model (GM), kernel recursive least squares (KRLS), and Blowfish algorithm (BA). During the data sensing and fusion process, GM is responsible for initially predicting the data of next period with a small number of data items, while KRLS is used to make the initial predicted value approximate its true value with high accuracy. The KRLS as an improved kernel machine learning algorithm can adaptively adjust the coefficients with every input, while making the predicted value more close to actual value. And BA is used for data encoding and decoding during the transmission process due to its successful applications across a wide range of domains. Then, the proposed secure data sensing and fusion scheme GM–KRLS can provide high prediction accuracy, low communication, good scalability, and confidentiality. In order to verify the effectiveness and reasonableness of our proposed approach, we conduct simulations on actual data sets that are collected from sensors in the Intel Berkeley research lab. The simulation results have shown that the proposed scheme can significantly reduce redundant transmissions with high prediction accuracy.     

Performance Analysis of The Auxiliary‐Model‐Based Multi‐Innovation Stochastic Newton Recursive Algorithm for Dual‐Rate Systems

The stochastic Newton recursive algorithm is studied for dual‐rate system identification. Owing to a lack of intersample measurements, the single‐rate model cannot be identified directly. The auxiliary model technique is adopted to provide the intersample estimations to guarantee the recursion process continues. Intersample estimations have a great influence on the convergence of parameter estimations, and one‐step innovation may lead to a large fluctuation or even divergence during the recursion. In the meantime, the sample covariance matrix may appear singular. The recursive process would cease for these reasons. In order to guarantee the recursion process and to also improve estimation accuracy, multi‐innovation is utilized for correcting the parameter estimations. Combining the auxiliary model and multi‐innovation theory, the auxiliary‐model‐based multi‐innovation stochastic Newton recursive algorithm is proposed for time‐invariant dual‐rate systems. The consistency of this algorithm is analyzed in detail. The final simulations confirm the effectiveness of the proposed algorithm.     

具有测量数据丢失的离散不确定时滞系统鲁棒Kalman滤波

研究了具有测量数据丢失的离散不确定时滞系统鲁棒Kalman滤波问题, 其中时延存在于系统状态和观测值中. 模型的不确定性通过在系统矩阵中引入随机参数扰动来表示, 测量数据丢失现象则通过一个满足Bernoulli分布且统计特性已知的随机变量来描述. 基于最小方差估计准则, 利用射影性质和递归射影公式得到一个新的滤波器设计方法, 并且保证了滤波器的维数与原系统相等. 与传统的状态增广方法相比, 当时延比较大时, 该方法可以有效降低计算量. 最后, 给出一个仿真例子说明所提方法的有效性.     

多通道Wiener 滤波器设计新方法

应用现代时间序列分析方法,提出了多通道Ｗｉｅｎｅｒ滤波器设计的一种新的时域方法,它可统一处理滤波、平滑和预报问题,且可处理非平稳信号和噪声,仿真例子说明了该方法的有效性。