期刊文献+
共找到1,011篇文章
< 1 2 51 >
每页显示 20 50 100
Efficient 2-D MUSIC algorithm for super-resolution moving target tracking based on an FMCW radar 被引量:1
1
作者 Xuchong Yi Shuangxi Zhang Yuxuan Zhou 《Geodesy and Geodynamics》 EI CSCD 2024年第5期504-515,共12页
Frequency modulated continuous wave(FMCW)radar is an advantageous sensor scheme for target estimation and environmental perception.However,existing algorithms based on discrete Fourier transform(DFT),multiple signal c... Frequency modulated continuous wave(FMCW)radar is an advantageous sensor scheme for target estimation and environmental perception.However,existing algorithms based on discrete Fourier transform(DFT),multiple signal classification(MUSIC)and compressed sensing,etc.,cannot achieve both low complexity and high resolution simultaneously.This paper proposes an efficient 2-D MUSIC algorithm for super-resolution target estimation/tracking based on FMCW radar.Firstly,we enhance the efficiency of 2-D MUSIC azimuth-range spectrum estimation by incorporating 2-D DFT and multi-level resolution searching strategy.Secondly,we apply the gradient descent method to tightly integrate the spatial continuity of object motion into spectrum estimation when processing multi-epoch radar data,which improves the efficiency of continuous target tracking.These two approaches have improved the algorithm efficiency by nearly 2-4 orders of magnitude without losing accuracy and resolution.Simulation experiments are conducted to validate the effectiveness of the algorithm in both single-epoch estimation and multi-epoch tracking scenarios. 展开更多
关键词 2D-MUSIC FMCW radar moving target tracking SUPER-RESOLUTION algorithm optimization
原文传递
Automatic target recognition of moving target based on empirical mode decomposition and genetic algorithm support vector machine 被引量:4
2
作者 张军 欧建平 占荣辉 《Journal of Central South University》 SCIE EI CAS CSCD 2015年第4期1389-1396,共8页
In order to improve measurement accuracy of moving target signals, an automatic target recognition model of moving target signals was established based on empirical mode decomposition(EMD) and support vector machine(S... In order to improve measurement accuracy of moving target signals, an automatic target recognition model of moving target signals was established based on empirical mode decomposition(EMD) and support vector machine(SVM). Automatic target recognition process on the nonlinear and non-stationary of Doppler signals of military target by using automatic target recognition model can be expressed as follows. Firstly, the nonlinearity and non-stationary of Doppler signals were decomposed into a set of intrinsic mode functions(IMFs) using EMD. After the Hilbert transform of IMF, the energy ratio of each IMF to the total IMFs can be extracted as the features of military target. Then, the SVM was trained through using the energy ratio to classify the military targets, and genetic algorithm(GA) was used to optimize SVM parameters in the solution space. The experimental results show that this algorithm can achieve the recognition accuracies of 86.15%, 87.93%, and 82.28% for tank, vehicle and soldier, respectively. 展开更多
关键词 automatic target recognition(ATR) moving target empirical mode decomposition genetic algorithm support vector machine
在线阅读 下载PDF
Area Variation Based Color Snake Algorithm for Moving Object Tracking
3
作者 Shoum-ik ROYCHOUDHURY Young-joon HAN 《Journal of Measurement Science and Instrumentation》 CAS 2010年第1期46-49,共4页
A snake algorithm has been known that it has a strong point in extracting the exact contour of an object. But it is apt to be influenced by scattered edges around the control points. Since the shape of a moving object... A snake algorithm has been known that it has a strong point in extracting the exact contour of an object. But it is apt to be influenced by scattered edges around the control points. Since the shape of a moving object in 2D image changes a lot due to its rotation and translation in the 3D space, the conventional algorithm that takes into account slowly moving objects cannot provide an appropriate solution. To utilize the advantages of the snake algorithm while minimizing the drawbacks, this paper proposes the area variation based color snake algorithm for moving object tracking. The proposed algorithm includes a new energy term which is used for preserving the shape of an object between two consecutive images. The proposed one can also segment precisely interesting objects on complex image since it is based on color information. Experiment results show that the proposed algorithm is very effective in various environments. 展开更多
关键词 color snake algorithm area variation moving object tracking snake energy SEGMENTATION
在线阅读 下载PDF
基于DBO-XGBoost模型和EWMA控制图的海上风电机组发电机轴承故障预测方法
4
作者 吴青 王霄 +4 位作者 陶彦亭 宋泽爽 徐凌桦 闫建国 邢学树 《机械强度》 北大核心 2026年第1期133-142,共10页
【目的】为及时发现海上风电机组发电机轴承的故障,提出一种基于蜣螂优化(Dung Beetle Optimizer,DBO)算法和极端梯度提升树(eXtreme Gradient Boosting,XGBoost)模型的DBO-XGBoost发电机轴承温度预测模型,并结合指数加权移动平均值(Exp... 【目的】为及时发现海上风电机组发电机轴承的故障,提出一种基于蜣螂优化(Dung Beetle Optimizer,DBO)算法和极端梯度提升树(eXtreme Gradient Boosting,XGBoost)模型的DBO-XGBoost发电机轴承温度预测模型,并结合指数加权移动平均值(Exponentially Weighted Moving Average,EWMA)控制图实现发电机轴承的故障预测。【方法】首先,通过最大互信息系数(Maximal Information Coefficient,MIC)选取数据采集与监视控制(Supervisory Control And Data Acquisition,SCADA)系统中能准确表征发电机轴承状态的关键特征,并将其输入DBO-XGBoost模型中,对正常工况下的发电机轴承温度进行预测。其次,使用马氏距离(Mahalanobis Distance,MD)衡量真实值与预测值之间的偏差,并将MD序列输入基于EWMA控制图的变点检测算法中,以获取故障出现的变点,从而实现故障预测。最后,基于特征的重要性构建轴承故障模式知识图谱。【结果】结果表明,所提方法能对正常工况下发电机轴承的温度实现较为精准的预测,并能提前3天对故障进行预警,与通过设定单一阈值进行故障预警的方法相比,所提方法能更准确地检测到故障发生的时间。构建的轴承故障模式知识图谱为运维人员提供了可视化的运维决策支持。 展开更多
关键词 海上风电机组 蜣螂优化算法 发电机轴承 故障预测 指数加权移动平均值
在线阅读 下载PDF
Multiobjective Optimization of Simulated Moving Bed by Tissue P System 被引量:8
5
作者 黄亮 孙磊 +1 位作者 王宁 金晓明 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2007年第5期683-690,共8页
The binaphthol enantiomers separation process using simulation moving bed technology is simulated with the true moving bed approach (TMB). In order to systematically optimize the process with multiple productive obj... The binaphthol enantiomers separation process using simulation moving bed technology is simulated with the true moving bed approach (TMB). In order to systematically optimize the process with multiple productive objectives, this article develops a variant of tissue P system (TPS). Inspired by general tissue P systems, the special TPS has a tissue-like structure with several membranes. The key rules of each membrane are the communication rule and mutation rule. These characteristics contribute to the diversity of the population, the conquest of the multimodal of objective function, and the convergence of algorithm. The results of comparison with a popular algorithm——the non-dominated sorting genetic algorithm 2(NSGA-2) illustrate that the new algorithm has satisfactory performance. Using the algorithm, this study maximizes synchronously several conflicting objectives, purities of different products, and productivity. 展开更多
关键词 simulated moving bed tissue P systems multiobjective optimization Pareto optimality evolutionary algorithm binaphthol enantiomers separation process
在线阅读 下载PDF
ITERATIVE ALGORITHM FOR AXIALLY ACCELERATING STRINGS WITH INTEGRAL CONSTITUTIVE LAW 被引量:2
6
作者 Weijia Zhao Liqun Chen 《Acta Mechanica Solida Sinica》 SCIE EI 2008年第5期449-456,共8页
A numerical method is proposed to simulate the transverse vibrations of a viscoelastic moving string constituted by an integral law. In the numerical computation, the Galerkin method based on the Hermite functions is ... A numerical method is proposed to simulate the transverse vibrations of a viscoelastic moving string constituted by an integral law. In the numerical computation, the Galerkin method based on the Hermite functions is applied to discretize the state variables, and the Runge- Kutta method is applied to solve the resulting differential-integral equation system. A linear iterative process is designed to compute the integral terms at each time step, which makes the numerical method more efficient and accurate. As examples, nonlinear parametric vibrations of an axially moving viscoelastic string are analyzed. 展开更多
关键词 iterative algorithm partial-differential-integral equation Hermite function Galerkin method axially moving string integral constitutive law
在线阅读 下载PDF
Toward real-time digital pulse process algorithms for CsI(Tl)detector array at external target facility in HIRFL-CSR 被引量:2
7
作者 Tao Liu Hai-Sheng Song +13 位作者 Yu-Hong Yu Duo Yan Zhi-Yu Sun Shu-Wen Tang Fen-Hua Lu Shi-Tao Wang Xue-Heng Zhang Xian-Qin Li Hai-Bo Yang Fang Fang Yong-Jie Zhang Shao-Bo Ma Hooi-Jin Ong Cheng-Xin Zhao 《Nuclear Science and Techniques》 SCIE EI CAS CSCD 2023年第9期8-20,共13页
A fully digital data acquisition system based on a field-programmable gate array(FPGA) was developed for a CsI(Tl) array at the external target facility(ETF) in the Heavy Ion Research Facility in Lanzhou(HIRFL). To pr... A fully digital data acquisition system based on a field-programmable gate array(FPGA) was developed for a CsI(Tl) array at the external target facility(ETF) in the Heavy Ion Research Facility in Lanzhou(HIRFL). To process the CsI(Tl) signals generated by γ-rays and light-charged ions, a scheme for digital pulse processing algorithms is proposed. Every step in the algorithms was benchmarked using standard γ and α sources. The scheme, which included a moving average filter, baseline restoration, leading-edge discrimination, moving window deconvolution, and digital charge comparison, was subsequently implemented on the FPGA. A good energy resolution of 5.7% for 1.33-MeV γ-rays and excellent α-γ identification using the digital charge comparison method were achieved, which satisfies CsI(Tl) array performance requirements. 展开更多
关键词 CsI(Tl)array On-line digital algorithms moving average filter moving window deconvolution On-line particle identification algorithms
在线阅读 下载PDF
Strategy Selection for Moving Target Defense in Incomplete Information Game 被引量:2
8
作者 Huan Zhang Kangfeng Zheng +2 位作者 Xiujuan Wang Shoushan Luo Bin Wu 《Computers, Materials & Continua》 SCIE EI 2020年第2期763-786,共24页
As a core component of the network,web applications have become one of the preferred targets for attackers because the static configuration of web applications simplifies the exploitation of vulnerabilities by attacke... As a core component of the network,web applications have become one of the preferred targets for attackers because the static configuration of web applications simplifies the exploitation of vulnerabilities by attackers.Although the moving target defense(MTD)has been proposed to increase the attack difficulty for the attackers,there is no solo approach can cope with different attacks;in addition,it is impossible to implement all these approaches simultaneously due to the resource limitation.Thus,the selection of an optimal defense strategy based on MTD has become the focus of research.In general,the confrontation of two players in the security domain is viewed as a stochastic game,and the reward matrices are known to both players.However,in a real security confrontation,this scenario represents an incomplete information game.Each player can only observe the actions performed by the opponent,and the observed actions are not completely accurate.To accurately describe the attacker’s reward function to reach the Nash equilibrium,this work simulated and updated the strategy selection distribution of the attacker by observing and investigating the strategy selection history of the attacker.Next,the possible rewards of the attacker in each confrontation via the observation matrix were corrected.On this basis,the Nash-Q learning algorithm with reward quantification was proposed to select the optimal strategy.Moreover,the performances of the Minimax-Q learning algorithm and Naive-Q learning algorithm were compared and analyzed in the MTD environment.Finally,the experimental results showed that the strategy selection algorithm can enable defenders to select a more reasonable defensive strategy and achieve the maximum possible reward. 展开更多
关键词 moving target defense Nash-Q learning algorithm optimal strategy selection incomplete information game web service
在线阅读 下载PDF
NEW HMM ALGORITHM FOR TOPOLOGY OPTIMIZATION 被引量:4
9
作者 Zuo Kongtian ZhaoYudong +2 位作者 Chen Liping Zhong Yifang Huang Yuying 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2005年第3期346-350,共5页
A new hybrid MMA-MGCMMA (HMM) algorithm for solving topology optimization problems is presented. This algorithm combines the method of moving asymptotes (MMA) algorithm and the modified globally convergent version... A new hybrid MMA-MGCMMA (HMM) algorithm for solving topology optimization problems is presented. This algorithm combines the method of moving asymptotes (MMA) algorithm and the modified globally convergent version of the method of moving asymptotes (MGCMMA) algorithm in the optimization process. This algorithm preserves the advantages of both MMA and MGCMMA. The optimizer is switched from MMA to MGCMMA automatically, depending on the numerical oscillation value existing in the calculation. This algorithm can improve calculation efficiency and accelerate convergence compared with simplex MMA or MGCMMA algorithms, which is proven with an example. 展开更多
关键词 Topology optimization Method of moving asymptotes (MMA) Modified globally convergent version of MMA (MGCMMA) HMM algorithm Convergence
在线阅读 下载PDF
An improved Vibe algorithm for illumination mutations 被引量:2
10
作者 LIANG Jincheng WANG Xiaopeng WANG Qingsheng 《Journal of Measurement Science and Instrumentation》 CAS CSCD 2022年第2期184-191,共8页
The visual background extractor(Vibe)algorithm can lead to a large area of false detection in the extracted foreground target when the illumination is mutated.An improved Vibe method based on the YCbCr color space and... The visual background extractor(Vibe)algorithm can lead to a large area of false detection in the extracted foreground target when the illumination is mutated.An improved Vibe method based on the YCbCr color space and improved three-frame difference is proposed in this paper.The algorithm detects the illumination mutation frames accurately based on the difference between the luminance components of two frames adjacent to a video frame.If there exists a foreground moving target in the previous frame of the mutated frame,three-frame difference method is utilized;otherwise,Vibe method using current frame is used to initialize background.Improved three-frame differential method based on the difference in brightness between two frames of the video changes the size of the threshold adaptively to reduce the interference of noise on the foreground extraction.Experiment results show that the improved Vibe algorithm can not only suppress the“ghost”phenomenon effectively but also improve the accuracy and completeness of target detection,as well as reduce error rate of detection when the illumination is mutated. 展开更多
关键词 moving target detection visual background extractor(Vibe)algorithm YCbCr color space three-frame difference method
在线阅读 下载PDF
Image Forgery Detection Using Segmentation and Swarm Intelligent Algorithm 被引量:2
11
作者 ZHAO Fei SHI Wenchang +1 位作者 QIN Bo LIANG Bin 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2017年第2期141-148,共8页
Small or smooth cloned regions are difficult to be detected in image copy-move forgery (CMF) detection. Aiming at this problem, an effective method based on image segmentation and swarm intelligent (SI) algorithm ... Small or smooth cloned regions are difficult to be detected in image copy-move forgery (CMF) detection. Aiming at this problem, an effective method based on image segmentation and swarm intelligent (SI) algorithm is proposed. This method segments image into small nonoverlapping blocks. A calculation of smooth degree is given for each block. Test image is segmented into independent layers according to the smooth degree. SI algorithm is applied in finding the optimal detection parameters for each layer. These parameters are used to detect each layer by scale invariant features transform (SIFT)-based scheme, which can locate a mass of keypoints. The experimental results prove the good performance of the proposed method, which is effective to identify the CMF image with small or smooth cloned region. 展开更多
关键词 copy-move forgery detection scale invariant features transform (SIFT) swarm intelligent algorithm particle swarm optimization
原文传递
Hybrid Cartesian Grid Method for Moving Boundary Problems
12
作者 Shen Zhiwei Zhao Ning 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI CSCD 2016年第1期37-44,共8页
A hybrid Cartesian structured grid method is proposed for solving moving boundary unsteady problems. The near body region is discretized by using the body-fitted structured grids, while the remaining computational dom... A hybrid Cartesian structured grid method is proposed for solving moving boundary unsteady problems. The near body region is discretized by using the body-fitted structured grids, while the remaining computational domain is tessellated with the generated Cartesian grids. As the body moves, the structured grids move with the body and the outer boundaries of inside grids are used to generate new holes in the outside adaptive Cartesian grid to facilitate data communication. By using the alternating digital tree (ADT) algorithm, the computational time of hole-cutting and identification of donor cells can be reduced significantly. A compressible solver for unsteady flow problems is developed. A cell-centered, second-order accurate finite volume method is employed in spatial discreti- zation and an implicit dual-time stepping low-upper symmetric Gauss-Seidei (LU-SGS) approach is employed in temporal discretization. Geometry-based adaptation is used during unsteady simulation time steps when boundary moves and the flow solution is interpolated from the old Cartesian grids to the new one with inverse distance weigh- ting interpolation formula. Both laminar and turbulent unsteady cases are tested to demonstrate the accuracy and efficiency of the proposed method. Then, a 2-D store separation problem is simulated. The result shows that the hybrid Cartesian grid method can handle the unsteady flow problems involving large-scale moving boundaries. 展开更多
关键词 hybrid Cartesian grid l moving boundary alternating digital tree (ADT) algorithm unsteady flow
在线阅读 下载PDF
Structural Design Optimization Based on the Moving Baseline Strategy
13
作者 Xiaojun Wang Qiang Ren +3 位作者 Wenpin Chen Yisi Liu Lei Wang Xuyun Ding 《Acta Mechanica Solida Sinica》 SCIE EI CSCD 2020年第3期307-326,共20页
Structural design optimization has always been a topic of concern in industry because good design can improve the safety and economic efficiency of structures during their service periods.Selecting the appropriate opt... Structural design optimization has always been a topic of concern in industry because good design can improve the safety and economic efficiency of structures during their service periods.Selecting the appropriate optimization algorithm is the key to solving structural optimal design problems.In this study,a new global optimization idea is proposed and named the moving baseline strategy.A baseline is initially set and will be repeatedly moving upward or downward to approach the optimal value.The proposed strategy is a simple but effective,general,and stable algorithm that can be used to solve constrained and unconstrained structural optimization problems.Different from traditional gradient-based,stochastic and heuristic algorithms,the developed algorithm provides a completely new idea to solve global or local optimization problems.Some unconstrained and constrained numerical benchmark examples are used to test the proposed methodology.In addition,structural optimal design problems of a ten-bar planar truss structure and a hypersonic wing structure(X-37B)are utilized to verify the effectiveness of the developed strategy in addressing structural design optimization problems in engineering. 展开更多
关键词 Structural design Global optimization Optimization algorithm moving baseline strategy Constrained optimization
原文传递
Application of Depth Learning Algorithm in Automatic Processing and Analysis of Sports Images
14
作者 Kai Yang 《Computer Systems Science & Engineering》 SCIE EI 2023年第10期317-332,共16页
With the rapid development of sports,the number of sports images has increased dramatically.Intelligent and automatic processing and analysis of moving images are significant,which can not only facilitate users to qui... With the rapid development of sports,the number of sports images has increased dramatically.Intelligent and automatic processing and analysis of moving images are significant,which can not only facilitate users to quickly search and access moving images but also facilitate staff to store and manage moving image data and contribute to the intellectual development of the sports industry.In this paper,a method of table tennis identification and positioning based on a convolutional neural network is proposed,which solves the problem that the identification and positioning method based on color features and contour features is not adaptable in various environments.At the same time,the learning methods and techniques of table tennis detection,positioning,and trajectory prediction are studied.A deep learning framework for recognition learning of rotating flying table tennis is put forward.The mechanism and methods of positioning,trajectory prediction,and intelligent automatic processing of moving images are studied,and the self-built data sets are trained and verified. 展开更多
关键词 Deep learning algorithm convolutional neural network moving image TRAJECTORY intelligent processing
在线阅读 下载PDF
Optimal zero-crossing group selection method of the absolute gravimeter based on improved auto-regressive moving average model
15
作者 牟宗磊 韩笑 胡若 《Chinese Physics B》 SCIE EI CAS CSCD 2023年第11期347-354,共8页
An absolute gravimeter is a precision instrument for measuring gravitational acceleration, which plays an important role in earthquake monitoring, crustal deformation, national defense construction, etc. The frequency... An absolute gravimeter is a precision instrument for measuring gravitational acceleration, which plays an important role in earthquake monitoring, crustal deformation, national defense construction, etc. The frequency of laser interference fringes of an absolute gravimeter gradually increases with the fall time. Data are sparse in the early stage and dense in the late stage. The fitting accuracy of gravitational acceleration will be affected by least-squares fitting according to the fixed number of zero-crossing groups. In response to this problem, a method based on Fourier series fitting is proposed in this paper to calculate the zero-crossing point. The whole falling process is divided into five frequency bands using the Hilbert transformation. The multiplicative auto-regressive moving average model is then trained according to the number of optimal zero-crossing groups obtained by the honey badger algorithm. Through this model, the number of optimal zero-crossing groups determined in each segment is predicted by the least-squares fitting. The mean value of gravitational acceleration in each segment is then obtained. The method can improve the accuracy of gravitational measurement by more than 25% compared to the fixed zero-crossing groups method. It provides a new way to improve the measuring accuracy of an absolute gravimeter. 展开更多
关键词 absolute gravimeter laser interference fringe Fourier series fitting honey badger algorithm mul-tiplicative auto-regressive moving average(MARMA)model
原文传递
Solving Two-Dimensional Moving-Boundary Problems with Meshless and Level Set Method
16
作者 L. Vrankar G. Turk F. Runovc 《Journal of Energy and Power Engineering》 2010年第1期51-55,共5页
During the past decade, increasing attention has been given to the development of meshless methods using radial basis functions for the numerical solution of Partial Differential Equations (PDEs). A level set method... During the past decade, increasing attention has been given to the development of meshless methods using radial basis functions for the numerical solution of Partial Differential Equations (PDEs). A level set method is a promising design tool for tracking, modelling and simulating the motion of free boundaries in fluid mechanics, combustion, computer animation and image processing. In the conventional level set methods, the level set equation is solved to evolve the interface using a capturing Eulerian approach. The solving procedure requires an appropriate choice of the upwind schemes, reinitialization, etc. Our goal is to include Multiquadric Radial Basis Functions (MQ RBFs) into the level set method to construct a more efficient approach and stabilize the solution process with the adaptive greedy algorithm. This paper presents an alternative approach to the conventional level set methods for solving moving-boundary problems. The solution was compared to the solution calculated by the exact explicit lime integration scheme. The examples show that MQ RBFs and adaptive greedy algorithm is a very promising calculation scheme. 展开更多
关键词 moving boundary problems level set method MULTIQUADRIC greedy algorithm exact time integration scheme
在线阅读 下载PDF
一种基于遗传退火算法的MTD参数生成应用研究
17
作者 代培龙 张薇 徐斐 《现代雷达》 北大核心 2025年第3期88-92,共5页
动目标检测(MTD)是雷达探测的重要技术之一,MTD重频参数对探测性能至关重要。文中分析了不同重频的应用场景,深入研究遗传退火算法,阐述了遗传退火算法的优劣,论述了采用基于二进制遗传退火算法设计MTD重频参数的过程,基于距离-速度清... 动目标检测(MTD)是雷达探测的重要技术之一,MTD重频参数对探测性能至关重要。文中分析了不同重频的应用场景,深入研究遗传退火算法,阐述了遗传退火算法的优劣,论述了采用基于二进制遗传退火算法设计MTD重频参数的过程,基于距离-速度清晰度构造目标函数和约束条件。根据探测速度需要,该方法可以快速构建多重频参数,优化距离-速度清晰度。仿真结果表明:该算法相对于传统穷举搜索法,是一种全局随机搜索方法,参数生成速度快,可实时产生满足系统设计要求的参数。生成的清晰度说明了该方法的有效性,并给出了一种有效的工程应用思路,在雷达设计中具有一定的工程应用价值。 展开更多
关键词 动目标检测 遗传退火算法 探测参数优化 距离-速度盲区
原文传递
综合运动前景与运动行人的智能视频双重监测算法设计
18
作者 刘彦琴 李杰 李嘉仁 《自动化与仪器仪表》 2025年第2期5-9,共5页
针对传统监控视频存在目标尺寸小、行人被遮挡导致检测精度和跟踪效果不佳的问题,提出一种综合运动前景与运动行人的智能视频双重监测算法。首先,基于YOLOv5算法,构建一个结合协同注意力机制的行人检测模型;然后以行人检测模型作为检测... 针对传统监控视频存在目标尺寸小、行人被遮挡导致检测精度和跟踪效果不佳的问题,提出一种综合运动前景与运动行人的智能视频双重监测算法。首先,基于YOLOv5算法,构建一个结合协同注意力机制的行人检测模型;然后以行人检测模型作为检测器,引入DeepSORT的行人跟踪算法,并在该算法基础上加入GhostNet-cot重识别网络和抗遮挡策略;最后将改进YOLOv5检测模型与增强数据关联的DeepSORT跟踪模型相结合,搭建一个综合运动前景与运动行人的智能视频双重监测模型,通过该模型实现运动行人准确检测和跟踪。实验结果表明,本模型的MOTA、HOTA、IDFI指标分别取值为48.86%、53.35%和56.66%,均高于传统的DeepSort模型、GAN-RNN模型和ECA-BIFPN模型。且本模型的IDSW和参数量分别为204和9.2 M,明显低于另外三种模型。综合分析可知,本模型可实现运动行人的抗遮挡,基于监控视频的行人检测跟踪精度明显提高,可实现智能体育视频的双重监测。 展开更多
关键词 运动行人检测 YOLOv5算法 DeepSORT 目标跟踪 监控视频
原文传递
三峡-葛洲坝枢纽引航道和船闸群协同调度的多目标混合启发式算法
19
作者 张煜 郑倩倩 +2 位作者 李然 田宏伟 刘顺 《同济大学学报(自然科学版)》 北大核心 2025年第9期1444-1456,共13页
为提升三峡‒葛洲坝枢纽通航效率,研究了带同步移泊过程的引航道和船闸群协同调度问题(CSP⁃AC&SLG)。考虑船舶干舷高度和掌船技能,构建以水资源利用率最大化、平均船舶等待时间最小化及平均船舶总能耗最小化为目标的CSP⁃AC&SLG... 为提升三峡‒葛洲坝枢纽通航效率,研究了带同步移泊过程的引航道和船闸群协同调度问题(CSP⁃AC&SLG)。考虑船舶干舷高度和掌船技能,构建以水资源利用率最大化、平均船舶等待时间最小化及平均船舶总能耗最小化为目标的CSP⁃AC&SLG数学模型,并采用多目标混合启发式算法(MOHHA)进行求解。MOHHA采用双链编码方案和分阶段成组右移解码机制实现个体表述和求解,并引入模糊关联熵分析法评估多目标解,同时嵌入自适应参数调整策略和变邻域模拟退火提升算法求解能力。仿真结果表明,MOHHA能够求解CSP⁃AC&SLG,实现了通航效率提升和船舶能耗节约的双重目标。 展开更多
关键词 三峡‒葛洲坝枢纽 同步移泊过程 引航道和船闸群协同作业 多目标混合启发式算法
在线阅读 下载PDF
基于障碍图的移动工件搜索混合算法求解分布式作业车间调度问题
20
作者 赵诗奎 黄林 +1 位作者 刘子辉 郑岩 《机械工程学报》 北大核心 2025年第10期479-494,共16页
针对分布式作业车间调度问题,以优化最大完工时间为目标,设计基于障碍图的移动工件搜索混合算法。基于障碍图的移动工件搜索可以实现工件级尺度搜索。当工件将要插入已有调度方案时,首先,采用快速路径规划算法求解路径。然后,根据路径... 针对分布式作业车间调度问题,以优化最大完工时间为目标,设计基于障碍图的移动工件搜索混合算法。基于障碍图的移动工件搜索可以实现工件级尺度搜索。当工件将要插入已有调度方案时,首先,采用快速路径规划算法求解路径。然后,根据路径解码规则科学的插入工件,保证工件插入之后新解的可行性和较优性。构建三种移动工件搜索方法:关键工厂自身移动工件搜索,移动关键工厂的工件到其他工厂进行搜索,关键工厂与其他工厂的工件交换进行搜索。三种移动工件搜索方法不仅适用于单个工厂的优化,而且可以在工厂之间进行移动或交换工件搜索,解决了工件的工厂选择问题。混合禁忌搜索算法,结合邻域结构对关键工厂进行集中搜索,进一步提升求解质量。通过对基准算例进行测试,验证了所提混合算法的有效性。特别是,所提算法刷新了多个基准算例的最优解。同时,移动工件搜索亦可作为共性技术用于求解其他作业车间调度扩展问题。 展开更多
关键词 分布式作业车间调度 障碍图 移动工件搜索 混合算法 最大完工时间
原文传递
上一页 1 2 51 下一页 到第
使用帮助 返回顶部