基于SSD与FaceNet的人脸识别系统设计

人脸识别技术广泛应用于考勤管理、移动支付等智慧建设中。伴随着常态化的口罩干扰,传统人脸识别算法已无法满足实际应用需求,为此,本文利用深度学习模型SSD以及FaceNet模型对人脸识别系统展开设计。首先,为消除现有数据集中亚洲人脸占比小造成的类内间距变化差距不明显的问题,在CAS-IA Web Face公开数据集的基础上对亚洲人脸数据进行扩充;其次,为解决不同口罩样式对特征提取的干扰,使用SSD人脸检测模型与DLIB人脸关键点检测模型提取人脸关键点,并利用人脸关键点与口罩的空间位置关系,额外随机生成不同的口罩人脸,组成混合数据集;最后,在混合数据集上进行模型训练并将训练好的模型移植到人脸识别系统中,进行检测速度与识别精度验证。实验结果表明,系统的实时识别速度达20 fps以上,人脸识别模型准确率在构建的混合数据集中达到97.1%,在随机抽取的部分LFW数据集验证的准确率达99.7%,故而该系统可满足实际应用需求,在一定程度上提高人脸识别的鲁棒性与准确性。

Dual-Path Vision Transformer用于急性缺血性脑卒中辅助诊断

急性缺血性脑卒中是由于脑组织血液供应障碍导致的脑功能障碍,数字减影脑血管造影(DSA)是诊断脑血管疾病的金标准。基于患者的正面和侧面DSA图像,对急性缺血性脑卒中的治疗效果进行分级评估,构建基于Vision Transformer的双路径图像分类智能模型DPVF。为了提高辅助诊断速度,基于EdgeViT的轻量化设计思想进行了模型的构建;为了使模型保持轻量化的同时具有较高的精度,提出空间-通道自注意力模块,促进Transformer模型捕获更全面的特征信息,提高模型的表达能力;此外,对于DPVF的两分支的特征融合,构建交叉注意力模块对两分支输出进行交叉融合,促使模型提取更丰富的特征,从而提高模型表现。实验结果显示DPVF在测试集上的准确率达98.5%,满足实际需求。

基于YOLO5Face重分布的小尺度人脸检测方法

针对复杂场景下小尺度人脸检测精度较低的问题,提出了一种基于YOLO5Face重分布的小尺度人脸检测方法。方法以YOLO5Face为基础,在网络浅层引入改进的CBAM注意力并对模型计算重分布,提升复杂场景下小尺度人脸检测精度的同时降低模型参数量;采用融合mixup的数据增强方法,充分训练模型小尺度人脸检测分支;依据人脸检测特性,将softmax损失作为分类损失以最大化类间特征的差异。在WiderFace各个子集上的实验结果表明,与主流人脸检测方法相比,改进后的模型满足实时性的同时,小尺度人脸检测精度较高,其中Hard子集检测精度比YOLO5Face提升2个百分点。

VR/AR-AdaptFace:面向虚拟现实与增强现实的自适应多模态面部替换模型

随着VR/AR技术的迅猛发展,用户对于沉浸式体验的需求日益增长。同时,虚拟人脸技术亦趋成熟。基于此,本文探索将高度拟真的虚拟人脸融入VR/AR,以增强用户体验的自然度与沉浸感。然而,在虚拟数字人领域,图像生成及换脸技术在VR/AR环境下仍遇诸多挑战,尤其是唇形合成模型在动态场景及多语言环境下的性能需进一步优化。为解决上述问题,本文提出VR/AR-AdaptFace模型,一个面向虚拟现实与增强现实的自适应多模态面部替换方案。该模型由两大模块构成:“文颜绘真”模块,采用先进的文本至图像转换技术和特定类别先验保存策略,优化虚拟人脸生成,并通过注意力机制大幅提升图像质量;“语唇映生”模块,依托强大的生成器、唇形同步判别器及视觉质量判别器,实现语音与唇形的精准同步,为VR/AR场景中的动态交互带来更加逼真的体验。

LSTM-DPPO based deep reinforcement learning controller for path following optimization of unmanned surface vehicle

To solve the path following control problem for unmanned surface vehicles(USVs),a control method based on deep reinforcement learning(DRL)with long short-term memory(LSTM)networks is proposed.A distributed proximal policy opti-mization(DPPO)algorithm,which is a modified actor-critic-based type of reinforcement learning algorithm,is adapted to improve the controller performance in repeated trials.The LSTM network structure is introduced to solve the strong temporal cor-relation USV control problem.In addition,a specially designed path dataset,including straight and curved paths,is established to simulate various sailing scenarios so that the reinforcement learning controller can obtain as much handling experience as possible.Extensive numerical simulation results demonstrate that the proposed method has better control performance under missions involving complex maneuvers than trained with limited scenarios and can potentially be applied in practice.

The Coordinated Influence of Indian Ocean Sea Surface Temperature and Arctic Sea Ice on Anomalous Northeast China Cold Vortex Activities with Different Paths during Late Summer

The Northeast China cold vortex(NCCV)during late summer(from July to August)is identified and classified into three types in terms of its movement path using machine learning.The relationships of the three types of NCCV intensity with atmospheric circulations in late summer,the sea surface temperature(SST),and Arctic sea ice concentration(SIC)in the preceding months,are analyzed.The sensitivity tests by the Community Atmosphere Model version 5.3(CAM5.3)are used to verify the statistical results.The results show that the coordination pattern of East Asia-Pacific(EAP)and Lake Baikal high pressure forced by SST anomalies in the North Indian Ocean dipole mode(NIOD)during the preceding April and SIC anomalies in the Nansen Basin during the preceding June results in an intensity anomaly for the first type of NCCV.While the pattern of high pressure over the Urals and Okhotsk Sea and low pressure over Lake Baikal during late summer-which is forced by SST anomalies in the South Indian Ocean dipole mode(SIOD)in the preceding June and SIC anomalies in the Barents Sea in the preceding April-causes the intensity anomaly of the second type.The third type is atypical and is not analyzed in detail.Sensitivity tests,jointly forced by the SST and SIC in the preceding period,can well reproduce the observations.In contrast,the results forced separately by the SST and SIC are poor,indicating that the NCCV during late summer is likely influenced by the coordinated effects of both SST and SIC in the preceding months.

Probabilistic analysis of tunnel face seismic stability in layered rock masses using Polynomial Chaos Kriging metamodel

Face stability is an essential issue in tunnel design and construction.Layered rock masses are typical and ubiquitous;uncertainties in rock properties always exist.In view of this,a comprehensive method,which combines the Upper bound Limit analysis of Tunnel face stability,the Polynomial Chaos Kriging,the Monte-Carlo Simulation and Analysis of Covariance method(ULT-PCK-MA),is proposed to investigate the seismic stability of tunnel faces.A two-dimensional analytical model of ULT is developed to evaluate the virtual support force based on the upper bound limit analysis.An efficient probabilistic analysis method PCK-MA based on the adaptive Polynomial Chaos Kriging metamodel is then implemented to investigate the parameter uncertainty effects.Ten input parameters,including geological strength indices,uniaxial compressive strengths and constants for three rock formations,and the horizontal seismic coefficients,are treated as random variables.The effects of these parameter uncertainties on the failure probability and sensitivity indices are discussed.In addition,the effects of weak layer position,the middle layer thickness and quality,the tunnel diameter,the parameters correlation,and the seismic loadings are investigated,respectively.The results show that the layer distributions significantly influence the tunnel face probabilistic stability,particularly when the weak rock is present in the bottom layer.The efficiency of the proposed ULT-PCK-MA is validated,which is expected to facilitate the engineering design and construction.

Rock mass quality prediction on tunnel faces with incomplete multi-source dataset via tree-augmented naive Bayesian network

Rock mass quality serves as a vital index for predicting the stability and safety status of rock tunnel faces.In tunneling practice,the rock mass quality is often assessed via a combination of qualitative and quantitative parameters.However,due to the harsh on-site construction conditions,it is rather difficult to obtain some of the evaluation parameters which are essential for the rock mass quality prediction.In this study,a novel improved Swin Transformer is proposed to detect,segment,and quantify rock mass characteristic parameters such as water leakage,fractures,weak interlayers.The site experiment results demonstrate that the improved Swin Transformer achieves optimal segmentation results and achieving accuracies of 92%,81%,and 86%for water leakage,fractures,and weak interlayers,respectively.A multisource rock tunnel face characteristic(RTFC)dataset includes 11 parameters for predicting rock mass quality is established.Considering the limitations in predictive performance of incomplete evaluation parameters exist in this dataset,a novel tree-augmented naive Bayesian network(BN)is proposed to address the challenge of the incomplete dataset and achieved a prediction accuracy of 88%.In comparison with other commonly used Machine Learning models the proposed BN-based approach proved an improved performance on predicting the rock mass quality with the incomplete dataset.By utilizing the established BN,a further sensitivity analysis is conducted to quantitatively evaluate the importance of the various parameters,results indicate that the rock strength and fractures parameter exert the most significant influence on rock mass quality.

VanillaFaceNet:一种高精度快速推理的牛脸识别方法

快速精准确定牛只身份对于牛只活体贷款,改善牛只骗保等问题具有重要意义。针对不同牛只面部差异小,FaceNet网络层数深,推理速度较慢,模型分类精度不足等问题,该研究提出了基于FaceNet的牛脸识别方法-VanillaFaceNet。该方法首先将FaceNet的主干特征提取网络替换为极简网络VanillaNet-13并提出动态激活和增强型线性变换的激活函数两种方法提高网络的非线性;然后,提出一种新的DBCA(dual-branch coordinate attention)注意力模块,能够更好地反映不同牛只面部特征之间的差异,从而提高网络的识别精度;最后,针对triplet loss仅能减小牛只类间差异的问题,采用center-triplet loss联合监督来减少牛只类内差异,从而提高了相同牛只身份比对的准确性。基于自建的牛脸数据集对该模型进行训练和测试,试验结果表明,VanillaFaceNet对牛只识别的准确率达到88.21%,每秒传输帧数为26.23帧。与FaceNet、MobileFaceNet、CenterFace、CosFace和ArcFace算法相比,本文算法的识别准确率分别提高了2.99、9.58、6.26、3.85和4.49个百分点,推理速度分别提升了2.67、0.77、0.10、1.28和0.94帧/s。该模型对牛只有较为优秀的识别效果,适于在嵌入式设备上部署,实现了牛只面部识别精度和推理速度之间的平衡。

基于改进YOLOv5s-face的Face5系列人脸检测算法

针对人脸检测中小尺度人脸和遮挡人脸的漏检问题,提出了一种基于改进YOLOv5s-face(you only look once version 5 small-face)的Face5系列人脸检测算法Face5S(face5 small)和Face5M(face5 medium)。使用马赛克(mosaic)和图像混合(mixup)数据增强方法,提升算法在复杂场景下检测人脸的泛化性和稳定性;通过改进C3的网络结构和引入可变形卷积(DCNv2)降低算法的参数量,提高算法提取特征的灵活性;通过引入特征的内容感知重组上采样算子(CARAFE),提高多尺度人脸的检测性能;引入损失函数WIoUV3(wise intersection over union version 3),提升算法的小尺度人脸检测性能。实验结果表明,在WIDER FACE验证集上,相较于YOLOv5s-face算法,Face5S算法的平均mAP@0.5提升了1.03%;相较于先进的人脸检测算法ASFD-D3(automatic and scalable face detector-D3)和TinaFace,Face5M算法的平均mAP@0.5分别提升了1.07%和2.11%,提出的Face5系列算法能够有效提升算法对小尺度和部分遮挡人脸的检测性能,同时具有实时性。

Stability analysis of tunnel face reinforced with face bolts

Face bolting has been widely utilized to enhance the stability of tunnel face,particularly in soft soil tunnels.However,the influence of bolt reinforcement and its layout on tunnel face stability has not been systematically studied.Based on the theory of linear elastic mechanics,this study delved into the specific mechanisms of bolt reinforcement on the tunnel face in both horizontal and vertical dimensions.It also identified the primary failure types of bolts.Additionally,a design approach for tunnel face bolts that incorporates spatial layout was established using the limit equilibrium method to enhance the conventional wedge-prism model.The proposed model was subsequently validated through various means,and the specific influence of relevant bolt design parameters on tunnel face stability was analyzed.Furthermore,design principles for tunnel face bolts under different geological conditions were presented.The findings indicate that bolt failure can be categorized into three stages:tensile failure,pullout failure,and comprehensive failure.Increasing cohesion,internal friction angle,bolt density,and overlap length can effectively enhance tunnel face stability.Due to significant variations in stratum conditions,tailored design approaches based on specific failure stages are necessary for bolt design.

Enhancing Critical Path Problem in Neutrosophic Environment Using Python

In the real world,one of the most common problems in project management is the unpredictability of resources and timelines.An efficient way to resolve uncertainty problems and overcome such obstacles is through an extended fuzzy approach,often known as neutrosophic logic.Our rigorous proposed model has led to the creation of an advanced technique for computing the triangular single-valued neutrosophic number.This innovative approach evaluates the inherent uncertainty in project durations of the planning phase,which enhances the potential significance of the decision-making process in the project.Our proposed method,for the first time in the neutrosophic set literature,not only solves existing problems but also introduces a new set of problems not yet explored in previous research.A comparative study using Python programming was conducted to examine the effectiveness of responsive and adaptive planning,as well as their differences from other existing models such as the classical critical path problem and the fuzzy critical path problem.The study highlights the use of neutrosophic logic in handling complex projects by illustrating an innovative dynamic programming framework that is robust and flexible,according to the derived results,and sets the stage for future discussions on its scalability and application across different industries.

Optimal search path planning of UUV in battlefeld ambush scene

Aiming at the practical application of Unmanned Underwater Vehicle(UUV)in underwater combat,this paper proposes a battlefield ambush scene with UUV considering ocean current.Firstly,by establishing these mathematical models of ocean current environment,target movement,and sonar detection,the probability calculation methods of single UUV searching target and multiple UUV cooperatively searching target are given respectively.Then,based on the Hybrid Quantum-behaved Particle Swarm Optimization(HQPSO)algorithm,the path with the highest target search probability is found.Finally,through simulation calculations,the influence of different UUV parameters and target parameters on the target search probability is analyzed,and the minimum number of UUVs that need to be deployed to complete the ambush task is demonstrated,and the optimal search path scheme is obtained.The method proposed in this paper provides a theoretical basis for the practical application of UUV in the future combat.

An Improved Bounded Conflict-Based Search for Multi-AGV Pathfinding in Automated Container Terminals

As the number of automated guided vehicles(AGVs)within automated container terminals(ACT)continues to rise,conflicts have becomemore frequent.Addressing point and edge conflicts ofAGVs,amulti-AGVconflict-free path planning model has been formulated to minimize the total path length of AGVs between shore bridges and yards.For larger terminalmaps and complex environments,the grid method is employed to model AGVs’road networks.An improved bounded conflict-based search(IBCBS)algorithmtailored to ACT is proposed,leveraging the binary tree principle to resolve conflicts and employing focal search to expand the search range.Comparative experiments involving 60 AGVs indicate a reduction in computing time by 37.397%to 64.06%while maintaining the over cost within 1.019%.Numerical experiments validate the proposed algorithm’s efficacy in enhancing efficiency and ensuring solution quality.

Generating animatable 3D cartoon faces from single portraits

Background With the development of virtual reality(VR)technology,there is a growing need for customized 3D avatars.However,traditional methods for 3D avatar modeling are either time-consuming or fail to retain the similarity to the person being modeled.This study presents a novel framework for generating animatable 3D cartoon faces from a single portrait image.Methods First,we transferred an input real-world portrait to a stylized cartoon image using StyleGAN.We then proposed a two-stage reconstruction method to recover a 3D cartoon face with detailed texture.Our two-stage strategy initially performs coarse estimation based on template models and subsequently refines the model by nonrigid deformation under landmark supervision.Finally,we proposed a semantic-preserving face-rigging method based on manually created templates and deformation transfer.Conclusions Compared with prior arts,the qualitative and quantitative results show that our method achieves better accuracy,aesthetics,and similarity criteria.Furthermore,we demonstrated the capability of the proposed 3D model for real-time facial animation.

A Multi-Constraint Path Optimization Scheme Based on Information Fusion in Software Defined Network

The existingmultipath routing in Software Defined Network (SDN) is relatively blind and inefficient, and there is alack of cooperation between the terminal and network sides, making it difficult to achieve dynamic adaptationof service requirements and network resources. To address these issues, we propose a multi-constraint pathoptimization scheme based on information fusion in SDN. The proposed scheme collects network topology andnetwork state information on the network side and computes disjoint paths between end hosts. It uses the FuzzyAnalytic Hierarchy Process (FAHP) to calculate the weight coefficients of multiple constrained parameters andconstructs a composite quality evaluation function for the paths to determine the priority of the disjoint paths. TheSDN controller extracts the service attributes by analyzing the packet header and selects the optimal path for flowrule forwarding. Furthermore, the service attributes are fed back to the path composite quality evaluation function,and the path priority is dynamically adjusted to achieve dynamic adaptation between service requirements andnetwork status. By continuously monitoring and analyzing the service attributes, the scheme can ensure optimalrouting decisions in response to varying network conditions and evolving service demands. The experimentalresults demonstrated that the proposed scheme can effectively improve average throughput and link utilizationwhile meeting the Quality of Service (QoS) requirements of various applications.

Sparse representation scheme with enhanced medium pixel intensity for face recognition

Sparse representation is an effective data classification algorithm that depends on the known training samples to categorise the test sample.It has been widely used in various image classification tasks.Sparseness in sparse representation means that only a few of instances selected from all training samples can effectively convey the essential class-specific information of the test sample,which is very important for classification.For deformable images such as human faces,pixels at the same location of different images of the same subject usually have different intensities.Therefore,extracting features and correctly classifying such deformable objects is very hard.Moreover,the lighting,attitude and occlusion cause more difficulty.Considering the problems and challenges listed above,a novel image representation and classification algorithm is proposed.First,the authors’algorithm generates virtual samples by a non-linear variation method.This method can effectively extract the low-frequency information of space-domain features of the original image,which is very useful for representing deformable objects.The combination of the original and virtual samples is more beneficial to improve the clas-sification performance and robustness of the algorithm.Thereby,the authors’algorithm calculates the expression coefficients of the original and virtual samples separately using the sparse representation principle and obtains the final score by a designed efficient score fusion scheme.The weighting coefficients in the score fusion scheme are set entirely automatically.Finally,the algorithm classifies the samples based on the final scores.The experimental results show that our method performs better classification than conventional sparse representation algorithms.

Depth First:Optimal Path Discovery Between Designated Nodes in Random Ring-Based Graphs

This paper focuses on optimally determining the existence of connected paths between some given nodes in random ring-based graphs.Serving as a fundamental underlying structure in network modeling,ring topology appears as commonplace in many realistic scenarios.Regarding this,we consider graphs composed of rings,with some possible connected paths between them.Without prior knowledge of the exact node permutations on rings,the existence of each edge can be unraveled through edge testing at a unit cost in one step.The problem examined is that of determining whether the given nodes are connected by a path or separated by a cut,with the minimum expected costs involved.Dividing the problem into different cases based on different topologies of the ring-based networks,we propose the corresponding policies that aim to quickly seek the paths between nodes.A common feature shared by all those policies is that we stick to going in the same direction during edge searching,with edge testing in each step only involving the test between the source and the node that has been tested most.The simple searching rule,interestingly,can be interpreted as a delightful property stemming from the neat structure of ring-based networks,which makes the searching process not rely on any sophisticated behaviors.We prove the optimality of the proposed policies by calculating the expected cost incurred and making a comparison with the other class of strategies.The effectiveness of the proposed policies is also verified through extensive simulations,from which we even disclose three extra intriguing findings:i)in a onering network,the cost will grow drastically with the number of designated nodes when the number is small and will grow slightly when that number is large;ii)in ring-based network,Depth First is optimal in detecting the connectivity between designated nodes;iii)the problem of multi-ring networks shares large similarity with that of two-ring networks,and a larger number of ties between rings will not influence the expected cost.

Distal-scanning common path probe for optical coherence tomography

In this paper,we present a distal-scanning common path probe for optical coherence tomography(OCT)equipped with a hollow ultrasonic motor and a simple and specially designed beam-splitter.This novel probe proves to be able to effectively circumvent polarization and dispersion mismatch caused by fiber motion and is more robust to a variety of interfering factors during the imaging process,experimentally compared to a conventional noncommon path probe.Furthermore,our design counteracts the attenuation of backscattering with depth and the fall-off of the signal,resulting in a more balanced signal range and greater imaging depth.Spectral-domain OCT imaging of phantom and biological tissue is also demonstrated with a sensitivity of∼100dB and a lateral resolution of∼3μm.This low-cost probe offers simplified system configuration and excellent robustness,and is therefore particularly suitable for clinical diagnosis as one-off medical apparatus.

Mechanical response and dilatancy characteristics of deep marble under different stress paths:A sight from energy dissipation

Dilatancy is a fundamental volumetric growth behavior observed during loading and serves as a key index to comprehending the intricate nonlinear behavior and constitutive equation structure of rock.This study focuses on Jinping marble obtained from the Jinping Underground Laboratory in China at a depth of 2400 m.Various uniaxial and triaxial tests at different strain rates,along with constant confining pressure tests and reduced confining pressure tests under different confining pressures were conducted to analyze the mechanical response and dilatancy characteristics of the marble under four stress paths.Subsequently,a new empirical dilatancy coefficient is proposed based on the energy dissipation method.The results show that brittle failure characteristics of marble under uniaxial compression are more obvious with the strain rate increasing,and plastic failure characteristics of marble under triaxial compression are gradually strengthened.Furthermore,compared to the constant confining pressure,the volume expansion is relatively lower under unloading condition.The energy dissipation is closely linked to the process of dilatancy,with a rapid increase of dissipated energy coinciding with the beginning of dilatancy.A new empirical dilatancy coefficient is defined according to the change trend of energy dissipation rate curve,of which change trend is consistent with the actual dilatancy response in marble under different stress paths.The existing empirical and theoretical dilatancy models are analyzed,which shows that the empirical dilatancy coefficient based on the energy background is more universal.