FSNet: 基于频率特性的烟雾图像分割网络

烟雾图像分割是对烟雾进行识别与精准定位的基础, 是火灾预警的重要手段. 针对烟雾分割时存在过分割、欠分割以及边界拟合粗糙的问题, 本文提出一种基于频率分离特性的烟雾图像分割网络. 所提出的频率分离模块将特征图中的烟雾区域分离为低频主体部分和高频边界部分, 同时基于多任务学习设计多模块权重自适应损失函数对烟雾整体、主体、边界分别监督学习, 起到细化烟雾边界和改善烟雾整体分割结果的作用; 此外, 结合可变形卷积提出改进的空洞空间金字塔池化模块以解决其信息利用率低和特征关联性差的问题. 在对比实验中, FSNet的烟雾交并比为76.55%, 比基线网络提高了4.25%. 可视化分割结果可以看出, FSNet能有效缓解过分割、欠分割, 所得烟雾边界更平滑, 烟雾图像分割的整体性能获得较大提升.     

PointPCA:一种三维空间点云的特征提取算法

点云是一个庞大的点的集合而且拥有重要的几何结构。由于其庞大的数据量,不可避免地就会在某些区域内出现一些相似点,这就使得在进行特征提取时提取到一些重复的信息,造成计算冗余,降低训练的准确率。针对上述问题,提出了一种新的神经网络——PointPCA,可以有效地解决上述问题;在PointPCA中,总共分为三个模块：a）采样模块：提出了一种average point samping（APS）采样方法,可以有效地规避一些相似的点,得到一组近似代表这组点云的新的点集;b）特征提取模块：采用分组中的思想,对这组新的点的集合进行多尺度空间特征提取;c）拼接模块：将每一尺度提取的特征向量拼接到一起组合为一个特征向量。经过实验表明,PointPCA比PointNet在准确率方面提升了4.6%,比PointNet++提升了1.1%;而且在mIoU评估测试中也有不错的效果。     

基于PS-RRT算法的机械臂避障路径规划

针对应用快速搜索随机树（RRT）算法进行机械臂路径规划时,存在采样区域大、有效区域小、路径冗余节点多、剪枝时间长等问题,提出一种基于分区动态采样策略和重复区域节点拒绝机制的高效RRT路径规划算法PS-RRT（partitioned sampling RRT）。首先,通过PS-RRT快速规划机械臂末端初始路径;其次,分段检测机械臂跟随该路径时的连杆碰撞情况,对碰撞路段进行带臂形约束的第二次规划;最后,将初始路径和第二次规划的路径拼接后进行路径裁剪。将所提方法在多种场景中进行仿真验证,结果表明：基于PS-RRT算法的机械臂避障路径规划策略使得无效节点数大幅减少,可高效规划出机械臂的无碰路径,验证了算法的可行性。     

Few-shot node classification via local adaptive discriminant structure learning

Node classification has a wide range of application scenarios such as citation analysis and social network analysis. In many real-world attributed networks, a large portion of classes only contain limited labeled nodes. Most of the existing node classification methods cannot be used for few-shot node classification. To train the model effectively and improve the robustness and reliability of the model with scarce labeled samples, in this paper, we propose a local adaptive discriminant structure learning (LADSL) method for few-shot node classification. LADSL aims to properly represent the nodes in the attributed graphs and learn a metric space with a strong discriminating power by reducing the intra-class variations and enlarging inter-class differences. Extensive experiments conducted on various attributed networks datasets demonstrate that LADSL is superior to the other methods on few-shot node classification task.     

多馈入直流受端电网换相失败风险区域快速识别方法

针对多馈入直流受端电网换相失败风险区域准确识别难题,计及直流控制系统影响,提出基于广义节点电压交互作用因子的风险区域快速识别方法。将交流母线和故障点视为广义节点,构建考虑直流控制影响的广义节点电压交互作用因子指标,并给出其计算方法;建立换流母线电压跌落期间的换流站暂态电路模型,计算临界换相失败风险电压,进而获取指标临界值,依据指标值与临界值的大小进行换相失败风险的判断;结合指标值的故障位置分布特性,提出换相失败风险区域的快速识别方法;在CIGRE HVDC测试系统和含三馈入直流的39节点测试系统中,验证所提计算方法和识别方法的有效性,与传统方法相比,临界换相失败风险电压的计算误差由7.7%降低到2.4%,提高了换相失败风险区域识别的准确性。     

面向网络节点的新能源高占比系统消纳阻力精细化评估

随着新能源装机容量的不断提升,新能源高占比系统弃风弃光问题严峻,开展新能源消纳问题研究,精确定位新能源消纳阻力对提升新能源消纳措施的制定有重要意义。文中提出一种面向网络节点的电力系统新能源消纳阻力精细化评估方法。首先,基于潮流追踪算法将网络节点潮流划分为常规机组注入、新能源注入和负荷流出三部分;其次,从网络节点角度建立调峰、调频及节点电压偏差约束与新能源消纳的数学关系模型,计及三者耦合关系分析网络节点弃电情况;然后,构建基于网络节点的新能源消纳阻力评估模型并求解,定位系统中新能源消纳的关键节点,明确各节点新能源消纳制约因素并量化新能源消纳阻力;最后,基于改进IEEE 39节点系统设计算例,验证了评估方法的有效性。所提评估方法可为电力部门采取措施以提升新能源消纳提供依据。     

A path planning model based on nested regular hexagons using weighted centroid localization

In many wireless sensor network (WSN) applications, the location of a sensor node is crucial for determining where the event or situation of interest occurred. Therefore, localization is one of the critical challenges in WSNs. Mobile anchor node assisted localization (MANAL) is one of the promising solutions for the localization of statically deployed sensors. The main problem in MANAL localization is that the path planning of the mobile anchor (MA) node should be done so that the localization error in the network will be minimal and that all unknown nodes in the network are covered. This paper proposes a new path planning approach called nested hexagons curves (NHexCurves) for MANAL. NHexCurves guarantees that it will receive messages from at least three non-collinear anchors to locate all unknown nodes in the network. The proposed model has compared six different path planning schemes in the literature using weighted centroid localization (WCL). In these comparisons, first of all, localization errors of the models are compared using some statistical concepts. Second, the variation of the localization error according to parameters such as resolution (R) and the standard deviation of noise (σ) is observed. Then, with similar approaches, the standard deviation of errors, localization ratio, scalability performances, and finally, path lengths of the models are examined. The simulation results show that the NHexCurves static path planning model proposed in this study stands out compared to other models with high localization error and localization ratio performance, especially at low resolutions, due to its path design. At the same time, the lowest error values according to σ are obtained with the proposed model among all models considered.     

基于本地差分隐私的空间数据自适应划分算法

空间位置数据分布通常具有不均匀性,不同位置区域的密度差异较大,在本地差分隐私模型中无法直接获取用户真实的位置数据,使得空间位置划分方法受到限制以及数据发布存在查询精度低、通信代价大等问题。为在本地差分隐私模型下的大规模空间数据采集和发布过程中进行空间划分,提出一种空间数据分层自适应划分算法KDG-HT。通过收集部分用户的数据来初步获取区域的分布情况,采用KD-树的思想划分区域,并利用抽样技术对用户进行分组,根据分组用户统计结果所提供的先验知识来完成多层细粒度划分。在此基础上,结合差分隐私模型的并行组合特性分层扰动用户数据,从总体上实现发布数据的ε-差分隐私保护。实验结果表明,KDG-HT算法适用于具有不同数据分布情况的大规模空间数据集,查询精度及运行效率优于RAPPOR、UG、GT-R等算法,其中与GT-R算法相比,KDG-HT算法发布数据的查询精度最高提升3倍,运行效率提高17%。     

室内场景下应用拓扑结构的高效路径规划算法

针对基于随机采样的路径规划算法效率低且采样具有随机性的问题,提出一种应用拓扑结构的高效路径规划算法ATIRRT^*。通过引入拓扑节点代替STIRRT*算法中Harris角点检测算法得到的特征点进行采样,给出基于阈值的自适应选择方法来消除路径骨架上提取的冗余特征点,利用该阈值得到的拓扑节点可以使随机树的扩展更具方向性,从而减少寻找初始路径的时间和代价。根据非单一父节点的连接方式加强交叉支路上的拓扑节点间的联系,通过节点扩充策略增加相邻拓扑节点间的节点数量以加快优化算法的收敛。在此基础上定义相关约束条件将初始路径分段并进行逐段优化,以提高优化算法的效率。在常规环境、狭长空间和仿真的室内环境3种类型地图上的仿真结果表明,相较于STIRRT^*算法,改进算法在规划路径长度上平均减少8%,在规划时间上平均降低10%,可快速地找到更优的初始路径,同时在优化过程中减少了无用的探索空间,提高了搜索效率。     

A spatial variable selection method for monitoring product surface

Two-dimensional (2-D) data maps are generated in certain advanced manufacturing processes. Such maps contain rich information about process variation and product quality status. As a proven effective quality control technique, statistical process control (SPC) has been widely used in different processes for shift detection and assignable cause identification. However, charting algorithms for 2-D data maps are still vacant. This paper proposes a variable selection-based SPC method for monitoring 2-D wafer surface. The fused LASSO algorithm is firstly employed to identify potentially shifted sites on the surface; a charting statistic is then developed to detect statistically significant shifts. As the variable selection algorithm can nicely preserve shift patterns in spatial clusters, the newly proposed chart is proved to be both effective in detecting shifts and capable of providing diagnostic information for process improvement. Extensive Monte Carlo simulations and a real example have been used to demonstrate the effectiveness and usage of the proposed method.