Traditional large-scale multi-objective optimization algorithms(LSMOEAs)encounter difficulties when dealing with sparse large-scale multi-objective optimization problems(SLM-OPs)where most decision variables are zero....Traditional large-scale multi-objective optimization algorithms(LSMOEAs)encounter difficulties when dealing with sparse large-scale multi-objective optimization problems(SLM-OPs)where most decision variables are zero.As a result,many algorithms use a two-layer encoding approach to optimize binary variable Mask and real variable Dec separately.Nevertheless,existing optimizers often focus on locating non-zero variable posi-tions to optimize the binary variables Mask.However,approxi-mating the sparse distribution of real Pareto optimal solutions does not necessarily mean that the objective function is optimized.In data mining,it is common to mine frequent itemsets appear-ing together in a dataset to reveal the correlation between data.Inspired by this,we propose a novel two-layer encoding learning swarm optimizer based on frequent itemsets(TELSO)to address these SLMOPs.TELSO mined the frequent terms of multiple particles with better target values to find mask combinations that can obtain better objective values for fast convergence.Experi-mental results on five real-world problems and eight benchmark sets demonstrate that TELSO outperforms existing state-of-the-art sparse large-scale multi-objective evolutionary algorithms(SLMOEAs)in terms of performance and convergence speed.展开更多
This paper addresses the problem of complex and challenging disturbance localization in the current power system operation environment by proposing a disturbance localization method for power systems based on group sp...This paper addresses the problem of complex and challenging disturbance localization in the current power system operation environment by proposing a disturbance localization method for power systems based on group sparse representation and entropy weight method.Three different electrical quantities are selected as observations in the compressed sensing algorithm.The entropy weighting method is employed to calculate the weights of different observations based on their relative disturbance levels.Subsequently,by leveraging the topological information of the power system and pre-designing an overcomplete dictionary of disturbances based on the corresponding system parameter variations caused by disturbances,an improved Joint Generalized Orthogonal Matching Pursuit(J-GOMP)algorithm is utilized for reconstruction.The reconstructed sparse vectors are divided into three parts.If at least two parts have consistent node identifiers,the node is identified as the disturbance node.If the node identifiers in all three parts are inconsistent,further analysis is conducted considering the weights to determine the disturbance node.Simulation results based on the IEEE 39-bus system model demonstrate that the proposed method,utilizing electrical quantity information from only 8 measurement points,effectively locates disturbance positions and is applicable to various disturbance types with strong noise resistance.展开更多
In airborne array synthetic aperture radar(SAR), the three-dimensional(3D) imaging performance and cross-track resolution depends on the length of the equivalent array. In this paper, Barker sequence criterion is used...In airborne array synthetic aperture radar(SAR), the three-dimensional(3D) imaging performance and cross-track resolution depends on the length of the equivalent array. In this paper, Barker sequence criterion is used for sparse flight sampling of airborne array SAR, in order to obtain high cross-track resolution in as few times of flights as possible. Under each flight, the imaging algorithm of back projection(BP) and the data extraction method based on modified uniformly redundant arrays(MURAs) are utilized to obtain complex 3D image pairs. To solve the side-lobe noise in images, the interferometry between each image pair is implemented, and compressed sensing(CS) reconstruction is adopted in the frequency domain. Furthermore, to restore the geometrical relationship between each flight, the phase information corresponding to negative MURA is compensated on each single-pass image reconstructed by CS. Finally,by coherent accumulation of each complex image, the high resolution in cross-track direction is obtained. Simulations and experiments in X-band verify the availability.展开更多
An improved adaptive genetic algorithm is presented in this paper. It primarily includes two modified methods: one is novel adaptive probabilities of crossover and mutation, the other is truncated selection approach....An improved adaptive genetic algorithm is presented in this paper. It primarily includes two modified methods: one is novel adaptive probabilities of crossover and mutation, the other is truncated selection approach. This algorithm has been validated to be superior to the simple genetic algorithm (SGA) by a complicated binary testing function. Then the proposed algorithm is applied to optimizing the planar retrodirective array to reduce the cost of the hardware. The fitness function is discussed in the optimization example. After optimization, the sparse planar retrodirective antenna array keeps excellent retrodirectivity, while the array architecture has been simplified by 34%. The optimized antenna array can replace uniform full array effectively. Results show that this work will gain more engineering benefits in practice.展开更多
A novel sparse matrix technique for the numerical analysis of semiconductor devicesand its algorithms are presented.Storage scheme and calculation procedure of the sparse matrixare described in detail.The sparse matri...A novel sparse matrix technique for the numerical analysis of semiconductor devicesand its algorithms are presented.Storage scheme and calculation procedure of the sparse matrixare described in detail.The sparse matrix technique in the device simulation can decrease storagegreatly with less CPU time and its implementation is very easy.Some algorithms and calculationexamples to show the time and space characteristics of the sparse matrix are given.展开更多
For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation (BP) algorithm. ...For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation (BP) algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement.展开更多
Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design...Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design an iterative algorithm,namely the iteratively reweighted algorithm(IR-algorithm),for efficiently computing the sparse solutions to the proposed regularization model.The convergence of the IR-algorithm and the setting of the regularization parameters are analyzed at length.Finally,we present numerical examples to illustrate the features of the new regularization and algorithm.展开更多
针对现有波达方向估计(Direction of Arrival, DOA)算法在低信噪比、多信源条件下估计精度不足、效率低等问题,提出了一种基于可分离替代函数算法的矢量水听器阵列多快拍DOA估计方法.首先对空域等角度均匀划分,构造出超完备冗余字典,建...针对现有波达方向估计(Direction of Arrival, DOA)算法在低信噪比、多信源条件下估计精度不足、效率低等问题,提出了一种基于可分离替代函数算法的矢量水听器阵列多快拍DOA估计方法.首先对空域等角度均匀划分,构造出超完备冗余字典,建立信号多快拍数据在空域的稀疏表示模型,然后采用可分离替代函数算法思想解决稀疏重构问题,求解出信号在空域的稀疏系数矩阵,最后将稀疏矩阵中行向量的范数映射到空域网格上,得到DOA估计值.仿真实验表明:该方法在低信噪比、多信源条件下拥有比子空间类算法、贪婪类算法以及现有凸优化类估计算法更高的DOA估计精度和更强的鲁棒性,与同类算法相比执行效率更高.展开更多
The deep deterministic policy gradient(DDPG)algo-rithm is an off-policy method that combines two mainstream reinforcement learning methods based on value iteration and policy iteration.Using the DDPG algorithm,agents ...The deep deterministic policy gradient(DDPG)algo-rithm is an off-policy method that combines two mainstream reinforcement learning methods based on value iteration and policy iteration.Using the DDPG algorithm,agents can explore and summarize the environment to achieve autonomous deci-sions in the continuous state space and action space.In this paper,a cooperative defense with DDPG via swarms of unmanned aerial vehicle(UAV)is developed and validated,which has shown promising practical value in the effect of defending.We solve the sparse rewards problem of reinforcement learning pair in a long-term task by building the reward function of UAV swarms and optimizing the learning process of artificial neural network based on the DDPG algorithm to reduce the vibration in the learning process.The experimental results show that the DDPG algorithm can guide the UAVs swarm to perform the defense task efficiently,meeting the requirements of a UAV swarm for non-centralization,autonomy,and promoting the intelligent development of UAVs swarm as well as the decision-making process.展开更多
Broadband wireless channels are often time dispersive and become strongly frequency selective in delay spread domain. Commonly, these channels are composed of a few dominant coefficients and a large part of coefficien...Broadband wireless channels are often time dispersive and become strongly frequency selective in delay spread domain. Commonly, these channels are composed of a few dominant coefficients and a large part of coefficients are approximately zero or under noise floor. To exploit sparsity of multi-path channels (MPCs), there are various methods have been proposed. They are, namely, greedy algorithms, iterative algorithms, and convex program. The former two algorithms are easy to be implemented but not stable;on the other hand, the last method is stable but difficult to be implemented as practical channel estimation problems be-cause of computational complexity. In this paper, we introduce a novel channel estimation strategy using smooth L0 (SL0) algorithm which combines stable and low complexity. Computer simulations confirm the effectiveness of the introduced algorithm. We also give various simulations to verify the sensing training signal method.展开更多
The dense and accurate measurement of 3D texture is helpful in evaluating the pavement function.To form dense mandatory constraints and improve matching accuracy,the traditional binocular reconstruction technology was...The dense and accurate measurement of 3D texture is helpful in evaluating the pavement function.To form dense mandatory constraints and improve matching accuracy,the traditional binocular reconstruction technology was improved threefold.First,a single moving laser line was introduced to carry out global scanning constraints on the target,which would well overcome the difficulty of installing and recognizing excessive laser lines.Second,four kinds of improved algorithms,namely,disparity replacement,superposition synthesis,subregion segmentation,and subregion segmentation centroid enhancement,were established based on different constraint mechanism.Last,the improved binocular reconstruction test device was developed to realize the dual functions of 3D texture measurement and precision self-evaluation.Results show that compared with traditional algorithms,the introduction of a single laser line scanning constraint is helpful in improving the measurement’s accuracy.Among various improved algorithms,the improvement effect of the subregion segmentation centroid enhancement method is the best.It has a good effect on both overall measurement and single pointmeasurement,which can be considered to be used in pavement function evaluation.展开更多
The staggered distribution of joints and fissures in space constitutes the weak part of any rock mass.The identification of rock mass structural planes and the extraction of characteristic parameters are the basis of ...The staggered distribution of joints and fissures in space constitutes the weak part of any rock mass.The identification of rock mass structural planes and the extraction of characteristic parameters are the basis of rock-mass integrity evaluation,which is very important for analysis of slope stability.The laser scanning technique can be used to acquire the coordinate information pertaining to each point of the structural plane,but large amount of point cloud data,uneven density distribution,and noise point interference make the identification efficiency and accuracy of different types of structural planes limited by point cloud data analysis technology.A new point cloud identification and segmentation algorithm for rock mass structural surfaces is proposed.Based on the distribution states of the original point cloud in different neighborhoods in space,the point clouds are characterized by multi-dimensional eigenvalues and calculated by the robust randomized Hough transform(RRHT).The normal vector difference and the final eigenvalue are proposed for characteristic distinction,and the identification of rock mass structural surfaces is completed through regional growth,which strengthens the difference expression of point clouds.In addition,nearest Voxel downsampling is also introduced in the RRHT calculation,which further reduces the number of sources of neighborhood noises,thereby improving the accuracy and stability of the calculation.The advantages of the method have been verified by laboratory models.The results showed that the proposed method can better achieve the segmentation and statistics of structural planes with interfaces and sharp boundaries.The method works well in the identification of joints,fissures,and other structural planes on Mangshezhai slope in the Three Gorges Reservoir area,China.It can provide a stable and effective technique for the identification and segmentation of rock mass structural planes,which is beneficial in engineering practice.展开更多
Background:Three-dimensional printing technology may become a key factor in transforming clinical practice and in significant improvement of treatment outcomes.The introduction of this technique into pediatric cardiac...Background:Three-dimensional printing technology may become a key factor in transforming clinical practice and in significant improvement of treatment outcomes.The introduction of this technique into pediatric cardiac surgery will allow us to study features of the anatomy and spatial relations of a defect and to simulate the optimal surgical repair on a printed model in every individual case.Methods:We performed the prospective cohort study which included 29 children with congenital heart defects.The hearts and the great vessels were modeled and printed out.Measurements of the same cardiac areas were taken in the same planes and points at multislice computed tomography images(group 1)and on printed 3D models of the hearts(group 2).Pre-printing treatment of the multislice computed tomography data and 3D model preparation were performed according to a newly developed algorithm.Results:The measurements taken on the 3D-printed cardiac models and the tomographic images did not differ significantly,which allowed us to conclude that the models were highly accurate and informative.The new algorithm greatly simplifies and speeds up the preparation of a 3D model for printing,while maintaining high accuracy and level of detail.Conclusions:The 3D-printed models provide an accurate preoperative assessment of the anatomy of a defect in each case.The new algorithm has several important advantages over other available programs.They enable the development of customized preliminary plans for surgical repair of each specific complex congenital heart disease,predict possible issues,determine the optimal surgical tactics,and significantly improve surgical outcomes.展开更多
Extracting nonlinear governing equations from noisy data is a central challenge in the analysis of complicated nonlinear behaviors.Despite researchers follow the sparse identification nonlinear dynamics algorithm(SIND...Extracting nonlinear governing equations from noisy data is a central challenge in the analysis of complicated nonlinear behaviors.Despite researchers follow the sparse identification nonlinear dynamics algorithm(SINDy)rule to restore nonlinear equations,there also exist obstacles.One is the excessive dependence on empirical parameters,which increases the difficulty of data pre-processing.Another one is the coexistence of multiple coefficient vectors,which causes the optimal solution to be drowned in multiple solutions.The third one is the composition of basic function,which is exclusively applicable to specific equations.In this article,a local sparse screening identification algorithm(LSSI)is proposed to identify nonlinear systems.First,we present the k-neighbor parameter to replace all empirical parameters in data filtering.Second,we combine the mean error screening method with the SINDy algorithm to select the optimal one from multiple solutions.Third,the time variable t is introduced to expand the scope of the SINDy algorithm.Finally,the LSSI algorithm is applied to recover a classic ODE and a bi-stable energy harvester system.The results show that the new algorithm improves the ability of noise immunity and optimal parameters identification provides a desired foundation for nonlinear analyses.展开更多
稀疏重构类算法在雷达目标参数估计中的应用一直是近年来的热门,但由于稀疏重构类算法的局限性,在进行目标波达方向(direction of arrival,DOA)估计时受到原子间的互相影响,从而使多目标测角精度降低。针对此问题,提出一种基于信号分离...稀疏重构类算法在雷达目标参数估计中的应用一直是近年来的热门,但由于稀疏重构类算法的局限性,在进行目标波达方向(direction of arrival,DOA)估计时受到原子间的互相影响,从而使多目标测角精度降低。针对此问题,提出一种基于信号分离迭代思想的松弛子空间追踪算法。首先求出回波信号与归一化后字典矩阵相关性最强的多个原子作为初步估计值,再利用初步估计的角度构建代价函数,反复估计直至代价函数收敛。仿真结果表明,所提算法减小了目标个数和相位差的影响,提高了多目标DOA估计的测角精度,同时相较于传统的松弛算法减少了运算量。展开更多
Downward Looking Sparse Linear Array Three Dimensional SAR(DLSLA 3D SAR) is an important form of 3D SAR imaging, which has a widespread application field. Since its practical equivalent phase centers are usually distr...Downward Looking Sparse Linear Array Three Dimensional SAR(DLSLA 3D SAR) is an important form of 3D SAR imaging, which has a widespread application field. Since its practical equivalent phase centers are usually distributed sparsely and nonuniformly, traditional 3D SAR algorithms suffer from low resolution and high sidelobes in cross-track dimension. To deal with this problem, this paper introduces a method based on back-projection and convex optimization to achieve 3D high accuracy imaging reconstruction. Compared with traditional SAR algorithms, the proposed method sufficiently utilizes the sparsity of the 3D SAR imaging scene and can achieve lower sidelobes and higher resolution in cross-track dimension. In the simulated experiments, the reconstructed results of both simple and complex imaging scene verify that the proposed method outperforms 3D back-projection algorithm and shows satisfying cross-track dimensional resolution and good robustness to noise.展开更多
基金supported by the Scientific Research Project of Xiang Jiang Lab(22XJ02003)the University Fundamental Research Fund(23-ZZCX-JDZ-28)+5 种基金the National Science Fund for Outstanding Young Scholars(62122093)the National Natural Science Foundation of China(72071205)the Hunan Graduate Research Innovation Project(ZC23112101-10)the Hunan Natural Science Foundation Regional Joint Project(2023JJ50490)the Science and Technology Project for Young and Middle-aged Talents of Hunan(2023TJ-Z03)the Science and Technology Innovation Program of Humnan Province(2023RC1002)。
文摘Traditional large-scale multi-objective optimization algorithms(LSMOEAs)encounter difficulties when dealing with sparse large-scale multi-objective optimization problems(SLM-OPs)where most decision variables are zero.As a result,many algorithms use a two-layer encoding approach to optimize binary variable Mask and real variable Dec separately.Nevertheless,existing optimizers often focus on locating non-zero variable posi-tions to optimize the binary variables Mask.However,approxi-mating the sparse distribution of real Pareto optimal solutions does not necessarily mean that the objective function is optimized.In data mining,it is common to mine frequent itemsets appear-ing together in a dataset to reveal the correlation between data.Inspired by this,we propose a novel two-layer encoding learning swarm optimizer based on frequent itemsets(TELSO)to address these SLMOPs.TELSO mined the frequent terms of multiple particles with better target values to find mask combinations that can obtain better objective values for fast convergence.Experi-mental results on five real-world problems and eight benchmark sets demonstrate that TELSO outperforms existing state-of-the-art sparse large-scale multi-objective evolutionary algorithms(SLMOEAs)in terms of performance and convergence speed.
基金funded by the State Grid Jilin Economic Research Institute’s 2022 Practical Re-Search Project on the Construction of Long-Term Power Supply Guarantee Mechanism in Provincial Capital Cities under the New Situation,Grant Number SGJLJY00GPJS2200041.
文摘This paper addresses the problem of complex and challenging disturbance localization in the current power system operation environment by proposing a disturbance localization method for power systems based on group sparse representation and entropy weight method.Three different electrical quantities are selected as observations in the compressed sensing algorithm.The entropy weighting method is employed to calculate the weights of different observations based on their relative disturbance levels.Subsequently,by leveraging the topological information of the power system and pre-designing an overcomplete dictionary of disturbances based on the corresponding system parameter variations caused by disturbances,an improved Joint Generalized Orthogonal Matching Pursuit(J-GOMP)algorithm is utilized for reconstruction.The reconstructed sparse vectors are divided into three parts.If at least two parts have consistent node identifiers,the node is identified as the disturbance node.If the node identifiers in all three parts are inconsistent,further analysis is conducted considering the weights to determine the disturbance node.Simulation results based on the IEEE 39-bus system model demonstrate that the proposed method,utilizing electrical quantity information from only 8 measurement points,effectively locates disturbance positions and is applicable to various disturbance types with strong noise resistance.
文摘In airborne array synthetic aperture radar(SAR), the three-dimensional(3D) imaging performance and cross-track resolution depends on the length of the equivalent array. In this paper, Barker sequence criterion is used for sparse flight sampling of airborne array SAR, in order to obtain high cross-track resolution in as few times of flights as possible. Under each flight, the imaging algorithm of back projection(BP) and the data extraction method based on modified uniformly redundant arrays(MURAs) are utilized to obtain complex 3D image pairs. To solve the side-lobe noise in images, the interferometry between each image pair is implemented, and compressed sensing(CS) reconstruction is adopted in the frequency domain. Furthermore, to restore the geometrical relationship between each flight, the phase information corresponding to negative MURA is compensated on each single-pass image reconstructed by CS. Finally,by coherent accumulation of each complex image, the high resolution in cross-track direction is obtained. Simulations and experiments in X-band verify the availability.
文摘An improved adaptive genetic algorithm is presented in this paper. It primarily includes two modified methods: one is novel adaptive probabilities of crossover and mutation, the other is truncated selection approach. This algorithm has been validated to be superior to the simple genetic algorithm (SGA) by a complicated binary testing function. Then the proposed algorithm is applied to optimizing the planar retrodirective array to reduce the cost of the hardware. The fitness function is discussed in the optimization example. After optimization, the sparse planar retrodirective antenna array keeps excellent retrodirectivity, while the array architecture has been simplified by 34%. The optimized antenna array can replace uniform full array effectively. Results show that this work will gain more engineering benefits in practice.
文摘A novel sparse matrix technique for the numerical analysis of semiconductor devicesand its algorithms are presented.Storage scheme and calculation procedure of the sparse matrixare described in detail.The sparse matrix technique in the device simulation can decrease storagegreatly with less CPU time and its implementation is very easy.Some algorithms and calculationexamples to show the time and space characteristics of the sparse matrix are given.
基金Project supported by the National Natural Science Foundation of China(Grant No.60972046)Grant from the National Defense Pre-Research Foundation of China
文摘For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation (BP) algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement.
基金Project supported by the National Natural Science Foundation of China(No.61603322)the Research Foundation of Education Bureau of Hunan Province of China(No.16C1542)
文摘Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design an iterative algorithm,namely the iteratively reweighted algorithm(IR-algorithm),for efficiently computing the sparse solutions to the proposed regularization model.The convergence of the IR-algorithm and the setting of the regularization parameters are analyzed at length.Finally,we present numerical examples to illustrate the features of the new regularization and algorithm.
文摘针对现有波达方向估计(Direction of Arrival, DOA)算法在低信噪比、多信源条件下估计精度不足、效率低等问题,提出了一种基于可分离替代函数算法的矢量水听器阵列多快拍DOA估计方法.首先对空域等角度均匀划分,构造出超完备冗余字典,建立信号多快拍数据在空域的稀疏表示模型,然后采用可分离替代函数算法思想解决稀疏重构问题,求解出信号在空域的稀疏系数矩阵,最后将稀疏矩阵中行向量的范数映射到空域网格上,得到DOA估计值.仿真实验表明:该方法在低信噪比、多信源条件下拥有比子空间类算法、贪婪类算法以及现有凸优化类估计算法更高的DOA估计精度和更强的鲁棒性,与同类算法相比执行效率更高.
基金supported by the Key Research and Development Program of Shaanxi(2022GY-089)the Natural Science Basic Research Program of Shaanxi(2022JQ-593).
文摘The deep deterministic policy gradient(DDPG)algo-rithm is an off-policy method that combines two mainstream reinforcement learning methods based on value iteration and policy iteration.Using the DDPG algorithm,agents can explore and summarize the environment to achieve autonomous deci-sions in the continuous state space and action space.In this paper,a cooperative defense with DDPG via swarms of unmanned aerial vehicle(UAV)is developed and validated,which has shown promising practical value in the effect of defending.We solve the sparse rewards problem of reinforcement learning pair in a long-term task by building the reward function of UAV swarms and optimizing the learning process of artificial neural network based on the DDPG algorithm to reduce the vibration in the learning process.The experimental results show that the DDPG algorithm can guide the UAVs swarm to perform the defense task efficiently,meeting the requirements of a UAV swarm for non-centralization,autonomy,and promoting the intelligent development of UAVs swarm as well as the decision-making process.
文摘Broadband wireless channels are often time dispersive and become strongly frequency selective in delay spread domain. Commonly, these channels are composed of a few dominant coefficients and a large part of coefficients are approximately zero or under noise floor. To exploit sparsity of multi-path channels (MPCs), there are various methods have been proposed. They are, namely, greedy algorithms, iterative algorithms, and convex program. The former two algorithms are easy to be implemented but not stable;on the other hand, the last method is stable but difficult to be implemented as practical channel estimation problems be-cause of computational complexity. In this paper, we introduce a novel channel estimation strategy using smooth L0 (SL0) algorithm which combines stable and low complexity. Computer simulations confirm the effectiveness of the introduced algorithm. We also give various simulations to verify the sensing training signal method.
基金supported by National Natural Science Foundation of China (52178422)Doctoral Research Foundation of Hubei University of Arts and Science (2059047)National College Students’Innovation and Entrepreneurship Training Program (202210519021).
文摘The dense and accurate measurement of 3D texture is helpful in evaluating the pavement function.To form dense mandatory constraints and improve matching accuracy,the traditional binocular reconstruction technology was improved threefold.First,a single moving laser line was introduced to carry out global scanning constraints on the target,which would well overcome the difficulty of installing and recognizing excessive laser lines.Second,four kinds of improved algorithms,namely,disparity replacement,superposition synthesis,subregion segmentation,and subregion segmentation centroid enhancement,were established based on different constraint mechanism.Last,the improved binocular reconstruction test device was developed to realize the dual functions of 3D texture measurement and precision self-evaluation.Results show that compared with traditional algorithms,the introduction of a single laser line scanning constraint is helpful in improving the measurement’s accuracy.Among various improved algorithms,the improvement effect of the subregion segmentation centroid enhancement method is the best.It has a good effect on both overall measurement and single pointmeasurement,which can be considered to be used in pavement function evaluation.
基金the National Natural Science Foundation of China(51909136)the Open Research Fund of Key Laboratory of Geological Hazards on Three Gorges Reservoir Area(China Three Gorges University),Ministry of Education,Grant No.2022KDZ21Fund of National Major Water Conservancy Project Construction(0001212022CC60001)。
文摘The staggered distribution of joints and fissures in space constitutes the weak part of any rock mass.The identification of rock mass structural planes and the extraction of characteristic parameters are the basis of rock-mass integrity evaluation,which is very important for analysis of slope stability.The laser scanning technique can be used to acquire the coordinate information pertaining to each point of the structural plane,but large amount of point cloud data,uneven density distribution,and noise point interference make the identification efficiency and accuracy of different types of structural planes limited by point cloud data analysis technology.A new point cloud identification and segmentation algorithm for rock mass structural surfaces is proposed.Based on the distribution states of the original point cloud in different neighborhoods in space,the point clouds are characterized by multi-dimensional eigenvalues and calculated by the robust randomized Hough transform(RRHT).The normal vector difference and the final eigenvalue are proposed for characteristic distinction,and the identification of rock mass structural surfaces is completed through regional growth,which strengthens the difference expression of point clouds.In addition,nearest Voxel downsampling is also introduced in the RRHT calculation,which further reduces the number of sources of neighborhood noises,thereby improving the accuracy and stability of the calculation.The advantages of the method have been verified by laboratory models.The results showed that the proposed method can better achieve the segmentation and statistics of structural planes with interfaces and sharp boundaries.The method works well in the identification of joints,fissures,and other structural planes on Mangshezhai slope in the Three Gorges Reservoir area,China.It can provide a stable and effective technique for the identification and segmentation of rock mass structural planes,which is beneficial in engineering practice.
基金funded by the Ministry of Science and Higher Education of the Russian Federation as part of the World-Class Research Center Program:Advanced Digital Technologies(Contract No.075-15-2022-311,dated 20.04.2022).
文摘Background:Three-dimensional printing technology may become a key factor in transforming clinical practice and in significant improvement of treatment outcomes.The introduction of this technique into pediatric cardiac surgery will allow us to study features of the anatomy and spatial relations of a defect and to simulate the optimal surgical repair on a printed model in every individual case.Methods:We performed the prospective cohort study which included 29 children with congenital heart defects.The hearts and the great vessels were modeled and printed out.Measurements of the same cardiac areas were taken in the same planes and points at multislice computed tomography images(group 1)and on printed 3D models of the hearts(group 2).Pre-printing treatment of the multislice computed tomography data and 3D model preparation were performed according to a newly developed algorithm.Results:The measurements taken on the 3D-printed cardiac models and the tomographic images did not differ significantly,which allowed us to conclude that the models were highly accurate and informative.The new algorithm greatly simplifies and speeds up the preparation of a 3D model for printing,while maintaining high accuracy and level of detail.Conclusions:The 3D-printed models provide an accurate preoperative assessment of the anatomy of a defect in each case.The new algorithm has several important advantages over other available programs.They enable the development of customized preliminary plans for surgical repair of each specific complex congenital heart disease,predict possible issues,determine the optimal surgical tactics,and significantly improve surgical outcomes.
基金The work was supported by the National Science Foundation of China(grant nos.11772218 and 11872044)China-UK NSFC-RS Joint Project(grant nos.11911530177 in China and IE181496 in the UK)Tianjin Research Program of Application Foundation and Advanced Technology(grant no.17JCYBJC18900).
文摘Extracting nonlinear governing equations from noisy data is a central challenge in the analysis of complicated nonlinear behaviors.Despite researchers follow the sparse identification nonlinear dynamics algorithm(SINDy)rule to restore nonlinear equations,there also exist obstacles.One is the excessive dependence on empirical parameters,which increases the difficulty of data pre-processing.Another one is the coexistence of multiple coefficient vectors,which causes the optimal solution to be drowned in multiple solutions.The third one is the composition of basic function,which is exclusively applicable to specific equations.In this article,a local sparse screening identification algorithm(LSSI)is proposed to identify nonlinear systems.First,we present the k-neighbor parameter to replace all empirical parameters in data filtering.Second,we combine the mean error screening method with the SINDy algorithm to select the optimal one from multiple solutions.Third,the time variable t is introduced to expand the scope of the SINDy algorithm.Finally,the LSSI algorithm is applied to recover a classic ODE and a bi-stable energy harvester system.The results show that the new algorithm improves the ability of noise immunity and optimal parameters identification provides a desired foundation for nonlinear analyses.
文摘稀疏重构类算法在雷达目标参数估计中的应用一直是近年来的热门,但由于稀疏重构类算法的局限性,在进行目标波达方向(direction of arrival,DOA)估计时受到原子间的互相影响,从而使多目标测角精度降低。针对此问题,提出一种基于信号分离迭代思想的松弛子空间追踪算法。首先求出回波信号与归一化后字典矩阵相关性最强的多个原子作为初步估计值,再利用初步估计的角度构建代价函数,反复估计直至代价函数收敛。仿真结果表明,所提算法减小了目标个数和相位差的影响,提高了多目标DOA估计的测角精度,同时相较于传统的松弛算法减少了运算量。
基金Supported by the National Natural Science Foundation of China General Programs(Nos.61072112,61372186)the National Natural Science Foundation of China Key Program(No.60890071)
文摘Downward Looking Sparse Linear Array Three Dimensional SAR(DLSLA 3D SAR) is an important form of 3D SAR imaging, which has a widespread application field. Since its practical equivalent phase centers are usually distributed sparsely and nonuniformly, traditional 3D SAR algorithms suffer from low resolution and high sidelobes in cross-track dimension. To deal with this problem, this paper introduces a method based on back-projection and convex optimization to achieve 3D high accuracy imaging reconstruction. Compared with traditional SAR algorithms, the proposed method sufficiently utilizes the sparsity of the 3D SAR imaging scene and can achieve lower sidelobes and higher resolution in cross-track dimension. In the simulated experiments, the reconstructed results of both simple and complex imaging scene verify that the proposed method outperforms 3D back-projection algorithm and shows satisfying cross-track dimensional resolution and good robustness to noise.