基于多信号模型和盲源分离的复合故障诊断方法

利用多信号模型可简明表征系统因果关系以及盲源分离算法可提取系统本源信息的特点, 提出一种新颖有效的复合故障诊断方法. 首先, 针对复合故障下多信号模型出现冗余测试和故障模糊组的情况, 应用盲源分离算法实现测点信息的盲分离, 基于盲信号重建多信号模型的因果结构; 其次, 理论分析了该方法对复合故障具有良好的可诊断性. 轧制过程AGC系统的实验结果表明, 所提出方法对双复合故障和部分多复合故障的隔离和定位准确率可达100%.

     

统计相关源信号分离模型与算法综述

统计相关源信号分离理论不仅有着广泛的应用背景, 也为深入了解数据的本质结构提供了有效的分析工具. 首先, 重点分析和讨论一类特殊的相关源信号分离模型—–独立子空间分析模型的可分离性; 其次, 分别介绍基于源信号稀疏性、统计测度、独立子空间分析、源信号时序结构、源信号有界性和非负性的各种相关源信号分离算法; 再次, 通过将加性噪声中的盲源分离和高光谱解混问题建模为统计相关源信号分离模型, 表明了该方法的应用价值; 最后, 总结了相关源信号分离中存在的问题, 并对下一步的研究思路进行了分析和展望.

     

基于矩阵对角化变换的高阶容积卡尔曼滤波

为了提高高阶容积卡尔曼滤波器(CKF)的滤波性能, 提出一种基于矩阵对角化变换的高阶CKF 算法. 该算法基于高阶容积准则, 利用矩阵对角化变换代替标准高阶CKF 中的Cholesky 分解, 使得协方差矩阵分解后的平方根矩阵保留了原有的特征空间信息, 状态统计量计算更加准确, 从而提高了滤波精度; 同时, 矩阵对角化变换不要求协方差矩阵正定, 增强了算法滤波稳定性. 仿真结果表明, 所提出的算法是可行而有效的, 明显改善了标准高阶CKF 的滤波效果.

     

求解双层规划优化问题的层次风驱动优化算法

针对双层规划的求解问题, 提出一种层次风驱动优化算法. 初始化上层优化变量后, 首先对下层规划进行求解, 满足约束条件的同时, 更新下层规划中的空气质点速度和位置; 然后, 利用风驱动优化算法对上层规划问题进行求解; 最后, 在优化解集合中, 选择上下层规划目标值次序之和最小的解作为最终优化解. 实验结果表明, 所提出的层次风驱动算法是一种有效的求解双层规划问题的方法.

     

多编组协同任务分配模型及DLS-QGA 算法求解

为解决多智能体编组协同任务分配问题, 定义任务、智能体编组和相关的分配过程变量, 建立以最高任务执行效率为目标的数学模型. 在问题模型中设计考虑资源损耗的编组资源能力更新机制, 提出用于求解该模型的动态列表规划和量子遗传算法的混合任务分配算法, 使用动态列表规划选择处理的任务, 利用量子遗传算法为选定任务分配最合适编组. 最后通过算例表明, 所提出的方法在解决时序逻辑任务分配时能够得到更优更稳定的方案.

     

基于独立成分分析和IHS变换域的灰度可见光和红外图像融合

针对灰度可见光和红外图像的融合图像缺乏色彩信息、图像的高阶信息在变换域中统计独立性不足的缺陷, 提出一种基于独立分量分析和IHS (亮度-色度-饱和度) 变换域的融合方法. 该方法利用IHS 变换域能够有效分离图像亮度分量和彩色信息的优势, 对灰度可见光图像建立灰度图像的彩色传递模型. 利用各分量的独立性进行基于独立分量分析和IHS 变换域的图像融合, 并得到最终的彩色融合图像, 使融合图像更加符合人类视觉要求. 仿真实验验证了所提出算法的有效性.

     

基于PI 观测器的奇异摄动系统故障诊断和最优容错控制

针对线性奇异摄动系统, 提出一种基于PI (proportional integral) 观测器的故障诊断和最优容错控制方法. 基于奇异摄动系统相关理论和矩阵变换技术, 给出PI 全维观测器存在的条件, 该观测器可以观测系统的快慢状态和故障系统的状态. 在估测到系统状态的基础上进一步考虑最优性, 应用最优控制理论, 设计状态反馈控制器, 提出基于PI 观测器的故障诊断器和最优容错控制器的设计方法. 最后的数值算例验证了所提出方法的可行性和正确性.

     

一种新的实时智能汽车轨迹规划方法

针对智能汽车的驾驶决策和轨迹规划问题, 将轨迹表示为轨迹曲线和加速度变化两部分, 以优化轨迹的行驶效率、安全性、舒适性和经济性为目标建立非线性规划模型. 基于序优化思想, 提出混合智能优化算法OODE, 分内、外两层分别优化加速度变化和轨迹曲线, 通过“粗糙” 评价轨迹曲线实现轨迹曲线的快速择优. 仿真结果表明, 所提出的方法能够处理包含多动态障碍物的复杂交通场景, 且具备实时应用能力, 模型的精度和求解速度均优于传统方法.

     

不确定切换线性系统状态和未知输入估计方法

针对具有未知输入的不确定切换线性系统, 在平均驻留时间切换下, 讨论其状态和未知输入估计方法. 通过等价变换解耦切换系统的未知输入, 以构造降维切换系统. 进而, 设计切换观测器实现对原系统的状态估计, 并求解具有线性矩阵不等式限制的最优化问题, 得到观测器存在的充分条件. 在基于函数微分数值解方法求得系统输出微分的基础上, 提出一种切换系统未知输入的估计方法. 最后通过一个数值实例验证了所提出方法的有效性.

     

网络化切换控制系统故障检测与优化设计

研究存在未知短时延、丢包和系统不确定性的网络化切换控制系统故障检测与时域优化问题. 首先基 于观测器构建残差发生器, 结合Lyapunov 函数方法和平均驻留时间方法分析系统的稳定性, 并以线性矩阵不等式(LMI) 形式给出故障检测滤波器的求解方法; 然后为了改善故障检测系统的性能, 采用后置滤波器对残差信号进行时域优化, 并利用奇偶空间方法给出其最优解; 最后设计并推导出自适应阈值. 仿真结果验证了所提出方法的有效性.

     

一种新的联合块对角化卷积盲分离时域算法

提出一种基于高阶累积量联合块对角化的时域算法求解卷积混合盲信号分离问题。引入白化处理,将混叠矩阵转变成酉矩阵,混合信号转变为互不相关的,进而计算出其对应的一系列高阶累积量矩阵,通过最小化代价函数来实现高阶累积量矩阵联合块对角化的目的,在时域中解决超定卷积盲分离问题。实验表明,相比于经典的自然梯度算法,所提方法的分离精度更高,且运算速度也更快。     

基于稳健联合分块对角化的卷积盲分离

针对卷积盲分离问题,提出一种新的矩阵联合分块对角化(Joint block diagonalization, JBD)算法. 现有的迭代非正交联合分块对角化算法都存在不收敛的情况,本文利用分离矩阵的特殊结构确保其可逆性,使得算法的迭代过程稳定. 在已知矩阵分块结构的条件下,首先,将卷积盲分离模型写成瞬时形式,并说明其满足联合分块对角化结构; 然后,提出联合分块对角化的代价函数,依据代价函数的最小化等价于矩阵中每个分块的范数最小化, 将整个分离矩阵的迭代更新转化成每个分块的迭代更新;最后,利用最小化条件得到迭代算法. 实数和复数两种情况下的算法都进行了推导.基本实验验证了新算法在不同条件下的性能; 仿真实验中对在时域和频域都重叠的信号的卷积混合进行盲分离,实验结果验证了新算法具有更好的分离性能和更稳定的分离能力.     

An iterative inversion approach to blind source separation

We present an iterative inversion (II) approach to blind source separation (BSS). It consists of a quasi-Newton method for the resolution of an estimating equation obtained from the implicit inversion of a robust estimate of the mixing system. The resulting learning rule includes several existing algorithms for BSS as particular cases giving them a novel and unified interpretation. It also provides a justification of the Cardoso and Laheld (1996) step size normalization. The II method is first presented for instantaneous mixtures and then extended to the problem of blind separation of convolutive mixtures. Finally, we derive the necessary and sufficient asymptotic stability conditions for both the instantaneous and convolutive methods to converge.     

A new concept for separability problems in blind source separation

The goal of blind source separation (BSS) lies in recovering the original independent sources of a mixed random vector without knowing the mixing structure. A key ingredient for performing BSS successfully is to know the indeterminacies of the problem-that is, to know how the separating model relates to the original mixing model (separability). For linear BSS, Comon (1994) showed using the Darmois-Skitovitch theorem that the linear mixing matrix can be found except for permutation and scaling. In this work, a much simpler, direct proof for linear separability is given. The idea is based on the fact that a random vector is independent if and only if the Hessian of its logarithmic density (resp. characteristic function) is diagonal everywhere. This property is then exploited to propose a new algorithm for performing BSS. Furthermore, first ideas of how to generalize separability results based on Hessian diagonalization to more complicated nonlinear models are studied in the setting of postnonlinear BSS.     

Mixing Audiovisual Speech Processing and Blind Source Separation for the Extraction of Speech Signals From Convolutive Mixtures

Looking at the speaker's face can be useful to better hear a speech signal in noisy environment and extract it from competing sources before identification. This suggests that the visual signals of speech (movements of visible articulators) could be used in speech enhancement or extraction systems. In this paper, we present a novel algorithm plugging audiovisual coherence of speech signals, estimated by statistical tools, on audio blind source separation (BSS) techniques. This algorithm is applied to the difficult and realistic case of convolutive mixtures. The algorithm mainly works in the frequency (transform) domain, where the convolutive mixture becomes an additive mixture for each frequency channel. Frequency by frequency separation is made by an audio BSS algorithm. The audio and visual informations are modeled by a newly proposed statistical model. This model is then used to solve the standard source permutation and scale factor ambiguities encountered for each frequency after the audio blind separation stage. The proposed method is shown to be efficient in the case of 2 times 2 convolutive mixtures and offers promising perspectives for extracting a particular speech source of interest from complex mixtures     

Fast nonunitary joint block diagonalization with degenerate solution elimination for convolutive blind source separation

This paper addresses the problem of joint block diagonalization (JBD) of a set of given matrices. As is known that the nonunitary JBD algorithm has some advantages over the existing orthogonal one for convolutive blind source separation (CBSS). However, the nonunitary JBD algorithm is prone to converge to some unexpected degenerate solutions (singular or ill-conditioned solutions). Especially for the matrices of large dimension or the case that the number of the diagonal blocks is relatively large, the performances of the nonunitary JBD algorithm degrade more severely. To eliminate the degenerate solutions, we optimize a penalty term based weighted least-squares criterion and thus develop a fast efficient algorithm. The performance of the proposed algorithm is evaluated by computer simulations and compared with the existing state-of-the-art nonunitary JBD algorithm. The simulation results demonstrate the robustness and performance improvement of the proposed algorithm.     

非正交联合对角化的罚函数粒子群算法

针对多个矩阵近似联合对角化盲分离问题,提出一种新的非正交近似联合对角化算法.首先采用罚函数法将联合对角化的非线性约束优化模型转化为无约束优化模型;其次将粒子群优化算法引入无约束优化模型中实现目标函数的最优化,从而完成矩阵组的联合对角化.分析了惩罚因子的更新策略及算法的收敛性能,并设计仿真实验进行对比分析以检验算法解决实际盲分离问题的能力.     

Nonorthogonal Approximate Joint Diagonalization With Well-Conditioned Diagonalizers

To make the results reasonable, existing joint diagonalization algorithms have imposed a variety of constraints on diagonalizers. Actually, those constraints can be imposed uniformly by minimizing the condition number of diagonalizers. Motivated by this, the approximate joint diagonalization problem is reviewed as a multiobjective optimization problem for the first time. Based on this, a new algorithm for nonorthogonal joint diagonalization is developed. The new algorithm yields diagonalizers which not only minimize the diagonalization error but also have as small condition numbers as possible. Meanwhile, degenerate solutions are avoided strictly. Besides, the new algorithm imposes few restrictions on the target set of matrices to be diagonalized, which makes it widely applicable. Primary results on convergence are presented and we also show that, for exactly jointly diagonalizable sets, no local minima exist and the solutions are unique under mild conditions. Extensive numerical simulations illustrate the performance of the algorithm and provide comparison with other leading diagonalization methods. The practical use of our algorithm is shown for blind source separation (BSS) problems, especially when ill-conditioned mixing matrices are involved.