Large-scale point cloud datasets form the basis for training various deep learning networks and achieving high-quality network processing tasks.Due to the diversity and robustness constraints of the data,data augmenta...Large-scale point cloud datasets form the basis for training various deep learning networks and achieving high-quality network processing tasks.Due to the diversity and robustness constraints of the data,data augmentation(DA)methods are utilised to expand dataset diversity and scale.However,due to the complex and distinct characteristics of LiDAR point cloud data from different platforms(such as missile-borne and vehicular LiDAR data),directly applying traditional 2D visual domain DA methods to 3D data can lead to networks trained using this approach not robustly achieving the corresponding tasks.To address this issue,the present study explores DA for missile-borne LiDAR point cloud using a Monte Carlo(MC)simulation method that closely resembles practical application.Firstly,the model of multi-sensor imaging system is established,taking into account the joint errors arising from the platform itself and the relative motion during the imaging process.A distortion simulation method based on MC simulation for augmenting missile-borne LiDAR point cloud data is proposed,underpinned by an analysis of combined errors between different modal sensors,achieving high-quality augmentation of point cloud data.The effectiveness of the proposed method in addressing imaging system errors and distortion simulation is validated using the imaging scene dataset constructed in this paper.Comparative experiments between the proposed point cloud DA algorithm and the current state-of-the-art algorithms in point cloud detection and single object tracking tasks demonstrate that the proposed method can improve the network performance obtained from unaugmented datasets by over 17.3%and 17.9%,surpassing SOTA performance of current point cloud DA algorithms.展开更多
The final solution set given by almost all existing preference-based multi-objective evolutionary algorithms(MOEAs)lies a certain distance away from the decision makers’preference information region.Therefore,we prop...The final solution set given by almost all existing preference-based multi-objective evolutionary algorithms(MOEAs)lies a certain distance away from the decision makers’preference information region.Therefore,we propose a multi-ob jective optimization algorithm,referred to as the double-grid interactive preference based MOEA(DIPMOEA),which explicitly takes the preferences of decision makers(DMs)into account.First,according to the optimization ob jective of the practical multi-ob jective optimization problems and the preferences of DMs,the membership functions are mapped to generate a decision preference grid and a preference error grid.Then,we put forward two dominant modes of population,preference degree dominance and preference error dominance,and use this advantageous scheme to update the population in these two grids.Finally,the populations in these two grids are combined with the DMs’preference interaction information,and the preference multi-ob jective optimization interaction is performed.To verify the performance of DIP-MOEA,we test it on two kinds of problems,i.e.,the basic DTLZ series functions and the multi-ob jective knapsack problems,and compare it with several different popular preference-based MOEAs.Experimental results show that DIP-MOEA expresses the preference information of DMs well and provides a solution set that meets the preferences of DMs,quickly provides the test results,and has better performance in the distribution of the Pareto front solution set.展开更多
基金Postgraduate Innovation Top notch Talent Training Project of Hunan Province,Grant/Award Number:CX20220045Scientific Research Project of National University of Defense Technology,Grant/Award Number:22-ZZCX-07+2 种基金New Era Education Quality Project of Anhui Province,Grant/Award Number:2023cxcysj194National Natural Science Foundation of China,Grant/Award Numbers:62201597,62205372,1210456foundation of Hefei Comprehensive National Science Center,Grant/Award Number:KY23C502。
文摘Large-scale point cloud datasets form the basis for training various deep learning networks and achieving high-quality network processing tasks.Due to the diversity and robustness constraints of the data,data augmentation(DA)methods are utilised to expand dataset diversity and scale.However,due to the complex and distinct characteristics of LiDAR point cloud data from different platforms(such as missile-borne and vehicular LiDAR data),directly applying traditional 2D visual domain DA methods to 3D data can lead to networks trained using this approach not robustly achieving the corresponding tasks.To address this issue,the present study explores DA for missile-borne LiDAR point cloud using a Monte Carlo(MC)simulation method that closely resembles practical application.Firstly,the model of multi-sensor imaging system is established,taking into account the joint errors arising from the platform itself and the relative motion during the imaging process.A distortion simulation method based on MC simulation for augmenting missile-borne LiDAR point cloud data is proposed,underpinned by an analysis of combined errors between different modal sensors,achieving high-quality augmentation of point cloud data.The effectiveness of the proposed method in addressing imaging system errors and distortion simulation is validated using the imaging scene dataset constructed in this paper.Comparative experiments between the proposed point cloud DA algorithm and the current state-of-the-art algorithms in point cloud detection and single object tracking tasks demonstrate that the proposed method can improve the network performance obtained from unaugmented datasets by over 17.3%and 17.9%,surpassing SOTA performance of current point cloud DA algorithms.
基金supported by the National Natural Science Foundation of China(No.72101266)the Military Postgraduate Funding Project+2 种基金China(No.JY2021B042)the Hunan Provincial Postgraduate Scientific Research Innovation ProjectChina(No.CX20200029)。
文摘The final solution set given by almost all existing preference-based multi-objective evolutionary algorithms(MOEAs)lies a certain distance away from the decision makers’preference information region.Therefore,we propose a multi-ob jective optimization algorithm,referred to as the double-grid interactive preference based MOEA(DIPMOEA),which explicitly takes the preferences of decision makers(DMs)into account.First,according to the optimization ob jective of the practical multi-ob jective optimization problems and the preferences of DMs,the membership functions are mapped to generate a decision preference grid and a preference error grid.Then,we put forward two dominant modes of population,preference degree dominance and preference error dominance,and use this advantageous scheme to update the population in these two grids.Finally,the populations in these two grids are combined with the DMs’preference interaction information,and the preference multi-ob jective optimization interaction is performed.To verify the performance of DIP-MOEA,we test it on two kinds of problems,i.e.,the basic DTLZ series functions and the multi-ob jective knapsack problems,and compare it with several different popular preference-based MOEAs.Experimental results show that DIP-MOEA expresses the preference information of DMs well and provides a solution set that meets the preferences of DMs,quickly provides the test results,and has better performance in the distribution of the Pareto front solution set.
