期刊文献+
共找到4,298篇文章
< 1 2 215 >
每页显示 20 50 100
A Novel Reliable and Trust Objective Function for RPL-Based IoT Routing Protocol
1
作者 Mariam A.Alotaibi Sami S.Alwakeel Aasem N.Alyahya 《Computers, Materials & Continua》 2025年第2期3467-3497,共31页
The Internet of Things (IoT) integrates diverse devices into the Internet infrastructure, including sensors, meters, and wearable devices. Designing efficient IoT networks with these heterogeneous devices requires the... The Internet of Things (IoT) integrates diverse devices into the Internet infrastructure, including sensors, meters, and wearable devices. Designing efficient IoT networks with these heterogeneous devices requires the selection of appropriate routing protocols, which is crucial for maintaining high Quality of Service (QoS). The Internet Engineering Task Force’s Routing Over Low Power and Lossy Networks (IETF ROLL) working group developed the IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) to meet these needs. While the initial RPL standard focused on single-metric route selection, ongoing research explores enhancing RPL by incorporating multiple routing metrics and developing new Objective Functions (OFs). This paper introduces a novel Objective Function (OF), the Reliable and Secure Objective Function (RSOF), designed to enhance the reliability and trustworthiness of parent selection at both the node and link levels within IoT and RPL routing protocols. The RSOF employs an adaptive parent node selection mechanism that incorporates multiple metrics, including Residual Energy (RE), Expected Transmission Count (ETX), Extended RPL Node Trustworthiness (ERNT), and a novel metric that measures node failure rate (NFR). In this mechanism, nodes with a high NFR are excluded from the parent selection process to improve network reliability and stability. The proposed RSOF was evaluated using random and grid topologies in the Cooja Simulator, with tests conducted across small, medium, and large-scale networks to examine the impact of varying node densities. The simulation results indicate a significant improvement in network performance, particularly in terms of average latency, packet acknowledgment ratio (PAR), packet delivery ratio (PDR), and Control Message Overhead (CMO), compared to the standard Minimum Rank with Hysteresis Objective Function (MRHOF). 展开更多
关键词 IOT LLNs RPL objective function OF MRHOF OF0 routing metrics RELIABILITY trustworthiness
在线阅读 下载PDF
Two-Layer Attention Feature Pyramid Network for Small Object Detection
2
作者 Sheng Xiang Junhao Ma +2 位作者 Qunli Shang Xianbao Wang Defu Chen 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第10期713-731,共19页
Effective small object detection is crucial in various applications including urban intelligent transportation and pedestrian detection.However,small objects are difficult to detect accurately because they contain les... Effective small object detection is crucial in various applications including urban intelligent transportation and pedestrian detection.However,small objects are difficult to detect accurately because they contain less information.Many current methods,particularly those based on Feature Pyramid Network(FPN),address this challenge by leveraging multi-scale feature fusion.However,existing FPN-based methods often suffer from inadequate feature fusion due to varying resolutions across different layers,leading to suboptimal small object detection.To address this problem,we propose the Two-layerAttention Feature Pyramid Network(TA-FPN),featuring two key modules:the Two-layer Attention Module(TAM)and the Small Object Detail Enhancement Module(SODEM).TAM uses the attention module to make the network more focused on the semantic information of the object and fuse it to the lower layer,so that each layer contains similar semantic information,to alleviate the problem of small object information being submerged due to semantic gaps between different layers.At the same time,SODEM is introduced to strengthen the local features of the object,suppress background noise,enhance the information details of the small object,and fuse the enhanced features to other feature layers to ensure that each layer is rich in small object information,to improve small object detection accuracy.Our extensive experiments on challenging datasets such as Microsoft Common Objects inContext(MSCOCO)and Pattern Analysis Statistical Modelling and Computational Learning,Visual Object Classes(PASCAL VOC)demonstrate the validity of the proposedmethod.Experimental results show a significant improvement in small object detection accuracy compared to state-of-theart detectors. 展开更多
关键词 Small object detection two-layer attention module small object detail enhancement module feature pyramid network
在线阅读 下载PDF
OPTIMALITY CONDITIONS AND DUALITY RESULTS FOR NONSMOOTH VECTOR OPTIMIZATION PROBLEMS WITH THE MULTIPLE INTERVAL-VALUED OBJECTIVE FUNCTION 被引量:5
3
作者 Tadeusz ANTCZAK 《Acta Mathematica Scientia》 SCIE CSCD 2017年第4期1133-1150,共18页
In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a (weakly) LU-efficient solution in the considered nonsmooth multiobjective programming problem with the mult... In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a (weakly) LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a (weakly) LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex. 展开更多
关键词 nonsmooth multiobjective programming problem with the multiple interval- objective function Fritz John necessary optimality conditions Karush-Kuhn- Tucker necessary optimality conditions (weakly) LU-efficient solution Mond- Weir duality
在线阅读 下载PDF
Green Functions with Pulsating Sources in A Two-Layer Fluid of Finite Depth 被引量:2
4
作者 MANYANGA D.O 段文洋 《China Ocean Engineering》 SCIE EI 2011年第4期609-624,共16页
The derivation of Green function in a two-layer fluid model has been treated in different ways. In a two-layer fluid with the upper layer having a free surface, there exist two modes of waves propagating due to the fr... The derivation of Green function in a two-layer fluid model has been treated in different ways. In a two-layer fluid with the upper layer having a free surface, there exist two modes of waves propagating due to the free surface and the interface. This paper is concerned with the derivation of Green functions in the three dimensional case of a stationary source oscillating. The source point is located either in the upper or lower part of a two-layer fluid of finite depth. The derivation is carried out by the method of singularities. This method has an advantage in that it involves representing the potential as a sum of singularities or multipoles placed within any structures being present. Furthermore, experience shows that the systems of equations resulted from using a singularity method possess excellent convergence characteristics and only a few equations are needed to obtain accurate numerical results. Validation is done by showing that the derived two-layer Green function can be reduced to that of a single layer of finite depth or that the upper Green function coincides with that of the lower, for each case. The effect of the density on the internal waves is demonstrated. Also, it is shown how the surface and internal wave amplitudes are compared for both the wave modes. The fluid in this case is considered to be inviscid and incompressible and the flow is irrotational. 展开更多
关键词 Green function two-layer fluid three dimensions singularities method
在线阅读 下载PDF
Well production optimization using streamline features-based objective function and Bayesian adaptive direct search algorithm 被引量:4
5
作者 Qi-Hong Feng Shan-Shan Li +2 位作者 Xian-Min Zhang Xiao-Fei Gao Ji-Hui Ni 《Petroleum Science》 SCIE CAS CSCD 2022年第6期2879-2894,共16页
Well production optimization is a complex and time-consuming task in the oilfield development.The combination of reservoir numerical simulator with optimization algorithms is usually used to optimize well production.T... Well production optimization is a complex and time-consuming task in the oilfield development.The combination of reservoir numerical simulator with optimization algorithms is usually used to optimize well production.This method spends most of computing time in objective function evaluation by reservoir numerical simulator which limits its optimization efficiency.To improve optimization efficiency,a well production optimization method using streamline features-based objective function and Bayesian adaptive direct search optimization(BADS)algorithm is established.This new objective function,which represents the water flooding potential,is extracted from streamline features.It only needs to call the streamline simulator to run one time step,instead of calling the simulator to calculate the target value at the end of development,which greatly reduces the running time of the simulator.Then the well production optimization model is established and solved by the BADS algorithm.The feasibility of the new objective function and the efficiency of this optimization method are verified by three examples.Results demonstrate that the new objective function is positively correlated with the cumulative oil production.And the BADS algorithm is superior to other common algorithms in convergence speed,solution stability and optimization accuracy.Besides,this method can significantly accelerate the speed of well production optimization process compared with the objective function calculated by other conventional methods.It can provide a more effective basis for determining the optimal well production for actual oilfield development. 展开更多
关键词 Well production Optimization efficiency Streamline simulation Streamline feature objective function Bayesian adaptive direct search algorithm
原文传递
SELECTION OF OBJECTIVE FUNCTIONS AND APPLICATION OF GENETIC ALGORITHMS IN DAMPING DESIGN OF PIPE SYSTEM 被引量:1
6
作者 ChenYanqiu FanQinsban ZhuZigen 《Acta Mechanica Solida Sinica》 SCIE EI 2003年第2期171-178,共8页
The vibration failure of pipe system of aeroengine seriously influences the safety of aircraft.Its damping design is determined by the selection of the design target,method and their feasibility.Five objective functio... The vibration failure of pipe system of aeroengine seriously influences the safety of aircraft.Its damping design is determined by the selection of the design target,method and their feasibility.Five objective functions for the vibration design of a pipeline or pipe system are introduced,namely,the frequency,amplitude,transfer ratio,curvature and deformation energy as options for the optimization process.The genetic algorithms(GA)are adopted as the opti- mization method,in which the selection of the adaptive genetic operators and the method of implementation of the GA process are crucial.The optimization procedure for all the above ob- jective functions is carried out using GA on the basis of finite element software-MSC/NASTRAN. The optimal solutions of these functions and the stress distribution on the structure are calculated and compared through an example,and their characteristics are analyzed.Finally we put forward two new objective functions,curvature and deformation energy for pipe system optimization.The calculations show that using the curvature as the objective function can reflect the case of minimal stress,and the optimization results using the deformation energy represent lesser and more uni- form stress distribution.The calculation results and process showed that the genetic algorithms can effectively implement damping design of engine pipelines and satisfy the efficient engineering design requirement. 展开更多
关键词 objective function genetic algorithms OPTIMIZATION pipe system
在线阅读 下载PDF
Reactor Network Synthesis Based on Instantaneous Objective Function Characteristic Curves 被引量:2
7
作者 张治山 赵文 +2 位作者 王艳丽 周传光 袁希钢 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2003年第4期436-440,共5页
It is believed that whether the instantaneous objective function curves of plug-flow-reactor (PFR) and continuous-stirred-tank-reactor (CSTR) overlap or not, they have a consistent changing trend for complex reactions... It is believed that whether the instantaneous objective function curves of plug-flow-reactor (PFR) and continuous-stirred-tank-reactor (CSTR) overlap or not, they have a consistent changing trend for complex reactions (steady state, isothermal and constant volume). As a result of the relation of the objective functions (selectivity or yield) to the instantaneous objective functions (instantaneous selectivity or instantaneous reaction rate), the optimal reactor network configuration can be determined according to the changing trend of the instantaneous objective function curves. Further, a recent partition strategy for the reactor network synthesis based on the instantaneous objective function characteristic curves is proposed by extending the attainable region partition strategy from the concentration space to the instantaneous objective function-unreacted fraction of key reactant space. In this paper, the instantaneous objective function is closed to be the instantaneous selectivity and several samples are examined to illustrate the proposed method. The comparison with the previous work indicates it is a very convenient and practical systematic tool of the reactor network synthesis and seems also promising for overcoming the dimension limit of the attainable region partition strategy in the concentration space. 展开更多
关键词 reactor network synthesis instantaneous objective function PARTITION
在线阅读 下载PDF
Distributed Stochastic Optimization with Compression for Non-Strongly Convex Objectives
8
作者 Xuanjie Li Yuedong Xu 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第4期459-481,共23页
We are investigating the distributed optimization problem,where a network of nodes works together to minimize a global objective that is a finite sum of their stored local functions.Since nodes exchange optimization p... We are investigating the distributed optimization problem,where a network of nodes works together to minimize a global objective that is a finite sum of their stored local functions.Since nodes exchange optimization parameters through the wireless network,large-scale training models can create communication bottlenecks,resulting in slower training times.To address this issue,CHOCO-SGD was proposed,which allows compressing information with arbitrary precision without reducing the convergence rate for strongly convex objective functions.Nevertheless,most convex functions are not strongly convex(such as logistic regression or Lasso),which raises the question of whether this algorithm can be applied to non-strongly convex functions.In this paper,we provide the first theoretical analysis of the convergence rate of CHOCO-SGD on non-strongly convex objectives.We derive a sufficient condition,which limits the fidelity of compression,to guarantee convergence.Moreover,our analysis demonstrates that within the fidelity threshold,this algorithm can significantly reduce transmission burden while maintaining the same convergence rate order as its no-compression equivalent.Numerical experiments further validate the theoretical findings by demonstrating that CHOCO-SGD improves communication efficiency and keeps the same convergence rate order simultaneously.And experiments also show that the algorithm fails to converge with low compression fidelity and in time-varying topologies.Overall,our study offers valuable insights into the potential applicability of CHOCO-SGD for non-strongly convex objectives.Additionally,we provide practical guidelines for researchers seeking to utilize this algorithm in real-world scenarios. 展开更多
关键词 Distributed stochastic optimization arbitrary compression fidelity non-strongly convex objective function
在线阅读 下载PDF
Adaptive Learning Rate Optimization BP Algorithm with Logarithmic Objective Function
9
作者 李春雨 盛昭瀚 《Journal of Southeast University(English Edition)》 EI CAS 1997年第1期47-51,共5页
This paper presents an improved BP algorithm. The approach can reduce the amount of computation by using the logarithmic objective function. The learning rate μ(k) per iteration is determined by dynamic o... This paper presents an improved BP algorithm. The approach can reduce the amount of computation by using the logarithmic objective function. The learning rate μ(k) per iteration is determined by dynamic optimization method to accelerate the convergence rate. Since the determination of the learning rate in the proposed BP algorithm only uses the obtained first order derivatives in standard BP algorithm(SBP), the scale of computational and storage burden is like that of SBP algorithm,and the convergence rate is remarkably accelerated. Computer simulations demonstrate the effectiveness of the proposed algorithm 展开更多
关键词 BP ALGORITHM ADAPTIVE LEARNING RATE optimization fault diagnosis logarithmic objective function
在线阅读 下载PDF
Experimental Evaluation of Objective Functions for Well-balanced Mapping
10
作者 Chen Delai Xu Hong Zhou Ying and Zhang Defu(Department of Computer Science and Technology Nailing University, Naming 210093, P. R. China) 《Wuhan University Journal of Natural Sciences》 CAS 1996年第Z1期312-316,共5页
High performance of parallel computing on a message-passing multicomputer System relies on the balance of the workloads located on the processing elements of the System and the minimum communication ovcrheads among th... High performance of parallel computing on a message-passing multicomputer System relies on the balance of the workloads located on the processing elements of the System and the minimum communication ovcrheads among them. Mapping is the technology to partition the problem domain wellbalanced into multiple distinct execution tasks based on some measures. In mapping, a good objective function is the criterion to guarantce the distinct execution tasks equitable. In this paper, we evaluate five categories of those existed objective functions with three different problem subjects using experiments and find an objective function is much suitable for all kinds of problems. 展开更多
关键词 MAPPING Heuristic algorithm objective functions
在线阅读 下载PDF
FUZZY IDENTIFICATION METHOD BASED ON A NEW OBJECTIVE FUNCTION
11
作者 王宏伟 贺汉根 黄柯棣 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2000年第3期162-166,共5页
A method of fuzzy identification based on a new objective function is proposed. The method could deal with the issue that input variables of a system have an effect on the input space while output variables of the sys... A method of fuzzy identification based on a new objective function is proposed. The method could deal with the issue that input variables of a system have an effect on the input space while output variables of the system do not exert an influence on the input space in the proposed objective functions of fuzzy clustering. The method could simultaneously solve the problems about structure identification and parameter estimation; thus it makes the fuzzy model become optimal. Simulation example demonstrates that the method could identify non linear systems and obviously improve modeling accuracy. 展开更多
关键词 objective function fuzzy clustering fuzzy identification non linear systems
在线阅读 下载PDF
Performance Monitoring of the Data-driven Subspace Predictive Control Systems Based on Historical Objective Function Benchmark 被引量:3
12
作者 王陆 李柠 李少远 《自动化学报》 EI CSCD 北大核心 2013年第5期542-547,共6页
关键词 预测控制系统 性能监控 数据驱动 子空间 历史 基准 监视控制器 目标函数
在线阅读 下载PDF
Characteristic analysis of scattering field in two-layer media by Green's function
13
作者 张萍 刘智颖 +2 位作者 阎守国 黄娟 张碧星 《Chinese Physics B》 SCIE EI CAS CSCD 2023年第6期305-315,共11页
The problem of three-dimensional(3D) acoustic scattering in a complex medium has aroused considerable interest of researchers for many years. An ultrasonic scattered field calculating technique is proposed to study th... The problem of three-dimensional(3D) acoustic scattering in a complex medium has aroused considerable interest of researchers for many years. An ultrasonic scattered field calculating technique is proposed to study the scattering echo from strongly scattered materials in a two-layer medium in this work. Firstly, with the high frequency stationary phase method,the Green's function of two-layer fluid media is derived. And then based on the idea of integral equation discretization,the Green's function method is extended to two-layer fluid media to derive the scattering field expression of defects in a complex medium. With this method, the scattering field of 3D defect in a two-layer medium is calculated and the characteristics of received echoes are studied. The results show that this method is able to solve the scattering P wave field of 3D defect with arbitrary shape at any scattering intensity in two-layer media. Considering the circumstance of waterimmersion ultrasonic non-destructive test(NDT), the scattering sound field characteristics of different types of defects are analyzed by simulation, which will help to optimize the detection scheme and corresponding imaging method in practice so as to improve the detection quality. 展开更多
关键词 Green's function method two-layer media scattering field water-immersed detection
原文传递
A New Augmented Lagrangian Objective Penalty Function for Constrained Optimization Problems
14
作者 Ying Zheng Zhiqing Meng 《Open Journal of Optimization》 2017年第2期39-46,共8页
In this paper, a new augmented Lagrangian penalty function for constrained optimization problems is studied. The dual properties of the augmented Lagrangian objective penalty function for constrained optimization prob... In this paper, a new augmented Lagrangian penalty function for constrained optimization problems is studied. The dual properties of the augmented Lagrangian objective penalty function for constrained optimization problems are proved. Under some conditions, the saddle point of the augmented Lagrangian objective penalty function satisfies the first-order Karush-Kuhn-Tucker (KKT) condition. Especially, when the KKT condition holds for convex programming its saddle point exists. Based on the augmented Lagrangian objective penalty function, an algorithm is developed for finding a global solution to an inequality constrained optimization problem and its global convergence is also proved under some conditions. 展开更多
关键词 CONSTRAINED Optimization Problems AUGMENTED LAGRANGIAN objective PENALTY function SADDLE POINT Algorithm
在线阅读 下载PDF
Randomized Objective Function Linear Programming in Risk Management
15
作者 Dennis Ridley Felipe Llaugel +1 位作者 Inger Daniels Abdullah Khan 《Journal of Applied Mathematics and Physics》 2021年第3期391-402,共12页
The traditional linear programming model is deterministic. The way that uncertainty is handled is to compute the range of optimality. After the optimal solution is obtained, typically by the simplex method, one consid... The traditional linear programming model is deterministic. The way that uncertainty is handled is to compute the range of optimality. After the optimal solution is obtained, typically by the simplex method, one considers the effect of varying each objective function coefficient, one at a time. This yields the range of optimality within which the decision variables remain constant. This sensitivity analysis is useful for helping the analyst get a sense for the problem. However, it is unrealistic because objective function coefficients tend not to stand still. They are typically profit contributions from products sold and are subject to randomly varying selling prices. In this paper, a realistic linear program is created for simultaneously randomizing the coefficients from any probability distribution. Furthermore, we present a novel approach for designing a copula of random objective function coefficients according to a specified rank correlation. The corresponding distribution of objective function values is created. This distribution is examined directly for central tendency, spread, skewness and extreme values for the purpose of risk analysis. This enables risk analysis and business analytics, emerging topics in education and preparation for the knowledge economy. 展开更多
关键词 Linear Programming RANDOM objective function Profit Distribution RISK Monte Carlo Simulation
在线阅读 下载PDF
A Penalty Function Algorithm with Objective Parameters and Constraint Penalty Parameter for Multi-Objective Programming
16
作者 Zhiqing Meng Rui Shen Min Jiang 《American Journal of Operations Research》 2014年第6期331-339,共9页
In this paper, we present an algorithm to solve the inequality constrained multi-objective programming (MP) by using a penalty function with objective parameters and constraint penalty parameter. First, the penalty fu... In this paper, we present an algorithm to solve the inequality constrained multi-objective programming (MP) by using a penalty function with objective parameters and constraint penalty parameter. First, the penalty function with objective parameters and constraint penalty parameter for MP and the corresponding unconstraint penalty optimization problem (UPOP) is defined. Under some conditions, a Pareto efficient solution (or a weakly-efficient solution) to UPOP is proved to be a Pareto efficient solution (or a weakly-efficient solution) to MP. The penalty function is proved to be exact under a stable condition. Then, we design an algorithm to solve MP and prove its convergence. Finally, numerical examples show that the algorithm may help decision makers to find a satisfactory solution to MP. 展开更多
关键词 MULTI-objective Programming PENALTY function objective PARAMETERS CONSTRAINT PENALTY Parameter PARETO Weakly-Efficient Solution
在线阅读 下载PDF
An Objective Penalty Functions Algorithm for Multiobjective Optimization Problem
17
作者 Zhiqing Meng Rui Shen Min Jiang 《American Journal of Operations Research》 2011年第4期229-235,共7页
By using the penalty function method with objective parameters, the paper presents an interactive algorithm to solve the inequality constrained multi-objective programming (MP). The MP is transformed into a single obj... By using the penalty function method with objective parameters, the paper presents an interactive algorithm to solve the inequality constrained multi-objective programming (MP). The MP is transformed into a single objective optimal problem (SOOP) with inequality constrains;and it is proved that, under some conditions, an optimal solution to SOOP is a Pareto efficient solution to MP. Then, an interactive algorithm of MP is designed accordingly. Numerical examples show that the algorithm can find a satisfactory solution to MP with objective weight value adjusted by decision maker. 展开更多
关键词 MULTIobjective Optimization PROBLEM objective PENALTY function PARETO Efficient Solution INTERACTIVE ALGORITHM
在线阅读 下载PDF
Searching for an Optimized Single-objective Function Matching Multiple Objectives with Automatic Calibration of Hydrological Models
18
作者 TIAN Fuqiang HU Hongchang +2 位作者 SUN Yu LI Hongyi LU Hui 《Chinese Geographical Science》 SCIE CSCD 2019年第6期934-948,共15页
In the calibration of hydrological models, evaluation criteria are explicitly and quantitatively defined as single-or multi-objective functions when utilizing automatic calibration approaches.In most previous studies,... In the calibration of hydrological models, evaluation criteria are explicitly and quantitatively defined as single-or multi-objective functions when utilizing automatic calibration approaches.In most previous studies, there is a general opinion that no single-objective function can represent all important characteristics of even one specific hydrological variable(e.g., streamflow).Thus hydrologists must turn to multi-objective calibration.In this study, we demonstrated that an optimized single-objective function can compromise multi-response modes(i.e., multi-objective functions) of the hydrograph, which is defined as summation of a power function of the absolute error between observed and simulated streamflow with the exponent of power function optimized for specific watersheds.The new objective function was applied to 196 model parameter estimation experiment(MOPEX) watersheds across the eastern United States using the semi-distributed Xinanjiang hydrological model.The optimized exponent value for each watershed was obtained by targeting four popular objective functions focusing on peak flows, low flows, water balance, and flashiness, respectively.Results showed that the optimized single-objective function can achieve a better hydrograph simulation compared to the traditional single-objective function Nash-Sutcliffe efficiency coefficient for most watersheds, and balance high flow part and low flow part of the hydrograph without substantial differences compared to multi-objective calibration.The proposed optimal single-objective function can be practically adopted in the hydrological modeling if the optimal exponent value could be determined a priori according to hydrological/climatic/landscape characteristics in a specific watershed. 展开更多
关键词 automatic calibration single-objective function MULTI-objective functions Xinanjiang MODEL HYDROLOGICAL MODEL
在线阅读 下载PDF
DAFPN-YOLO: An Improved UAV-Based Object Detection Algorithm Based on YOLOv8s
19
作者 Honglin Wang Yaolong Zhang Cheng Zhu 《Computers, Materials & Continua》 2025年第5期1929-1949,共21页
UAV-based object detection is rapidly expanding in both civilian and military applications,including security surveillance,disaster assessment,and border patrol.However,challenges such as small objects,occlusions,comp... UAV-based object detection is rapidly expanding in both civilian and military applications,including security surveillance,disaster assessment,and border patrol.However,challenges such as small objects,occlusions,complex backgrounds,and variable lighting persist due to the unique perspective of UAV imagery.To address these issues,this paper introduces DAFPN-YOLO,an innovative model based on YOLOv8s(You Only Look Once version 8s).Themodel strikes a balance between detection accuracy and speed while reducing parameters,making itwell-suited for multi-object detection tasks from drone perspectives.A key feature of DAFPN-YOLO is the enhanced Drone-AFPN(Adaptive Feature Pyramid Network),which adaptively fuses multi-scale features to optimize feature extraction and enhance spatial and small-object information.To leverage Drone-AFPN’smulti-scale capabilities fully,a dedicated 160×160 small-object detection head was added,significantly boosting detection accuracy for small targets.In the backbone,the C2f_Dual(Cross Stage Partial with Cross-Stage Feature Fusion Dual)module and SPPELAN(Spatial Pyramid Pooling with Enhanced LocalAttentionNetwork)modulewere integrated.These components improve feature extraction and information aggregationwhile reducing parameters and computational complexity,enhancing inference efficiency.Additionally,Shape-IoU(Shape Intersection over Union)is used as the loss function for bounding box regression,enabling more precise shape-based object matching.Experimental results on the VisDrone 2019 dataset demonstrate the effectiveness ofDAFPN-YOLO.Compared to YOLOv8s,the proposedmodel achieves a 5.4 percentage point increase inmAP@0.5,a 3.8 percentage point improvement in mAP@0.5:0.95,and a 17.2%reduction in parameter count.These results highlight DAFPN-YOLO’s advantages in UAV-based object detection,offering valuable insights for applying deep learning to UAV-specific multi-object detection tasks. 展开更多
关键词 YOLOv8 UAV-based object detection AFPN small-object detection head SPPELAN DualConv loss function
在线阅读 下载PDF
Aerial Object Tracking with Attention Mechanisms:Accurate Motion Path Estimation under Moving Camera Perspectives
20
作者 Yu-Shiuan Tsai Yuk-Hang Sit 《Computer Modeling in Engineering & Sciences》 2025年第6期3065-3090,共26页
To improve small object detection and trajectory estimation from an aerial moving perspective,we propose the Aerial View Attention-PRB(AVA-PRB)model.AVA-PRB integrates two attention mechanisms—Coordinate Attention(CA... To improve small object detection and trajectory estimation from an aerial moving perspective,we propose the Aerial View Attention-PRB(AVA-PRB)model.AVA-PRB integrates two attention mechanisms—Coordinate Attention(CA)and the Convolutional Block Attention Module(CBAM)—to enhance detection accuracy.Additionally,Shape-IoU is employed as the loss function to refine localization precision.Our model further incorporates an adaptive feature fusion mechanism,which optimizes multi-scale object representation,ensuring robust tracking in complex aerial environments.We evaluate the performance of AVA-PRB on two benchmark datasets:Aerial Person Detection and VisDrone2019-Det.The model achieves 60.9%mAP@0.5 on the Aerial Person Detection dataset,and 51.2%mAP@0.5 on VisDrone2019-Det,demonstrating its effectiveness in aerial object detection.Beyond detection,we propose a novel trajectory estimation method that improves movement path prediction under aerial motion.Experimental results indicate that our approach reduces path deviation by up to 64%,effectively mitigating errors caused by rapid camera movements and background variations.By optimizing feature extraction and enhancing spatialtemporal coherence,our method significantly improves object tracking under aerial moving perspectives.This research addresses the limitations of fixed-camera tracking,enhancing flexibility and accuracy in aerial tracking applications.The proposed approach has broad potential for real-world applications,including surveillance,traffic monitoring,and environmental observation. 展开更多
关键词 Aerial View Attention-PRB(AVA-PRB) aerial object tracking small object detection deep learning for Aerial vision attention mechanisms in object detection shape-IoU loss function trajectory estimation drone-based visual surveillance
在线阅读 下载PDF
上一页 1 2 215 下一页 到第
使用帮助 返回顶部