基于改进MobileFaceNet的人脸识别方法北大核心

针对目前大多数人脸识别算法参数多、计算量大,难以部署到移动端和嵌入式设备中的问题,提出了一种基于改进MobileFaceNet的人脸识别方法。通过对MobileFaceNet模型结构的调整,将bottleneck模块优化为sandglass模块,改良深度卷积和逐点卷积的相对位置,适当增大sandglass模块的输出通道数,从而减少特征压缩时的信息丢失,增强人脸空间特征的提取。实验结果表明:改进后的方法在LFW测试数据集上准确率达99.15%,模型大小和计算量分别仅为原算法的61%和45%,验证了所提方法的有效性。     

一种基于FCOS神经网络的小建筑物目标检测方法北大核心

提出了一种基于FCOS神经网络的小建筑物目标检测算法,针对FCOS模型在特征提取阶段提取到的小建筑物目标特征较少问题,引入多尺度检测和可变形卷积方式,加强网络对小建筑物目标的特征提取能力,并通过改进后的SGE注意力机制降低特征图中的干扰噪声权重。改进后的网络可以提取到更多的小建筑物目标特征,对环境干扰噪声的鲁棒性更强。在自己搭建的数据集上进行了实验测试,结果表明,在相同环境下网络改进后建筑物的整体检测准确率提升了1.7%,其中对小建筑物目标提升了3.6%,减少了小建筑物目标漏检、误检的问题。     

一种基于抽取LMS的距离旁瓣抑制方法

在噪声雷达中，传统相关处理方法的距离旁瓣受到时宽带宽积的限制，在有限相关处理时间内得到的距离旁瓣较高，会造成微弱目标被强目标、杂波旁瓣淹没的现象。提出一种基于抽取最小均方（Least Mean Square,LMS）滤波的噪声雷达旁瓣抑制方法，将LMS滤波器的系数作为距离压缩结果，从而获取较低的距离旁瓣。对该方法的性能进行了理论分析，并通过数字仿真验证了算法的有效性和理论分析的正确性。     

Collaborative Distribution Alignment for 2D image-based 3D shape retrieval

Retrieving 3D shapes with 2D images has become a popular research area nowadays, and a great deal of work has been devoted to reducing the discrepancy between 3D shapes and 2D images to improve retrieval performance. However, most approaches ignore the semantic information and decision boundaries of the two domains, and cannot achieve both domain alignment and category alignment in one module. In this paper, a novel Collaborative Distribution Alignment (CDA) model is developed to address the above existing challenges. Specifically, we first adopt a dual-stream CNN, following a similarity guided constraint module, to generate discriminative embeddings for input 2D images and 3D shapes (described as multiple views). Subsequently, we explicitly introduce a joint domain-class alignment module to dynamically learn a class-discriminative and domain-agnostic feature space, which can narrow the distance between 2D image and 3D shape instances of the same underlying category, while pushing apart the instances from different categories. Furthermore, we apply a decision boundary refinement module to avoid generating class-ambiguity embeddings by dynamically adjusting inconsistencies between two discriminators. Extensive experiments and evaluations on two challenging benchmarks, MI3DOR and MI3DOR-2, demonstrate the superiority of the proposed CDA method for 2D image-based 3D shape retrieval task.     

Farmers' preferences for adopting on-farm concentration of raw milk: Results from a discrete choice experiment in Germany

Milk concentrates are used in the manufacturing of dairy products such as yogurt and cheese or are processed into milk powder. Processes for the nonthermal separation of water and valuable milk ingredients are becoming increasingly widespread at farm level. The technical barriers to using farm-manufactured milk concentrate in dairies are minimal, hence the suspicion that the practice of on-farm raw milk concentration is still fairly uncommon for economic reasons. This study, therefore, set out to investigate farmers' potential willingness to adopt a raw milk concentration plant. The empirical analysis was based on discrete choice experiments with 75 German dairy farmers to identify preferences and the possible adoption of on-farm raw milk concentration. The results showed that, in particular, farmers who deemed the current milk price to be insufficient viewed on-farm concentration using membrane technology as an option for diversifying their milk sales. We found no indication that adoption would be impeded by a lack of trustworthy information on milk processing technologies or capital.     

一种直升机避障电力线检测方法

电力线是一类形状细长、特征稀疏、随着视角的变化容易混淆在大量背景信息中的特殊障碍物，常规电力线检测识别算法得到的目标框对电力线所在位置的估计不够准确。为此，提出了一种相对角度估计方法，基于常规电力线目标检测与识别算法，并结合电力线相对角度估计，从而提高电力线的检测识别过程中所在位置的精度。相比电力线绝对角度回归的方法，提出的相对角度估计方法容易训练易收敛，计算量小，适用于实时性要求较高的应用场合。     

疫情下电磁场理论课程的网络教学

本文主要总结了新冠疫情期间作者的电磁场理论课程在线教学经验。对比分析了录播和直播的优缺点后,选择录播教学方式。基于超星网络教学平台,展示了录播网络教学的具体措施,包括网上答疑和学习效果检查以及在线批改作业等。给出了网络教学可以为线下教学继续使用的方法和手段,为疫情结束后的正常教学提供了新的网络教学补充措施。     

Probabilistic learning on manifolds (PLoM) with partition

The probabilistic learning on manifolds (PLoM) introduced in 2016 has solved difficult supervised problems for the “small data” limit where the number N of points in the training set is small. Many extensions have since been proposed, making it possible to deal with increasingly complex cases. However, the performance limit has been observed and explained for applications for which N is very small and for which the dimension of the diffusion-map basis is close to N. For these cases, we propose a novel extension based on the introduction of a partition in independent random vectors. We take advantage of this development to present improvements of the PLoM such as a simplified algorithm for constructing the diffusion-map basis and a new mathematical result for quantifying the concentration of the probability measure in terms of a probability upper bound. The analysis of the efficiency of this extension is presented through two applications.