期刊文献+
共找到39,607篇文章
< 1 2 250 >
每页显示 20 50 100
Individual tree segmentation in occluded complex forest stands through ellipsoid directional searching and point compensation
1
作者 Qingjun Zhang Shangshu Cai Xinlian Liang 《Forest Ecosystems》 CSCD 2024年第6期832-847,共16页
Terrestrial laser scanning(TLS)accurately captures tree structural information and provides prerequisites for treescale estimations of forest biophysical attributes.Quantifying tree-scale attributes from TLS point clo... Terrestrial laser scanning(TLS)accurately captures tree structural information and provides prerequisites for treescale estimations of forest biophysical attributes.Quantifying tree-scale attributes from TLS point clouds requires segmentation,yet the occlusion effects severely affect the accuracy of automated individual tree segmentation.In this study,we proposed a novel method using ellipsoid directional searching and point compensation algorithms to alleviate occlusion effects.Firstly,region growing and point compensation algorithms are used to determine the location of tree roots.Secondly,the neighbor points are extracted within an ellipsoid neighborhood to mitigate occlusion effects compared with k-nearest neighbor(KNN).Thirdly,neighbor points are uniformly subsampled by the directional searching algorithm based on the Fibonacci principle in multiple spatial directions to reduce memory consumption.Finally,a graph describing connectivity between a point and its neighbors is constructed,and it is utilized to complete individual tree segmentation based on the shortest path algorithm.The proposed method was evaluated on a public TLS dataset comprising six forest plots with three complexity categories in Evo,Finland,and it reached the highest mean accuracy of 77.5%,higher than previous studies on tree detection.We also extracted and validated the tree structure attributes using manual segmentation reference values.The RMSE,RMSE%,bias,and bias%of tree height,crown base height,crown projection area,crown surface area,and crown volume were used to evaluate the segmentation accuracy,respectively.Overall,the proposed method avoids many inherent limitations of current methods and can accurately map canopy structures in occluded complex forest stands. 展开更多
关键词 Terrestrial laser scanning Individual tree segmentation GRAPH The shortest path Ellipsoid directional searching Point compensation
在线阅读 下载PDF
Prediction of Shear Bond Strength of Asphalt Concrete Pavement Using Machine Learning Models and Grid Search Optimization Technique
2
作者 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
Method for Estimating the State of Health of Lithium-ion Batteries Based on Differential Thermal Voltammetry and Sparrow Search Algorithm-Elman Neural Network
3
作者 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
Research on Anti-collision Algorithm of Short Distance Data communication based on Binary-Tree Disassembly
4
作者 Zhongyue Hu 《International Journal of Technology Management》 2014年第8期30-32,共3页
This paper puts forward adaptive anti collision algorithm based on two fork tree decomposition. New search algorithm built on the basis of binary-tree algorithm, using the uniqueness of the label EPC, to estimate the ... This paper puts forward adaptive anti collision algorithm based on two fork tree decomposition. New search algorithm built on the basis of binary-tree algorithm, using the uniqueness of the label EPC, to estimate the distribution of label by slot allocation, the huge and complicated two fork tree is decomposed into several simple binary-tree by search the collision slots for binary-tree, so, it can simplifies the search process. The algorithm fully considers4 important performance parameters of the reader paging times, transmission delay, energy consumption and throughput label, the simulation results show that, the improved anti-collision algorithm is obviously improved performance than other two fork tree algorithm, it is more suitable for RFID anti-collision protocols. 展开更多
关键词 RFID ANTI-COLLISION binary-tree disassembly
在线阅读 下载PDF
An Advanced Bald Eagle Search Algorithm for Image Enhancement
5
作者 Pei Hu Yibo Han Jeng-Shyang Pan 《Computers, Materials & Continua》 2025年第3期4485-4501,共17页
Image enhancement utilizes intensity transformation functions to maximize the information content of enhanced images.This paper approaches the topic as an optimization problem and uses the bald eagle search(BES)algori... Image enhancement utilizes intensity transformation functions to maximize the information content of enhanced images.This paper approaches the topic as an optimization problem and uses the bald eagle search(BES)algorithm to achieve optimal results.In our proposed model,gamma correction and Retinex address color cast issues and enhance image edges and details.The final enhanced image is obtained through color balancing.The BES algorithm seeks the optimal solution through the selection,search,and swooping stages.However,it is prone to getting stuck in local optima and converges slowly.To overcome these limitations,we propose an improved BES algorithm(ABES)with enhanced population learning,position updates,and control parameters.ABES is employed to optimize the core parameters of gamma correction and Retinex to improve image quality,and the maximization of information entropy is utilized as the objective function.Real benchmark images are collected to validate its performance.Experimental results demonstrate that ABES outperforms the existing image enhancement methods,including the flower pollination algorithm,the chimp optimization algorithm,particle swarm optimization,and BES,in terms of information entropy,peak signal-to-noise ratio(PSNR),structural similarity index(SSIM),and patch-based contrast quality index(PCQI).ABES demonstrates superior performance both qualitatively and quantitatively,and it helps enhance prominent features and contrast in the images while maintaining the natural appearance of the original images. 展开更多
关键词 Image enhancement gamma correction RETINEX bald eagle search algorithm
在线阅读 下载PDF
Unveiling Effective Heuristic Strategies: A Review of Cross-Domain Heuristic Search Challenge Algorithms
6
作者 Mohamad Khairulamirin Md Razali MasriAyob +5 位作者 Abdul Hadi Abd Rahman Razman Jarmin Chian Yong Liu Muhammad Maaya Azarinah Izaham Graham Kendall 《Computer Modeling in Engineering & Sciences》 2025年第2期1233-1288,共56页
The Cross-domain Heuristic Search Challenge(CHeSC)is a competition focused on creating efficient search algorithms adaptable to diverse problem domains.Selection hyper-heuristics are a class of algorithms that dynamic... The Cross-domain Heuristic Search Challenge(CHeSC)is a competition focused on creating efficient search algorithms adaptable to diverse problem domains.Selection hyper-heuristics are a class of algorithms that dynamically choose heuristics during the search process.Numerous selection hyper-heuristics have different imple-mentation strategies.However,comparisons between them are lacking in the literature,and previous works have not highlighted the beneficial and detrimental implementation methods of different components.The question is how to effectively employ them to produce an efficient search heuristic.Furthermore,the algorithms that competed in the inaugural CHeSC have not been collectively reviewed.This work conducts a review analysis of the top twenty competitors from this competition to identify effective and ineffective strategies influencing algorithmic performance.A summary of the main characteristics and classification of the algorithms is presented.The analysis underlines efficient and inefficient methods in eight key components,including search points,search phases,heuristic selection,move acceptance,feedback,Tabu mechanism,restart mechanism,and low-level heuristic parameter control.This review analyzes the components referencing the competition’s final leaderboard and discusses future research directions for these components.The effective approaches,identified as having the highest quality index,are mixed search point,iterated search phases,relay hybridization selection,threshold acceptance,mixed learning,Tabu heuristics,stochastic restart,and dynamic parameters.Findings are also compared with recent trends in hyper-heuristics.This work enhances the understanding of selection hyper-heuristics,offering valuable insights for researchers and practitioners aiming to develop effective search algorithms for diverse problem domains. 展开更多
关键词 HYPER-HEURISTICS search algorithms optimization heuristic selection move acceptance learning DIVERSIFICATION parameter control
在线阅读 下载PDF
An Optimization Method for Reducing Losses in Distribution Networks Based on Tabu Search Algorithm
7
作者 Jiaqian Zhao Xiufang Gu +1 位作者 Xiaoyu Wei Mingyu Bao 《Journal of Electronic Research and Application》 2025年第2期181-190,共10页
With the continuous growth of power demand and the diversification of power consumption structure,the loss of distribution network has gradually become the focus of attention.Given the problems of single loss reductio... With the continuous growth of power demand and the diversification of power consumption structure,the loss of distribution network has gradually become the focus of attention.Given the problems of single loss reduction measure,lack of economy,and practicality in existing research,this paper proposes an optimization method of distribution network loss reduction based on tabu search algorithm and optimizes the combination and parameter configuration of loss reduction measure.The optimization model is developed with the goal of maximizing comprehensive benefits,incorporating both economic and environmental factors,and accounting for investment costs,including the loss of power reduction.Additionally,the model ensures that constraint conditions such as power flow equations,voltage deviations,and line transmission capacities are satisfied.The solution is obtained through a tabu search algorithm,which is well-suited for solving nonlinear problems with multiple constraints.Combined with the example of 10kV25 node construction,the simulation results show that the method can significantly reduce the network loss on the basis of ensuring the economy and environmental protection of the system,which provides a theoretical basis for distribution network planning. 展开更多
关键词 Distribution network Loss reduction measures ECONOMY Optimization model Tabu search algorithm
在线阅读 下载PDF
Research on the Application of Small UAVs in Maritime Search and Rescue Activities
8
作者 Xiuku Dan Jing Wei 《Journal of Electronic Research and Application》 2025年第1期282-287,共6页
In recent years,with the increasing frequency of global Marine activities,the occurrence probability of Marine accidents and emergencies has also increased.As a new technical means,small unmanned aerial vehicles(UAVs)... In recent years,with the increasing frequency of global Marine activities,the occurrence probability of Marine accidents and emergencies has also increased.As a new technical means,small unmanned aerial vehicles(UAVs)have shown great application potential in Marine search and rescue activities.In Marine search and rescue activities,small UAVs can quickly arrive at the scene of the accident and carry out efficient information collection and monitoring under its simple and flexible operation.Compared with traditional search and rescue methods,small UAVs can cover a wider area,provide more detailed and accurate on-site information,provide strong support for search and rescue decision-making,and thus improve the quality and efficiency of maritime rescue.In this regard,this paper first describes the application advantages of small UAVs in Marine search and rescue activities and then puts forward effective application paths,to provide some references for relevant researchers. 展开更多
关键词 Small unmanned aerial vehicle Maritime search and rescue Application path
在线阅读 下载PDF
Searching scheme in P2P system based on semantic overlay network 被引量:2
9
作者 霍英 陈志刚 《Journal of Southeast University(English Edition)》 EI CAS 2006年第3期330-333,共4页
In consideration of the limitation of super-peer overlay network, the semantic information was introduced into the super-peers' organization. A novel P2P (peer-to-peer) searching model, SSP2P, was put forward. The ... In consideration of the limitation of super-peer overlay network, the semantic information was introduced into the super-peers' organization. A novel P2P (peer-to-peer) searching model, SSP2P, was put forward. The peers in the model were organized in a natural area autonomy system (AAS) based on the smallworld theory. A super-peer was selected in each AAS based on power law; and all the super-peers formed different super-peer semantic networks. Thus, a hierarchical super-peer overlay network was formed. The results show that the model reduces the communication cost and enhances the search efficiency while ensuring the system expansibility. It proves that the introduction of semantic information in the construction of a super-peer overlay is favorable to P2P system capability. 展开更多
关键词 PEER-TO-PEER searching SEMANTIC SUPER-PEER small world
在线阅读 下载PDF
Semantic overlay network for searching taxonomy-based data sources 被引量:1
10
作者 乔百友 王国仁 谢可心 《Journal of Southeast University(English Edition)》 EI CAS 2007年第3期322-326,共5页
Distributed data sources which employ taxonomy hierarchy to describe the contents of their objects are considered, and a super-peer-based semantic overlay network (SSON) is proposed for sharing and searching their d... Distributed data sources which employ taxonomy hierarchy to describe the contents of their objects are considered, and a super-peer-based semantic overlay network (SSON) is proposed for sharing and searching their data objects. In SSON, peers are dynamically clustered into many semantic clusters based on the semantics of their data objects and organized in the semantic clusters into a semantic overlay network. Each semantic cluster consists of a super-peer and more peers, and is only responsible for answering queries in its semantic subspace. A query is first routed to the appropriate semantic clusters by an efficient searching algorithm, and then it is forwarded to the specific peers that hold the relevant data objects. Experimental results indicate that SSON has good scalability and achieves a competitive trade-off between search efficiency and costs. 展开更多
关键词 peer to peer (P2P) taxonomy hierarchy semantic searching
在线阅读 下载PDF
Optimal shape space and searching in the active shape model
11
作者 何良华 邹采荣 +1 位作者 赵力 胡蝶 《Journal of Southeast University(English Edition)》 EI CAS 2005年第3期263-267,共5页
A novel idea,called the optimal shape subspace (OSS) is first proposed for optimizing active shape model (ASM) search.It is constructed from the principal shape subspace and the principal shape variance subspace.I... A novel idea,called the optimal shape subspace (OSS) is first proposed for optimizing active shape model (ASM) search.It is constructed from the principal shape subspace and the principal shape variance subspace.It allows the reconstructed shape to vary more than that reconstructed in the standard ASM shape space,hence it is more expressive in representing shapes in real life.Then a cost function is developed,based on a study on the search process.An optimal searching method using the feedback information provided by the evaluation cost is proposed to improve the performance of ASM alignment.Experimental results show that the proposed OSS can offer the maximum shape variation with reserving the principal information and a unique local optimal shape is acquired after optimal searching.The combination of OSS and optimal searching can improve the ASM performance greatly. 展开更多
关键词 active shape model shape subspace search subspace principal component analysis
在线阅读 下载PDF
Parameter optimization of gravity density inversion based on correlation searching and the golden section algorithm 被引量:1
12
作者 孙鲁平 刘展 首皓 《Applied Geophysics》 SCIE CSCD 2012年第2期131-138,233,共9页
For density inversion of gravity anomaly data, once the inversion method is determined, the main factors affecting the inversion result are the inversion parameters and subdivision scheme. A set of reasonable inversio... For density inversion of gravity anomaly data, once the inversion method is determined, the main factors affecting the inversion result are the inversion parameters and subdivision scheme. A set of reasonable inversion parameters and subdivision scheme can, not only improve the inversion process efficiency, but also ensure inversion result accuracy. The gravity inversion method based on correlation searching and the golden section algorithm is an effective potential field inversion method. It can be used to invert 2D and 3D physical properties with potential data observed on flat or rough surfaces. In this paper, we introduce in detail the density inversion principles based on correlation searching and the golden section algorithm. Considering that the gold section algorithm is not globally optimized. we present a heuristic method to ensure the inversion result is globally optimized. With a series of model tests, we systematically compare and analyze the inversion result efficiency and accuracy with different parameters. Based on the model test results, we conclude the selection principles for each inversion parameter with which the inversion accuracy can be obviously improved. 展开更多
关键词 Density inversion correlation searching golden section algorithm inversion parameter optimization
在线阅读 下载PDF
A CONTACT SEARCHING ALGORITHM FOR CONTACT-IMPACT PROBLEMS 被引量:3
13
作者 王福军 程建钢 姚振汉 《Acta Mechanica Sinica》 SCIE EI CAS CSCD 2000年第4期374-382,共9页
A new contact searching algorithm for contact-impact systems is proposed in this paper.In terms of the cell structure and the linked-list,this algo- rithm solves the problem of sorting and searching contacts in three ... A new contact searching algorithm for contact-impact systems is proposed in this paper.In terms of the cell structure and the linked-list,this algo- rithm solves the problem of sorting and searching contacts in three dimensions by transforming it to a retrieving process from two one-dimensional arrays,and binary searching is no longer required.Using this algorithm, the cost of contact searching is reduced to the order of O(N)instead of O(Nlog_2N)for traditional ones,where N is the node number in the system.Moreover,this algorithm can handle contact systems with arbitrary mesh layouts.Due to the simplicity of this algorithm it can be easily implemented in a dynamic explicit finite element program.Our numerical experi- mental result shows that this algorithm is reliable arid efficient for contact searching of three dimensional systems. 展开更多
关键词 contact impact contact search finite element method
在线阅读 下载PDF
Emergency Local Searching Approach for Job Shop Scheduling 被引量:4
14
作者 ZHAO Ning CHEN Siyu DU Yanhua 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2013年第5期918-927,共10页
Existing methods of local search mostly focus on how to reach optimal solution.However,in some emergency situations,search time is the hard constraint for job shop scheduling problem while optimal solution is not nece... Existing methods of local search mostly focus on how to reach optimal solution.However,in some emergency situations,search time is the hard constraint for job shop scheduling problem while optimal solution is not necessary.In this situation,the existing method of local search is not fast enough.This paper presents an emergency local search(ELS) approach which can reach feasible and nearly optimal solution in limited search time.The ELS approach is desirable for the aforementioned emergency situations where search time is limited and a nearly optimal solution is sufficient,which consists of three phases.Firstly,in order to reach a feasible and nearly optimal solution,infeasible solutions are repaired and a repair technique named group repair is proposed.Secondly,in order to save time,the amount of local search moves need to be reduced and this is achieved by a quickly search method named critical path search(CPS).Finally,CPS sometimes stops at a solution far from the optimal one.In order to jump out the search dilemma of CPS,a jump technique based on critical part is used to improve CPS.Furthermore,the schedule system based on ELS has been developed and experiments based on this system completed on the computer of Intel Pentium(R) 2.93 GHz.The experimental result shows that the optimal solutions of small scale instances are reached in 2 s,and the nearly optimal solutions of large scale instances are reached in 4 s.The proposed ELS approach can stably reach nearly optimal solutions with manageable search time,and can be applied on some emergency situations. 展开更多
关键词 emergency local search job shop scheduling problem SCHEDULE critical path critical constraint part
在线阅读 下载PDF
Compact Scanning Tunneling Microscope with Large Scale Searching Capability for Mmultidisciplinary Applications
15
作者 孟文杰 王琦 +2 位作者 张晶 侯玉斌 陆轻铀 《Chinese Journal of Chemical Physics》 SCIE CAS CSCD 2016年第5期523-526,I0001,共5页
We present the design and performance of a home-built scanning tunneling microscope (STM), which is compact (66 mm tall and 25 mm in diameter), yet equipped with a 3D atomic precision piezoelectric motor in which ... We present the design and performance of a home-built scanning tunneling microscope (STM), which is compact (66 mm tall and 25 mm in diameter), yet equipped with a 3D atomic precision piezoelectric motor in which the Z coarse approach relies on a high simplic-ity friction-type walker (of our own invention) driven by an axially cut piezoelectric tube. The walker is vertically inserted in a piezoelectric scanner tube (PST) with its brim laying at on the PST end as the inertial slider (driven by the PST) for the XZ (sample plane) motion. The STM is designed to be capable of searching rare microscopic targets (defects, dopants, boundaries, nano-devices, etc.) in a macroscopic sample area (square millimeters) under extreme conditions (low temperatures, strong magnetic elds, etc.) in which it ts. It gives good atomic resolution images after scanning a highly oriented pyrolytic graphite sample in air at room temperature. 展开更多
关键词 Scanning tunneling microscope Large scale searching Air STM Electrochemical STM
在线阅读 下载PDF
WFRFT modulation recognition based on HOC and optimal order searching algorithm 被引量:6
16
作者 LIANG Yuan DA Xinyu +3 位作者 WU Jialiang XU Ruiyang ZHANG Zhe LIU Hujun 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2018年第3期462-470,共9页
A hybrid carrier(HC) scheme based on weighted-type fractional Fourier transform(WFRFT) has been proposed recently.While most of the works focus on HC scheme's inherent characteristics, little attention is paid to... A hybrid carrier(HC) scheme based on weighted-type fractional Fourier transform(WFRFT) has been proposed recently.While most of the works focus on HC scheme's inherent characteristics, little attention is paid to the WFRFT modulation recognition.In this paper, a new theory is provided to recognize the WFRFT modulation based on higher order cumulants(HOC). First, it is deduced that the optimal WFRFT received order can be obtained through the minimization of 4 th-order cumulants, C_(42). Then, a combinatorial searching algorithm is designed to minimize C_(42).Finally, simulation results show that the designed scheme has a high recognition rate and the combinatorial searching algorithm is effective and reliable. 展开更多
关键词 weighted-type fractional Fourier transform(WFRFT) modulation recognition higher order cumulants(HOC) combinatorial searching algorithm
在线阅读 下载PDF
Artificial Searching Swarm Algorithm and Its Performance Analysis 被引量:3
17
作者 Tanggong Chen Wang Guo Zhijian Gao 《Applied Mathematics》 2012年第10期1435-1441,共7页
Artificial Searching Swarm Algorithm (ASSA) is a new optimization algorithm. ASSA simulates the soldiers to search an enemy’s important goal, and transforms the process of solving optimization problem into the proces... Artificial Searching Swarm Algorithm (ASSA) is a new optimization algorithm. ASSA simulates the soldiers to search an enemy’s important goal, and transforms the process of solving optimization problem into the process of searching optimal goal by searching swarm with set rules. This work selects complicated and highn dimension functions to deeply analyse the performance for unconstrained and constrained optimization problems and the results produced by ASSA, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Artificial Fish-Swarm Algorithm (AFSA) have been compared. The main factors which influence the performance of ASSA are also discussed. The results demonstrate the effectiveness of the proposed ASSA optimization algorithm. 展开更多
关键词 Artificial searching SWARM ALGORITHM BIONIC Intelligent OPTIMIZATION ALGORITHM OPTIMIZATION Evolutionary Computation SWARM INTELLIGENCE
在线阅读 下载PDF
Fast Iterative Closest Point-Simultaneous Localization and Mapping(ICP-SLAM)with Rough Alignment and Narrowing-Scale Nearby Searching 被引量:2
18
作者 梁滨 张金艺 唐笛恺 《Journal of Donghua University(English Edition)》 EI CAS 2017年第4期583-590,共8页
Two deficiencies in traditional iterative closest pointsimultaneous localization and mapping( ICP-SLAM) usually result in poor real-time performance. On one hand, relative position between current scan frame and globa... Two deficiencies in traditional iterative closest pointsimultaneous localization and mapping( ICP-SLAM) usually result in poor real-time performance. On one hand, relative position between current scan frame and global map cannot be previously known. As a result, ICP algorithm will take much amount of iterations to reach convergence. On the other hand,establishment of correspondence is done by global searching, which requires enormous computational time. To overcome the two problems,a fast ICP-SLAM with rough alignment and narrowing-scale nearby searching is proposed. As for the decrease of iterative times,rough alignment based on initial pose matrix is proposed. In detail,initial pose matrix is obtained by micro-electro-mechanical system( MEMS) magnetometer and global landmarks. Then rough alignment will be applied between current scan frame and global map at the beginning of ICP algorithm with initial pose matrix. As for accelerating the establishment of correspondence, narrowingscale nearby searching with dynamic threshold is proposed,where match-points are found within a progressively constrictive range.Compared to traditional ICP-SLAM,the experimental results show that the amount of iteration for ICP algorithm to reach convergence reduces to 92. 34% and ICP algorithm runtime reduces to 98. 86% on average. In addition,computational cost is kept in a stable level due to the eliminating of the accumulation of computational consumption. Moreover,great improvement can also been achieved in SLAM quality and robustness. 展开更多
关键词 rough alignment initial pose matrix nearby searching dynamic threshold real-time performance
在线阅读 下载PDF
Grover quantum searching algorithm based on weighted targets 被引量:1
19
作者 Li Panchi Li Shiyong 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2008年第2期363-369,共7页
The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal... The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal. To solve this problem, a Grover searching algorithm based on weighted targets is proposed. First, each target is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the targets are represented as quantum superposition states. Second, the novel Grover searching algorithm based on the quantum superposition of the weighted targets is constructed. Using this algorithm, the probability of getting each target can be approximated to the corresponding weight coefficient, which shows the flexibility of this algorithm. Finally, the validity of the algorithm is proved by a simple searching example. 展开更多
关键词 Grover algorithm targets weighting quantum searching quantum computing.
在线阅读 下载PDF
Quantum Image Searching Based on Probability Distributions 被引量:3
20
作者 Fei Yan Abdullah M. Iliyasu +4 位作者 Chastine Fatichah Martin L. Tangel Janet P. Betancourt Fangyan Dong Kaoru Hirota 《Journal of Quantum Information Science》 2012年第3期55-60,共6页
A quantum image searching method is proposed based on the probability distributions of the readouts from the quantum measurements. It is achieved by using low computational resources which are only a single Hadamard g... A quantum image searching method is proposed based on the probability distributions of the readouts from the quantum measurements. It is achieved by using low computational resources which are only a single Hadamard gate combined with m + 1 quantum measurement operations. To validate the proposed method, a simulation experiment is used where the image with the highest similarity value of 0.93 to the particular test image is retrieved as the search result from 4 × 4 binary image database. The proposal provides a basic step for designing a search engine on quantum computing devices where the image in the database is retrieved based on its similarity to the test image. 展开更多
关键词 QUANTUM COMPUTATION IMAGE Processing QUANTUM IMAGE QUANTUM CIRCUIT IMAGE searching PROBABILITY Distribution
在线阅读 下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部