期刊文献+
共找到40,593篇文章
< 1 2 250 >
每页显示 20 50 100
Graph-Based Transform and Dual Graph Laplacian Regularization for Depth Map Denoising
1
作者 MENG Yaqun GE Huayong +2 位作者 HOU Xinxin JI Yukai LI Sisi 《Journal of Donghua University(English Edition)》 2025年第5期534-542,共9页
Owing to the constraints of depth sensing technology,images acquired by depth cameras are inevitably mixed with various noises.For depth maps presented in gray values,this research proposes a novel denoising model,ter... Owing to the constraints of depth sensing technology,images acquired by depth cameras are inevitably mixed with various noises.For depth maps presented in gray values,this research proposes a novel denoising model,termed graph-based transform(GBT)and dual graph Laplacian regularization(DGLR)(DGLR-GBT).This model specifically aims to remove Gaussian white noise by capitalizing on the nonlocal self-similarity(NSS)and the piecewise smoothness properties intrinsic to depth maps.Within the group sparse coding(GSC)framework,a combination of GBT and DGLR is implemented.Firstly,within each group,the graph is constructed by using estimates of the true values of the averaged blocks instead of the observations.Secondly,the graph Laplacian regular terms are constructed based on rows and columns of similar block groups,respectively.Lastly,the solution is obtained effectively by combining the alternating direction multiplication method(ADMM)with the weighted thresholding method within the domain of GBT. 展开更多
关键词 depth map graph signal processing dual graph Laplacian regularization(DGLR) graph-based transform(GBT) group sparse coding(GSC)
在线阅读 下载PDF
Multi-resolution graph-based clustering analysis for lithofacies identifi cation from well log data: Case study of intraplatform bank gas fi elds, Amu Darya Basin 被引量:15
2
作者 Tian Yu Xu Hong +4 位作者 Zhang Xing-Yang Wang Hong-Jun Guo Tong-Cui Zhang Liang-Jie Gong Xing-Lin 《Applied Geophysics》 SCIE CSCD 2016年第4期598-607,736,共11页
In this study, we used the multi-resolution graph-based clustering (MRGC) method for determining the electrofacies (EF) and lithofacies (LF) from well log data obtained from the intraplatform bank gas fields loc... In this study, we used the multi-resolution graph-based clustering (MRGC) method for determining the electrofacies (EF) and lithofacies (LF) from well log data obtained from the intraplatform bank gas fields located in the Amu Darya Basin. The MRGC could automatically determine the optimal number of clusters without prior knowledge about the structure or cluster numbers of the analyzed data set and allowed the users to control the level of detail actually needed to define the EF. Based on the LF identification and successful EF calibration using core data, an MRGC EF partition model including five clusters and a quantitative LF interpretation chart were constructed. The EF clusters 1 to 5 were interpreted as lagoon, anhydrite flat, interbank, low-energy bank, and high-energy bank, and the coincidence rate in the cored interval could reach 85%. We concluded that the MRGC could be accurately applied to predict the LF in non-cored but logged wells. Therefore, continuous EF clusters were partitioned and corresponding LF were characteristics &different LF were analyzed interpreted, and the distribution and petrophysical in the framework of sequence stratigraphy. 展开更多
关键词 Multi-resolution graph-based clustering method electrofacies lithofacies intraplatform bank gas fields Amu Darya Basin
在线阅读 下载PDF
A graph-based approach for the structural analysis of road and building layouts 被引量:3
3
作者 Mathieu Domingo Rémy Thibaud Christophe Claramunt 《Geo-Spatial Information Science》 SCIE CSCD 2019年第1期59-72,共14页
A better understanding of the relationship between the structure and functions of urban and suburban spaces is one of the avenues of research still open for geographical information science.The research presented in t... A better understanding of the relationship between the structure and functions of urban and suburban spaces is one of the avenues of research still open for geographical information science.The research presented in this paper develops several graph-based metrics whose objective is to characterize some local and global structural properties that reflect the way the overall building layout can be cross-related to the one of the road layout.Such structural properties are modeled as an aggregation of parcels,buildings,and road networks.We introduce several computational measures(Ratio Minimum Distance,Minimum Ratio Minimum Distance,and Metric Compactness)that respectively evaluate the capability for a given road to be connected with the whole road network.These measures reveal emerging sub-network structures and point out differences between less-connective and moreconnective parts of the network.Based on these local and global properties derived from the topological and graph-based representation,and on building density metrics,this paper proposes an analysis of road and building layouts at different levels of granularity.The metrics developed are applied to a case study in which the derived properties reveal coherent as well as incoherent neighborhoods that illustrate the potential of the approach and the way buildings and roads can be relatively connected in a given urban environment.Overall,and by integrating the parcels and buildings layouts,this approach complements other previous and related works that mainly retain the configurational structure of the urban network as well as morphological studies whose focus is generally limited to the analysis of the building layout. 展开更多
关键词 Urban and suburban spaces graph-based modeling structural analysis GIS
原文传递
Low Data Overlab Rate Graph-Based SLAM with Distributed Submap Strategy 被引量:3
4
作者 XIANGjiawei ZHANG Jinyi +1 位作者 WANG Bin MA Yongbin 《Journal of Shanghai Jiaotong university(Science)》 EI 2020年第5期650-658,共9页
Simultaneous localization and mapping(SLAM)is widely used in many robot applications to acquire the unknown environment's map and the robots location.Graph-based SLAM is demonstrated to be effective in large-scale... Simultaneous localization and mapping(SLAM)is widely used in many robot applications to acquire the unknown environment's map and the robots location.Graph-based SLAM is demonstrated to be effective in large-scale scenarios,and it intuitively performs the SLAM as a pose graph.But because of the high data overlap rate,traditional graph-based SLAM is not efficient in some respects,such as real time performance and memory usage.To reduce1 data overlap rate,a graph-based SLAM with distributed submap strategy(DSS)is presented.In its front-end,submap based scan matching is processed and loop closing detection is conducted.Moreover in its back-end,pose graph is updated for global optimization and submap merging.From a series of experiments,it is demonstrated that graph-based SLAM with DSS reduces 51.79%data overlap rate,decreases 39.70%runtime and 24.60%memory usage.The advantages over other low overlap rate method is also proved in runtime,memory usage,accuracy and robustness performance. 展开更多
关键词 graph-based SLAM distributed submap strategy data overlap rate
原文传递
BotSward: Centrality Measures for Graph-Based Bot Detection Using Machine Learning
5
作者 Khlood Shinan Khalid Alsubhi M.Usman Ashraf 《Computers, Materials & Continua》 SCIE EI 2023年第1期693-714,共22页
The number of botnet malware attacks on Internet devices has grown at an equivalent rate to the number of Internet devices that are connected to the Internet.Bot detection using machine learning(ML)with flow-based fea... The number of botnet malware attacks on Internet devices has grown at an equivalent rate to the number of Internet devices that are connected to the Internet.Bot detection using machine learning(ML)with flow-based features has been extensively studied in the literature.Existing flow-based detection methods involve significant computational overhead that does not completely capture network communication patterns that might reveal other features ofmalicious hosts.Recently,Graph-Based Bot Detection methods using ML have gained attention to overcome these limitations,as graphs provide a real representation of network communications.The purpose of this study is to build a botnet malware detection system utilizing centrality measures for graph-based botnet detection and ML.We propose BotSward,a graph-based bot detection system that is based on ML.We apply the efficient centrality measures,which are Closeness Centrality(CC),Degree Centrality(CC),and PageRank(PR),and compare them with others used in the state-of-the-art.The efficiency of the proposed method is verified on the available Czech Technical University 13 dataset(CTU-13).The CTU-13 dataset contains 13 real botnet traffic scenarios that are connected to a command-and-control(C&C)channel and that cause malicious actions such as phishing,distributed denial-of-service(DDoS)attacks,spam attacks,etc.BotSward is robust to zero-day attacks,suitable for large-scale datasets,and is intended to produce better accuracy than state-of-the-art techniques.The proposed BotSward solution achieved 99%accuracy in botnet attack detection with a false positive rate as low as 0.0001%. 展开更多
关键词 Network security botnet detection graph-based features machine learning measure centrality
在线阅读 下载PDF
A Novel Method for Node Connectivity with Adaptive Dragonfly Algorithm and Graph-Based m-Connection Establishment in MANET
6
作者 S.B.Manoojkumaar C.Poongodi 《Computers, Materials & Continua》 SCIE EI 2020年第11期1649-1670,共22页
Maximizing network lifetime is measured as the primary issue in Mobile Ad-hoc Networks(MANETs).In geographically routing based models,packet transmission seems to be more appropriate in dense circumstances.The involve... Maximizing network lifetime is measured as the primary issue in Mobile Ad-hoc Networks(MANETs).In geographically routing based models,packet transmission seems to be more appropriate in dense circumstances.The involvement of the Heuristic model directly is not appropriate to offer an effectual solution as it becomes NP-hard issues;therefore investigators concentrate on using Meta-heuristic approaches.Dragonfly Optimization(DFO)is an effective meta-heuristic approach to resolve these problems by providing optimal solutions.Moreover,Meta-heuristic approaches(DFO)turn to be slower in convergence problems and need proper computational time while expanding network size.Thus,DFO is adaptively improved as Adaptive Dragonfly Optimization(ADFO)to fit this model and re-formulated using graph-based m-connection establishment(G-𝑚𝑚CE)to overcome computational time and DFO’s convergence based problems,considerably enhancing DFO performance.In(G-𝑚𝑚CE),Connectivity Zone(CZ)is chosen among source to destination in which optimality should be under those connected regions and ADFO is used for effective route establishment in CZ indeed of complete networking model.To measure complementary features of ADFO and(G-𝑚𝑚CE),hybridization of DFO-(G-𝑚𝑚CE)is anticipated over dense circumstances with reduced energy consumption and delay to enhance network lifetime.The simulation was performed in MATLAB environment. 展开更多
关键词 Routing connectivity zone ADFO mobile ad-hoc network graph-based m-connection establishment
在线阅读 下载PDF
Model Change Active Learning in Graph-Based Semi-supervised Learning
7
作者 Kevin S.Miller Andrea L.Bertozzi 《Communications on Applied Mathematics and Computation》 EI 2024年第2期1270-1298,共29页
Active learning in semi-supervised classification involves introducing additional labels for unlabelled data to improve the accuracy of the underlying classifier.A challenge is to identify which points to label to bes... Active learning in semi-supervised classification involves introducing additional labels for unlabelled data to improve the accuracy of the underlying classifier.A challenge is to identify which points to label to best improve performance while limiting the number of new labels."Model Change"active learning quantifies the resulting change incurred in the classifier by introducing the additional label(s).We pair this idea with graph-based semi-supervised learning(SSL)methods,that use the spectrum of the graph Laplacian matrix,which can be truncated to avoid prohibitively large computational and storage costs.We consider a family of convex loss functions for which the acquisition function can be efficiently approximated using the Laplace approximation of the posterior distribution.We show a variety of multiclass examples that illustrate improved performance over prior state-of-art. 展开更多
关键词 Active learning graph-based methods Semi-supervised learning(SSL) Graph Laplacian
在线阅读 下载PDF
Graph-Based Replication and Two Factor Authentication in Cloud Computing
8
作者 S.Lavanya N.M.Saravanakumar 《Computer Systems Science & Engineering》 SCIE EI 2023年第6期2869-2883,共15页
Many cutting-edge methods are now possible in real-time commercial settings and are growing in popularity on cloud platforms.By incorporating new,cutting-edge technologies to a larger extent without using more infrast... Many cutting-edge methods are now possible in real-time commercial settings and are growing in popularity on cloud platforms.By incorporating new,cutting-edge technologies to a larger extent without using more infrastructures,the information technology platform is anticipating a completely new level of devel-opment.The following concepts are proposed in this research paper:1)A reliable authentication method Data replication that is optimised;graph-based data encryp-tion and packing colouring in Redundant Array of Independent Disks(RAID)sto-rage.At the data centre,data is encrypted using crypto keys called Key Streams.These keys are produced using the packing colouring method in the web graph’s jump graph.In order to achieve space efficiency,the replication is carried out on optimised many servers employing packing colours.It would be thought that more connections would provide better authentication.This study provides an innovative architecture with robust security,enhanced authentication,and low cost. 展开更多
关键词 graph-based encryption REPLICATION ENCRYPTION packing coloring jump graph web graph stream cipher key stream
在线阅读 下载PDF
Method for Estimating the State of Health of Lithium-ion Batteries Based on Differential Thermal Voltammetry and Sparrow Search Algorithm-Elman Neural Network 被引量:1
9
作者 Yu Zhang Daoyu Zhang TiezhouWu 《Energy Engineering》 EI 2025年第1期203-220,共18页
Precisely estimating the state of health(SOH)of lithium-ion batteries is essential for battery management systems(BMS),as it plays a key role in ensuring the safe and reliable operation of battery systems.However,curr... Precisely estimating the state of health(SOH)of lithium-ion batteries is essential for battery management systems(BMS),as it plays a key role in ensuring the safe and reliable operation of battery systems.However,current SOH estimation methods often overlook the valuable temperature information that can effectively characterize battery aging during capacity degradation.Additionally,the Elman neural network,which is commonly employed for SOH estimation,exhibits several drawbacks,including slow training speed,a tendency to become trapped in local minima,and the initialization of weights and thresholds using pseudo-random numbers,leading to unstable model performance.To address these issues,this study addresses the challenge of precise and effective SOH detection by proposing a method for estimating the SOH of lithium-ion batteries based on differential thermal voltammetry(DTV)and an SSA-Elman neural network.Firstly,two health features(HFs)considering temperature factors and battery voltage are extracted fromthe differential thermal voltammetry curves and incremental capacity curves.Next,the Sparrow Search Algorithm(SSA)is employed to optimize the initial weights and thresholds of the Elman neural network,forming the SSA-Elman neural network model.To validate the performance,various neural networks,including the proposed SSA-Elman network,are tested using the Oxford battery aging dataset.The experimental results demonstrate that the method developed in this study achieves superior accuracy and robustness,with a mean absolute error(MAE)of less than 0.9%and a rootmean square error(RMSE)below 1.4%. 展开更多
关键词 Lithium-ion battery state of health differential thermal voltammetry Sparrow search Algorithm
在线阅读 下载PDF
Prediction of Shear Bond Strength of Asphalt Concrete Pavement Using Machine Learning Models and Grid Search Optimization Technique
10
作者 Quynh-Anh Thi Bui Dam Duc Nguyen +2 位作者 Hiep Van Le Indra Prakash Binh Thai Pham 《Computer Modeling in Engineering & Sciences》 SCIE EI 2025年第1期691-712,共22页
Determination of Shear Bond strength(SBS)at interlayer of double-layer asphalt concrete is crucial in flexible pavement structures.The study used three Machine Learning(ML)models,including K-Nearest Neighbors(KNN),Ext... Determination of Shear Bond strength(SBS)at interlayer of double-layer asphalt concrete is crucial in flexible pavement structures.The study used three Machine Learning(ML)models,including K-Nearest Neighbors(KNN),Extra Trees(ET),and Light Gradient Boosting Machine(LGBM),to predict SBS based on easily determinable input parameters.Also,the Grid Search technique was employed for hyper-parameter tuning of the ML models,and cross-validation and learning curve analysis were used for training the models.The models were built on a database of 240 experimental results and three input variables:temperature,normal pressure,and tack coat rate.Model validation was performed using three statistical criteria:the coefficient of determination(R2),the Root Mean Square Error(RMSE),and the mean absolute error(MAE).Additionally,SHAP analysis was also used to validate the importance of the input variables in the prediction of the SBS.Results show that these models accurately predict SBS,with LGBM providing outstanding performance.SHAP(Shapley Additive explanation)analysis for LGBM indicates that temperature is the most influential factor on SBS.Consequently,the proposed ML models can quickly and accurately predict SBS between two layers of asphalt concrete,serving practical applications in flexible pavement structure design. 展开更多
关键词 Shear bond asphalt pavement grid search OPTIMIZATION machine learning
在线阅读 下载PDF
Intelligent sequential multi-impulse collision avoidance method for non-cooperative spacecraft based on an improved search tree algorithm 被引量:1
11
作者 Xuyang CAO Xin NING +4 位作者 Zheng WANG Suyi LIU Fei CHENG Wenlong LI Xiaobin LIAN 《Chinese Journal of Aeronautics》 2025年第4期378-393,共16页
The problem of collision avoidance for non-cooperative targets has received significant attention from researchers in recent years.Non-cooperative targets exhibit uncertain states and unpredictable behaviors,making co... The problem of collision avoidance for non-cooperative targets has received significant attention from researchers in recent years.Non-cooperative targets exhibit uncertain states and unpredictable behaviors,making collision avoidance significantly more challenging than that for space debris.Much existing research focuses on the continuous thrust model,whereas the impulsive maneuver model is more appropriate for long-duration and long-distance avoidance missions.Additionally,it is important to minimize the impact on the original mission while avoiding noncooperative targets.On the other hand,the existing avoidance algorithms are computationally complex and time-consuming especially with the limited computing capability of the on-board computer,posing challenges for practical engineering applications.To conquer these difficulties,this paper makes the following key contributions:(A)a turn-based(sequential decision-making)limited-area impulsive collision avoidance model considering the time delay of precision orbit determination is established for the first time;(B)a novel Selection Probability Learning Adaptive Search-depth Search Tree(SPL-ASST)algorithm is proposed for non-cooperative target avoidance,which improves the decision-making efficiency by introducing an adaptive-search-depth mechanism and a neural network into the traditional Monte Carlo Tree Search(MCTS).Numerical simulations confirm the effectiveness and efficiency of the proposed method. 展开更多
关键词 Non-cooperative target Collision avoidance Limited motion area Impulsive maneuver model search tree algorithm Neural networks
原文传递
Elasticsearch在林业数据领域的应用
12
作者 范晓磊 陈钊 高金萍 《世界林业研究》 北大核心 2025年第1期60-66,共7页
大数据技术的快速发展,为存储和处理海量林业数据带来了新机遇。Elasticsearch是一个分布式、高扩展和高实时性的搜索与数据分析引擎,在处理海量林业数据方面具有诸多优势。文中聚焦Elasticsearch的应用,从林业数据的存储与管理、统计... 大数据技术的快速发展,为存储和处理海量林业数据带来了新机遇。Elasticsearch是一个分布式、高扩展和高实时性的搜索与数据分析引擎,在处理海量林业数据方面具有诸多优势。文中聚焦Elasticsearch的应用,从林业数据的存储与管理、统计与分析及可视化3个角度进行综述。在存储管理方面,Elasticsearch以分布式架构和副本分片机制实现同时处理海量的林业结构化数据和非结构化数据,实现多源异构数据的统一存储;在统计分析方面,Elasticsearch借助Aggregation框架和Refresh机制对林业实时数据和历史数据进行统计与分析,为林业资源管理、生态环境监测和灾害预警与防控等提供决策依据;在可视化方面,Elasticsearch结合Kibana可通过静态数据的历史沉淀和动态数据的实时更新实现对林业数据的多维展示,能够直观展示林业资源的现状、变化趋势及各要素间的关系。最后,结合深度学习、地理信息系统、区块链等技术展望了Elasticsearch在林业图像处理与分析、空间数据深度分析以及数据安全与共享方面的应用前景。 展开更多
关键词 Elasticsearch搜索引擎 林业数据 数据管理 大数据
原文传递
基于HDFS与Elastic Search的网络信息安全检测技术研究
13
作者 马力 李丽 《自动化与仪器仪表》 2025年第4期16-19,24,共5页
对网络信息安全检测问题进行研究,提出一种基于改进VGG19的异常检测模型,构建基于HDFS与Elastic Search网络信息安全检测系统对Web日志进行异常检测,并将检测结果进行可视化展示。首先,针对传统VGG19卷积神经网络的不足进行改进,并采用... 对网络信息安全检测问题进行研究,提出一种基于改进VGG19的异常检测模型,构建基于HDFS与Elastic Search网络信息安全检测系统对Web日志进行异常检测,并将检测结果进行可视化展示。首先,针对传统VGG19卷积神经网络的不足进行改进,并采用改进后的VGG19网络构建异常检测模型;然后将构建的异常检测模型部署到基于HDFS与Elastic Search网络信息安全检测系统中;最后采用Filebeat日志数据收集工具对互联网用户的访问日志进行采集并构建数据集,对构建的异常检测模型进行测试。测试结果表明:基于改进VGG19的异常检测模型在训练过程中,F1值为0.91、精确率为92.55%,在测试集上的平均检测准确率为94%、检测时间平均为0.25 s,检测精度高、检测速度快,适用于构建的网络信息安全检测系统。 展开更多
关键词 网络信息安全检测 VGG19网络 HDFS Elastic search
原文传递
Development of an active-detection mid-wave infrared search and track system based on "cat-eye effect"
14
作者 ZHOU Pan-Wei DING Xue-Zhuan +1 位作者 LI Fan-Ming YE Xi-Sheng 《红外与毫米波学报》 北大核心 2025年第4期617-629,共13页
In order to meet the urgent need of infrared search and track applications for accurate identification and positioning of infrared guidance aircraft,an active-detection mid-wave infrared search and track system(ADMWIR... In order to meet the urgent need of infrared search and track applications for accurate identification and positioning of infrared guidance aircraft,an active-detection mid-wave infrared search and track system(ADMWIRSTS)based on"cat-eye effect"was developed.The ADMWIRSTS mainly consists of both a light beam control subsystem and an infrared search and track subsystem.The light beam control subsystem uses an integrated opto-mechanical two-dimensional pointing mirror to realize the control function of the azimuth and pitch directions of the system,which can cover the whole airspace range of 360°×90°.The infrared search and track subsystem uses two mid-wave infrared cooled 640×512 focal plane detectors for co-aperture beam expanding,infrared and illumination laser beam combining,infrared search,and two-stage track opto-mechanical design.In this work,the system integration design and structural finite-element analysis were conducted,the search imaging and two-stage track imaging for external scenes were performed,and the active-detection technologies were experimentally verified in the laboratory.The experimental investigation results show that the system can realize the infrared search and track imaging,and the accurate identification and positioning of the mid-wave infrared guidance,or infrared detection system through the echo of the illumination laser.The aforementioned work has important technical significance and practical application value for the development of compactly-integrated high-precision infrared search and track,and laser suppression system,and has broad application prospects in the protection of equipment,assets and infrastructures. 展开更多
关键词 active-detection mid-wave infrared search and track "cat-eye effect" illumination laser light beam control
在线阅读 下载PDF
An in-Pixel Histogramming TDC Based on Octonary Search and 4-Tap Phase Detection for SPAD-Based Flash LiDAR Sensor
15
作者 HE Wenjie NIE Kaiming WU Haoran 《传感技术学报》 北大核心 2025年第9期1547-1558,共12页
An in-pixel histogramming time-to-digital converter(hTDC)based on octonary search and 4-tap phase detection is presented,aiming to improve frame rate while ensuring high precicion.The proposed hTDC is a 12-bit two-ste... An in-pixel histogramming time-to-digital converter(hTDC)based on octonary search and 4-tap phase detection is presented,aiming to improve frame rate while ensuring high precicion.The proposed hTDC is a 12-bit two-step converter consisting of a 6-bit coarse quantization and a 6-bit fine quantization,which supports a time resolution of 120 ps and multiphoton counting up to 2 GHz without a GHz reference frequency.The proposed hTDC is designed in 0.11μm CMOS process with an area consumption of 6900μm^(2).The data from a behavioral-level model is imported into the designed hTDC circuit for simulation verification.The post-simulation results show that the proposed hTDC achieves 0.8%depth precision in 9 m range for short-range system design specifications and 0.2%depth precision in 48 m range for long-range system design specifications.Under 30×10^(3) lux background light conditions,the proposed hTDC can be used for SPAD-based flash LiDAR sensor to achieve a frame rate to 40 fps with 200 ps resolution in 9 m range. 展开更多
关键词 LiDAR sensor histogramming time-to-digital converter hybrid time of flight octonary search 4-tap phase detection
在线阅读 下载PDF
Topological search and gradient descent boosted Runge-Kutta optimiser with application to engineering design and feature selection
16
作者 Jinge Shi Yi Chen +3 位作者 Ali Asghar Heidari Zhennao Cai Huiling Chen Guoxi Liang 《CAAI Transactions on Intelligence Technology》 2025年第2期557-614,共58页
The Runge-Kutta optimiser(RUN)algorithm,renowned for its powerful optimisation capabilities,faces challenges in dealing with increasing complexity in real-world problems.Specifically,it shows deficiencies in terms of ... The Runge-Kutta optimiser(RUN)algorithm,renowned for its powerful optimisation capabilities,faces challenges in dealing with increasing complexity in real-world problems.Specifically,it shows deficiencies in terms of limited local exploration capabilities and less precise solutions.Therefore,this research aims to integrate the topological search(TS)mechanism with the gradient search rule(GSR)into the framework of RUN,introducing an enhanced algorithm called TGRUN to improve the performance of the original algorithm.The TS mechanism employs a circular topological scheme to conduct a thorough exploration of solution regions surrounding each solution,enabling a careful examination of valuable solution areas and enhancing the algorithm’s effectiveness in local exploration.To prevent the algorithm from becoming trapped in local optima,the GSR also integrates gradient descent principles to direct the algorithm in a wider investigation of the global solution space.This study conducted a serious of experiments on the IEEE CEC2017 comprehensive benchmark function to assess the enhanced effectiveness of TGRUN.Additionally,the evaluation includes real-world engineering design and feature selection problems serving as an additional test for assessing the optimisation capabilities of the algorithm.The validation outcomes indicate a significant improvement in the optimisation capabilities and solution accuracy of TGRUN. 展开更多
关键词 engineering design gradient search rule metaheuristic algorithm Runge-Kutta optimizer topological search
在线阅读 下载PDF
Infrared small target detection based on spatial attention density peaks searching
17
作者 RAO Junmin LU Siyu +1 位作者 LIU Shijian LI Fanming 《Optoelectronics Letters》 2025年第2期90-96,共7页
The detection of small targets poses a significant challenge for infrared search and tracking (IRST) systems,as they must strike a delicate balance between accuracy and speed.In this paper,we propose a detection algor... The detection of small targets poses a significant challenge for infrared search and tracking (IRST) systems,as they must strike a delicate balance between accuracy and speed.In this paper,we propose a detection algorithm based on spatial attention density peaks searching (SADPS) and an adaptive window selection scheme.First,the difference-of-Gaussians (DoG) filter is introduced for preprocessing raw infrared images.Second,the image is processed by SADPS.Third,an adaptive window selection scheme is applied to obtain window templates for the target scale size.Then,the small target feature is used to enhance the target and suppress the background.Finally,the true targets are segmented through a threshold.The experimental results show that compared with the seven state-of-the-art small targets detection baseline algorithms,the proposed method not only has better detection accuracy,but also has reasonable time consumption. 展开更多
关键词 TEMPLATE searchING INFRARED
原文传递
ConvNeXt-Driven Dynamic Unified Network with Adaptive Feature Calibration for End-to-End Person Search
18
作者 Xiuchuan Cheng Meiling Wu +3 位作者 Xu Feng Zhiguo Wang Guisong Liu Ye Li 《Computers, Materials & Continua》 2025年第11期3527-3549,共23页
The requirement for precise detection and recognition of target pedestrians in unprocessed real-world imagery drives the formulation of person search as an integrated technological framework that unifies pedestrian de... The requirement for precise detection and recognition of target pedestrians in unprocessed real-world imagery drives the formulation of person search as an integrated technological framework that unifies pedestrian detection and person re-identification(Re-ID).However,the inherent discrepancy between the optimization objectives of coarse-grained localization in pedestrian detection and fine-grained discriminative learning in Re-ID,combined with the substantial performance degradation of Re-ID during joint training caused by the Faster R-CNN-based branch,collectively constitutes a critical bottleneck for person search.In this work,we propose a cascaded person searchmodel(SeqXt)based on SeqNet and ConvNeXt that adopts a sequential end-to-end network as its core architecture,artfully integrates the design logic of the two-stepmethod and one-step method framework,and concurrently incorporates the two-step method’s advantage in efficient subtask handling while preserving the one-step method’s efficiency in end-toend training.Firstly,we utilize ConvNeXt-Base as the feature extraction module,which incorporates part of the design concept of Transformer,enhances the consideration of global context information,and boosts feature discrimination through an implicit self-attention mechanism.Secondly,we introduce prototype-guided normalization for calibrating the feature distribution,which leverages the archetype features of individual identities to calibrate the feature distribution and thereby prevents features from being overly inclined towards frequently occurring IDs,notably improving the intra-class compactness and inter-class separability of person identities.Finally,we put forward an innovative loss function named the Dynamic Online Instance Matching Loss Function(DOIM),which employs the hard sample assistantmethod to adaptively update the lookup table(LUT)and the circular queue(CQ)and aims to further enhance the distinctiveness of features between classes.Experimental results on the public datasets CUHK-SYSU and PRWand the private dataset UESTC-PS show that the proposed method achieves state-of-the-art results. 展开更多
关键词 Person search Re-ID SeqNet ConvNeXt
在线阅读 下载PDF
An NOMA-VLC power allocation scheme for multi-user based on sparrow search algorithm
19
作者 WANG Xing WANG Haitao +3 位作者 DONG Zhenliang XIONG Yingfei SHI Huili WANG Ping 《Optoelectronics Letters》 2025年第5期278-283,共6页
A non-orthogonal multiple access(NOMA) power allocation scheme on the basis of the sparrow search algorithm(SSA) is proposed in this work. Specifically, the logarithmic utility function is utilized to address the pote... A non-orthogonal multiple access(NOMA) power allocation scheme on the basis of the sparrow search algorithm(SSA) is proposed in this work. Specifically, the logarithmic utility function is utilized to address the potential fairness issue that may arise from the maximum sum-rate based objective function and the optical power constraints are set considering the non-negativity of the transmit signal, the requirement of the human eyes safety and all users' quality of service(Qo S). Then, the SSA is utilized to solve this optimization problem. Moreover, to demonstrate the superiority of the proposed strategy, it is compared with the fixed power allocation(FPA) and the gain ratio power allocation(GRPA) schemes. Results show that regardless of the number of users considered, the sum-rate achieved by SSA consistently outperforms that of FPA and GRPA schemes. Specifically, compared to FPA and GRPA schemes, the sum-rate obtained by SSA is increased by 40.45% and 53.44% when the number of users is 7, respectively. The proposed SSA also has better performance in terms of user fairness. This work will benefit the design and development of the NOMA-visible light communication(VLC) systems. 展开更多
关键词 NOMA logarithmic utility function VLC Sparrow search Algorithm sparrow search algorithm ssa fairness issue power allocation Sum Rate
原文传递
Demonstration-enhanced policy search for space multi-arm robot collaborative skill learning
20
作者 Tian GAO Chengfei YUE +1 位作者 Xiaozhe JU Tao LIN 《Chinese Journal of Aeronautics》 2025年第3期462-473,共12页
The increasing complexity of on-orbit tasks imposes great demands on the flexible operation of space robotic arms, prompting the development of space robots from single-arm manipulation to multi-arm collaboration. In ... The increasing complexity of on-orbit tasks imposes great demands on the flexible operation of space robotic arms, prompting the development of space robots from single-arm manipulation to multi-arm collaboration. In this paper, a combined approach of Learning from Demonstration (LfD) and Reinforcement Learning (RL) is proposed for space multi-arm collaborative skill learning. The combination effectively resolves the trade-off between learning efficiency and feasible solution in LfD, as well as the time-consuming pursuit of the optimal solution in RL. With the prior knowledge of LfD, space robotic arms can achieve efficient guided learning in high-dimensional state-action space. Specifically, an LfD approach with Probabilistic Movement Primitives (ProMP) is firstly utilized to encode and reproduce the demonstration actions, generating a distribution as the initialization of policy. Then in the RL stage, a Relative Entropy Policy Search (REPS) algorithm modified in continuous state-action space is employed for further policy improvement. More importantly, the learned behaviors can maintain and reflect the characteristics of demonstrations. In addition, a series of supplementary policy search mechanisms are designed to accelerate the exploration process. The effectiveness of the proposed method has been verified both theoretically and experimentally. Moreover, comparisons with state-of-the-art methods have confirmed the outperformance of the approach. 展开更多
关键词 Space multi-arm collaboration Demonstrations .Reinforcement Learning Probabilistic Movement Primitives Relative Entropy Policy search Policy search mechanism
原文传递
上一页 1 2 250 下一页 到第
使用帮助 返回顶部