基于激光雷达(Light Detection And Ranging,LiDAR)数据重建树体三维模型并精准获取林木空间枝干结构参数对林木性状评价、森林动态经营管理与可视化研究具有重要意义。为此提出一种基于骨架细化提取的树木模型重建方法。首先,采用Focus...基于激光雷达(Light Detection And Ranging,LiDAR)数据重建树体三维模型并精准获取林木空间枝干结构参数对林木性状评价、森林动态经营管理与可视化研究具有重要意义。为此提出一种基于骨架细化提取的树木模型重建方法。首先,采用FocusS350/350 PLUS三维激光扫描仪获取3块不同树龄橡胶树的样地数据。然后,作为细化建模的重点,将枝干点云从原始树点中分离出来,再将其过度分割为若干点云簇,通过相邻点云簇判断是否有分枝以及动态确定骨架点间距,并将其运用在空间殖民算法以此来生成树的三维骨架点和骨架点连通性链表,根据连通链表结构自动识别树木中的主枝干和各个一级分枝,再通过广义圆柱体生成树干完成树木三维重建。最后,利用数字孪生技术对这3块不同树龄样地树木进行三维实景建模,使其穿越时空在同一空间中重现,以便更为直观地观察树木在生长过程中的形态变化。该算法得到的橡胶树胸径与实测值比对为,决定系数(R^(2))>0.91,均方根误差(root mean square Error,RMSE)<1.00 cm;主枝干与一级枝干的分枝角为,R^(2)>0.91,RMSE<2.93;一级枝干直径为,R^(2)>0.90,RMSE<1.41 cm;将3个树龄放在一起计算其生长参数,并与实测值进行对比,发现该算法同样适用于异龄林样地的各个生长参数计算。同时发现橡胶树的一级枝条的直径越大,其相对应的叶团簇体积就越大。运用人工智能的理论模型来处理林木的激光点云数据,旨在为森林的可视化以及树木骨架结构的智能化分析与处理等研究领域提供有价值的参考。展开更多
Steelmaking–refining–Continuous Casting(SCC) scheduling is a worldwide problem, which is NP-hard. Effective SCC scheduling algorithms can help to enhance productivity, and thus make significant monetary savings. Thi...Steelmaking–refining–Continuous Casting(SCC) scheduling is a worldwide problem, which is NP-hard. Effective SCC scheduling algorithms can help to enhance productivity, and thus make significant monetary savings. This paper develops an Improved Artificial Bee Colony(IABC) algorithm for the SCC scheduling. In the proposed IABC, charge permutation is employed to represent the solutions. In the population initialization, several solutions with certain quality are produced by a heuristic while others are generated randomly. Two variable neighborhood search neighborhood operators are devised to generate new high-quality solutions for the employed bee and onlooker bee phases, respectively. Meanwhile, in order to enhance the exploitation ability, a control parameter is introduced to conduct the search of onlooker bee phase. Moreover, to enhance the exploration ability,the new generated solutions are accepted with a control acceptance criterion. In the scout bee phase, the solution corresponding to a scout bee is updated by performing three swap operators and three insert operators with equal probability. Computational comparisons against several recent algorithms and a state-of-the-art SCC scheduling algorithm have demonstrated the strength and superiority of the IABC.展开更多
How to extract river nets effectively is of great significance for water resources investigation,flood forecasting and environmental monitoring,etc.In the paper,combining with ant colony algorithm,a new approach of ex...How to extract river nets effectively is of great significance for water resources investigation,flood forecasting and environmental monitoring,etc.In the paper,combining with ant colony algorithm,a new approach of extracting river nets on moderate-resolution imaging spectroradiometer(MODIS)remote sensing images was proposed through analyzing two general extraction methods of river nets.The experiment results show that river nets can be optimized by ant colony algorithm efficiently,and difference ratio between the experimental vectorgraph and the data of National Fundamental Geographic Information System is down to 8.7%.The proposed algorithm can work for extracting river nets on MODIS remote sensing images effectively.展开更多
This paper proposes a trust ant colony routing algorithm by introducing a node trust evaluation model based on the D-S evidence theory into the ant colony routing protocol to improve the security of wireless sensor ne...This paper proposes a trust ant colony routing algorithm by introducing a node trust evaluation model based on the D-S evidence theory into the ant colony routing protocol to improve the security of wireless sensor networks. To reduce the influence of conflict evidences caused by malicious nods, the consistent intensity is introduced to preprocess conflict evidences before using the D-S combination rule to improve the reliability of the D-S based trust evaluation. The nodes with high trust values will be selected as the routing nodes to insure the routing security, and the trust values are used as heuristic functions of the ant colony routing algorithm. The simulation tests are conducted by using the network simulator NS2 to observe the outcomes of performance metrics of packets loss rate and average end-to-end delay etc. to indirectly evaluate the security issue under the attack of inside malicious nodes. The simulation results show that the proposed trust routing algorithm can efficiently resist malicious attacks in terms of keeping performances of the average end-to-end delay, the throughtput and the routing packet overhead under attacking from malicious nodes.展开更多
Artificial bee colony(ABC) algorithm is motivated by the intelligent behavior of honey bees when seeking a high quality food source. It has a relatively simple structure but good global optimization ability. In order ...Artificial bee colony(ABC) algorithm is motivated by the intelligent behavior of honey bees when seeking a high quality food source. It has a relatively simple structure but good global optimization ability. In order to balance its global search and local search abilities further, some improvements for the standard ABC algorithm are made in this study. Firstly, the local search mechanism of cuckoo search optimization(CS) is introduced into the onlooker bee phase to enhance its dedicated search; secondly, the scout bee phase is also modified by the chaotic search mechanism. The improved ABC algorithm is used to identify the parameters of chaotic systems, the identified results from the present algorithm are compared with those from other algorithms. Numerical simulations, including Lorenz system and a hyper chaotic system, illustrate the present algorithm is a powerful tool for parameter estimation with high accuracy and low deviations. It is not sensitive to artificial measurement noise even using limited input data.展开更多
文摘基于激光雷达(Light Detection And Ranging,LiDAR)数据重建树体三维模型并精准获取林木空间枝干结构参数对林木性状评价、森林动态经营管理与可视化研究具有重要意义。为此提出一种基于骨架细化提取的树木模型重建方法。首先,采用FocusS350/350 PLUS三维激光扫描仪获取3块不同树龄橡胶树的样地数据。然后,作为细化建模的重点,将枝干点云从原始树点中分离出来,再将其过度分割为若干点云簇,通过相邻点云簇判断是否有分枝以及动态确定骨架点间距,并将其运用在空间殖民算法以此来生成树的三维骨架点和骨架点连通性链表,根据连通链表结构自动识别树木中的主枝干和各个一级分枝,再通过广义圆柱体生成树干完成树木三维重建。最后,利用数字孪生技术对这3块不同树龄样地树木进行三维实景建模,使其穿越时空在同一空间中重现,以便更为直观地观察树木在生长过程中的形态变化。该算法得到的橡胶树胸径与实测值比对为,决定系数(R^(2))>0.91,均方根误差(root mean square Error,RMSE)<1.00 cm;主枝干与一级枝干的分枝角为,R^(2)>0.91,RMSE<2.93;一级枝干直径为,R^(2)>0.90,RMSE<1.41 cm;将3个树龄放在一起计算其生长参数,并与实测值进行对比,发现该算法同样适用于异龄林样地的各个生长参数计算。同时发现橡胶树的一级枝条的直径越大,其相对应的叶团簇体积就越大。运用人工智能的理论模型来处理林木的激光点云数据,旨在为森林的可视化以及树木骨架结构的智能化分析与处理等研究领域提供有价值的参考。
基金Supported by the National Natural Science Foundation of China(51705177,51575212)the Program for New Century Excellent Talents in University(NCET-13-0106)the Program for HUST Academic Frontier Youth Team
文摘Steelmaking–refining–Continuous Casting(SCC) scheduling is a worldwide problem, which is NP-hard. Effective SCC scheduling algorithms can help to enhance productivity, and thus make significant monetary savings. This paper develops an Improved Artificial Bee Colony(IABC) algorithm for the SCC scheduling. In the proposed IABC, charge permutation is employed to represent the solutions. In the population initialization, several solutions with certain quality are produced by a heuristic while others are generated randomly. Two variable neighborhood search neighborhood operators are devised to generate new high-quality solutions for the employed bee and onlooker bee phases, respectively. Meanwhile, in order to enhance the exploitation ability, a control parameter is introduced to conduct the search of onlooker bee phase. Moreover, to enhance the exploration ability,the new generated solutions are accepted with a control acceptance criterion. In the scout bee phase, the solution corresponding to a scout bee is updated by performing three swap operators and three insert operators with equal probability. Computational comparisons against several recent algorithms and a state-of-the-art SCC scheduling algorithm have demonstrated the strength and superiority of the IABC.
基金National High Technology Research and Development Program of China(No.2007AA120305)National ScienceFoundation of China(No.40771145)+2 种基金Special Project of Ministry of Science and Technology of China(No.GYHY20070628)Subtopics of Ministry of Land and Resources Project of China(No.KD081902-03)Scientific Research and Innovation Project of Graduate School of Shanghai University,China(No.SHUCX101033)
文摘How to extract river nets effectively is of great significance for water resources investigation,flood forecasting and environmental monitoring,etc.In the paper,combining with ant colony algorithm,a new approach of extracting river nets on moderate-resolution imaging spectroradiometer(MODIS)remote sensing images was proposed through analyzing two general extraction methods of river nets.The experiment results show that river nets can be optimized by ant colony algorithm efficiently,and difference ratio between the experimental vectorgraph and the data of National Fundamental Geographic Information System is down to 8.7%.The proposed algorithm can work for extracting river nets on MODIS remote sensing images effectively.
基金supported by the National Natural Science Foundation of China(NSFC)under Grant No.61373126the Natural Science Foundation of Jiangsu Province of China under Grant No.BK20131107the Fundamental Research Funds for the Central Universities under Grant No.JUSRP51510
文摘This paper proposes a trust ant colony routing algorithm by introducing a node trust evaluation model based on the D-S evidence theory into the ant colony routing protocol to improve the security of wireless sensor networks. To reduce the influence of conflict evidences caused by malicious nods, the consistent intensity is introduced to preprocess conflict evidences before using the D-S combination rule to improve the reliability of the D-S based trust evaluation. The nodes with high trust values will be selected as the routing nodes to insure the routing security, and the trust values are used as heuristic functions of the ant colony routing algorithm. The simulation tests are conducted by using the network simulator NS2 to observe the outcomes of performance metrics of packets loss rate and average end-to-end delay etc. to indirectly evaluate the security issue under the attack of inside malicious nodes. The simulation results show that the proposed trust routing algorithm can efficiently resist malicious attacks in terms of keeping performances of the average end-to-end delay, the throughtput and the routing packet overhead under attacking from malicious nodes.
基金supported by the National Natural Science Foundation of China(Grant Nos.11172333&11272361)the Guangdong Province Natural Science Foundation(Grant No.2015A030313126)the Guangdong Province Science and Technology Program(Grant Nos.2014A020218004&2016A020223006)
文摘Artificial bee colony(ABC) algorithm is motivated by the intelligent behavior of honey bees when seeking a high quality food source. It has a relatively simple structure but good global optimization ability. In order to balance its global search and local search abilities further, some improvements for the standard ABC algorithm are made in this study. Firstly, the local search mechanism of cuckoo search optimization(CS) is introduced into the onlooker bee phase to enhance its dedicated search; secondly, the scout bee phase is also modified by the chaotic search mechanism. The improved ABC algorithm is used to identify the parameters of chaotic systems, the identified results from the present algorithm are compared with those from other algorithms. Numerical simulations, including Lorenz system and a hyper chaotic system, illustrate the present algorithm is a powerful tool for parameter estimation with high accuracy and low deviations. It is not sensitive to artificial measurement noise even using limited input data.
