基于改进麻雀搜索算法优化BN的变压器故障诊断研究

针对变压器故障诊断准确率低和稳定性差的问题,文中提出了一种改进麻雀搜索算法优化贝叶斯网络的变压器故障诊断方法。首先,通过计算互信息建立最大支撑树并进行定向处理得到贝叶斯网络初始结构即初始种群。然后,在算法中引入一种新的合作机制和正弦余弦算法,提高算法收敛速度和全局搜索能力,并利用油中溶解气体分析,创建基于改进麻雀搜索算法优化贝叶斯网络的变压器故障诊断模型。最后,为了证明所提方法的优越性,将所提的方法与现有变压器故障诊断方法进行对比。结果表明,文中所提出的方法故障诊断率最高,可以更精准地对变压器进行故障诊断。     

一种3D眼镜虚拟试戴系统的实现

针对人脸图像试戴3D眼镜过程中存在的镜腿遮挡人脸问题,文中提出一种基于人脸图像的3D眼镜虚拟试戴技术。利用构建的人脸形状的三维模型,使其在虚拟试戴中对镜腿起到消隐作用,解决镜腿的遮挡问题。文中对输入的人脸图像进行关键点检测,结合Graham扫描法求得人脸形状的凸多边形,利用平移扫描构建人脸形状的三维模型。此外,文中根据定位人脸图像上的关键点以及姿态估计后对三维眼镜模型的变换,将眼镜模型佩戴到人脸图像上。实验结果表明,该方法对于多视角的人脸图像实现了虚拟试戴效果,解决了多种视角下人脸图像试戴过程中镜腿的遮挡问题,虚拟试戴中镜腿遮挡平均准确率为94.5%,遮挡精度较高。     

Visual video evaluation association modeling based on chaotic pseudo-random multi-layer compressed sensing for visual privacy-protected keyframe extraction

In current society, artificial intelligence processing technology offers convenient video monitoring, but also raises the risk of privacy leakage. Theoretically, the data used in intelligent video processing methods may directly convey visual information containing private content. For the above problem, this paper uses a multi-layer visual privacy-protected (VPP) coding method to blur private content in the video at the visual level, while avoiding the loss of important visual features contained in the video as much as possible. And this provides a guarantee of the quality of the subsequent keyframe extraction step. Then a visual evaluation algorithm is proposed for assessing the quality of VPP-encoded video privacy protection. And the experiment shows that the results are consistent with those of subjective evaluation. In addition, for VPP-encoded video, we propose an unsupervised two-layer clustering keyframe extraction method with corresponding performance evaluation index. Finally, an association model is established to balance the privacy protection quality and the keyframe extraction performance.     

BP神经网络结合变量选择方法在牛奶蛋白质含量检测中的应用北大核心CSCD

牛奶中的蛋白质含量会影响牛奶的品质,利用高光谱图像的光谱特征信息研究对牛奶蛋白质含量预测的可行性。本文提出一种基于竞争性自适应重加权算法(competitive adaptive reweighted sampling, CARS)和连续投影算法(successive projections algorithm, SPA)结合多层前馈神经网络(back propagation, BP)的预测建模方法,实验以含有不同浓度蛋白质的牛奶为对象,利用可见光/近红外高光谱成像系统共采集到5种牛奶共计250组高光谱数据,通过实验对比选择采用标准化方法对获取到的吸收光谱预处理,然后采用CARS结合SPA筛选特征波长,得到18个特征波长,建立CARS-SPA-BP模型,经过试验,CARS-SPA-BP模型的训练集决定系数和测试集决定系数R;和R;分别达到0.971和0.968,训练集均方根误差(root mean square error of calibration,RMSEC)和测试集均方根误差(root mean square error of prediction,RMSEP)达到了0.033和0.034。研究发现,采用CARS结合SPA筛选的牛奶特征波长建立的多层前馈神经网络模型,其模型预测结果与全波长建模相比并没有明显降低,因此将CARS结合SPA用于波长筛选并且结合BP神经网络基本可以完成对牛奶蛋白质含量的预测。为验证CARS-SPA-BP模型的预测能力,在相同数据环境下,使用较为传统的偏最小二乘回归(partial least squares regression, PLSR)进行建模,实验结果表明,CARS-SPA-BP相较于PLSR,R;和RMSEP均有明显提升。研究表明,CARS-SPA-BP可充分利用牛奶光谱特征信息实现较高精度的牛奶蛋白质含量检测。     

组合跳变随机平移宽间隔混沌跳频序列设计

为进一步提高宽间隔跳频序列的性能,基于混沌跳频序列,针对随机平移替代法存在的“窄点”平移与序列平衡性的矛盾问题,提出了一种新的组合跳变随机平移法。该方法在随机平移替代法的基础上取消“窄点”修正,引入组合跳变序列控制频点宽间隔映射。为兼顾组合跳变随机平移法产生序列的平衡性、汉明自相关性和宽间隔特性,构造了跳频序列的复合目标优化函数,引入粒子群算法计算得到最优的序列控制参数。仿真结果表明,组合跳变随机平移法可构造更多的序列,且产生的宽间隔混沌跳频序列具有更好的平衡性、汉明相关性和复杂度,采用粒子群优化获取的控制参数可以实现序列性能的均衡最优。     

面向鲁棒频谱感知的模糊K-means++算法

恶意用户通过向数据融合中心发送伪造的频谱感知数据,解决自身频谱资源短缺问题,但会极大地降低频谱感知系统的检测概率。为了解决此问题,提出了基于模糊K means++的数据融合算法。该算法首先引入模糊处理机制处理样本的数据特征值,以此来增加样本间的差异性;然后将模糊处理后的数据发送到融合中心,融合中心采用离群点挖掘的方法排除恶意用户,并对保留下来的用户进行融合,使样本向量具有鲁棒性;最后运用K means++算法对样本向量进行聚类。该算法利用轮盘法选择聚类中心,可有效抵御恶意用户的攻击,提高系统感知性能;无需知晓信号与噪声的分布等一些先验信息,也避免了繁杂的门限推导。从仿真结果可以看出,该算法对抵御恶意用户攻击具有突出的效果,有效提升了协同频谱感知系统的稳定性和鲁棒性。     

Calibration of a multi-mobile coil magnetic manipulation system utilizing a control-oriented magnetic model

In this paper, we address the calibration of a family of magnetic manipulation systems composed of several coils that are moved around by serial robot manipulators. We show in this paper that the calibration of the whole system ultimately results in calibrating the manipulator and coil separately up to an unknown rigid transformation. For calibration of the coil, we propose to use a model that has not been used so far in the literature; a control-oriented model which is sufficiently accurate and computes the magnetic field in real time. A protocol for calibrating the magnetic manipulation system using the Nelder–Mead algorithm to estimate the model parameters is presented. Calibration was performed through simulations and validated experimentally on a physical system. It was observed that the root mean square error was reduced by 37% after calibration of the physical system, indicating an improvement in accurately estimating the magnetic model.     

基于测量误差不确定性加权的快速相机位姿估计算法

在相机位姿估计任务中,参考点位置的测量容易受测量仪器或者所处环境影响,出现一定程度的测量误差,其中误差较大的点对最终求解精度的影响很大,被称为野值点。文章针对现有算法抗野值点能力较弱的问题,提出一种基于测量误差不确定性加权的快速相机位姿估计算法。该算法以经典的正交迭代算法为基础,引入M估计方法,对目标函数根据参考点的测量误差赋予相应大小的权值,最大程度地将野值点的影响排除,并引入Kronecker积对计算过程进行优化,减少了迭代过程中的冗余计算,提高运算速度。仿真实验结果表明,改进后的算法提升了原算法的抗野值点能力,且计算速度更快。     

A new heuristic algorithm solving the linear ordering problem

The linear ordering problem is an NP-hard combinatorial problem with a large number of applications. Contrary to another very popular problem from the same category, the traveling salesman problem, relatively little space in the literature has been devoted to the linear ordering problem so far. This is particularly true for the question of developing good heuristic algorithms solving this problem.In the paper we propose a new heuristic algorithm solving the linear ordering problem. In this algorithm we made use of the sorting through insertion pattern as well as of the operation of permutation reversal. The surprisingly positive effect of the reversal operation, justified in part theoretically and confirmed in computational examples, seems to be the result of a unique property of the problem, called in the paper the symmetry of the linear ordering problem. This property consists in the fact that if a given permutation is an optimal solution of the problem with the criterion function being maximized, then the reversed permutation is a solution of the problem with the same criterion function being minimized.     

Approximate minimum-cost multicommodity flows in\tilde O(ɛ −2 KNM) timetime

We show that an ε-approximate solution of the cost-constrainedK-commodity flow problem on anN-nodeM-arc network,G can be computed by sequentially solving O(K(? ^?2+logGK) logGM log (G? ^?1 GK)) single-commodity minimum-cost flow problems on the same network. In particular, an approximate minimum-cost multicommodity flow can be computed in $\tilde O$ (G? ^?2 GKNM) running time, where the notation Õ(·) means “up to logarithmic factors”. This result improves the time bound mentioned by Grigoriadis and Khachiyan [4] by a factor ofM/N and that developed more recently by Karger and Plotkin [8] by a factor of? ^?1. We also provide a simple $\tilde O$ (NM)-time algorithm for single-commodity budget-constrained minimum-cost flows which is $\tilde O$ (? ^?3) times faster than the algorithm developed in the latter paper.