Aiming at the problems of bispectral analysis when applied to machinery fault diagnosis, a machinery fault feature extraction method based on sparseness-controlled non-negative tensor factorization （SNTF） is propose...Aiming at the problems of bispectral analysis when applied to machinery fault diagnosis, a machinery fault feature extraction method based on sparseness-controlled non-negative tensor factorization （SNTF） is proposed. First, a non-negative tensor factorization（NTF） algorithm is improved by imposing sparseness constraints on it. Secondly, the bispectral images of mechanical signals are obtained and stacked to form a third-order tensor. Thirdly, the improved algorithm is used to extract features, which are represented by a series of basis images from this tensor. Finally, coefficients indicating these basis images＇ weights in constituting original bispectral images are calculated for fault classification. Experiments on fault diagnosis of gearboxes show that the extracted features can not only reveal some nonlinear characteristics of the system, but also have intuitive meanings with regard to fault characteristic frequencies. These features provide great convenience for the interpretation of the relationships between machinery faults and corresponding bispectra.展开更多
To realize effective co-phasing adjustment in large-aperture sparse-aperture telescopes,a multichannel stripe tracking approach is employed,allowing simultaneous interferometric measurements of multiple optical paths ...To realize effective co-phasing adjustment in large-aperture sparse-aperture telescopes,a multichannel stripe tracking approach is employed,allowing simultaneous interferometric measurements of multiple optical paths and circumventing the need for pairwise measurements along the mirror boundaries in traditional interferometric methods.This approach enhances detection efficiency and reduces system complexity.Here,the principles of the multibeam interference process and construction of a co-phasing detection module based on direct optical fiber connections were analyzed using wavefront optics theory.Error analysis was conducted on the system surface obtained through multipath interference.Potential applications of the interferometric method were explored.Finally,the principle was verified by experiment,an interferometric fringe contrast better than 0.4 is achieved through flat field calibration and incoherent digital synthesis.The dynamic range of the measurement exceeds 10 times of the center wavelength of the working band(1550 nm).Moreover,a resolution better than one-tenth of the working center wavelength(1550 nm)was achieved.Simultaneous three-beam interference can be achieved,leading to a 50%improvement in detection efficiency.This method can effectively enhance the efficiency of sparse aperture telescope co-phasing,meeting the requirements for observations of 8-10 m telescopes.This study provides a technological foundation for observing distant and faint celestial objects.展开更多
Reinforcement learning as autonomous learning is greatly driving artificial intelligence(AI)development to practical applications.Having demonstrated the potential to significantly improve synchronously parallel learn...Reinforcement learning as autonomous learning is greatly driving artificial intelligence(AI)development to practical applications.Having demonstrated the potential to significantly improve synchronously parallel learning,the parallel computing based asynchronous advantage actor-critic(A3C)opens a new door for reinforcement learning.Unfortunately,the acceleration's influence on A3C robustness has been largely overlooked.In this paper,we perform the first robustness assessment of A3C based on parallel computing.By perceiving the policy's action,we construct a global matrix of action probability deviation and define two novel measures of skewness and sparseness to form an integral robustness measure.Based on such static assessment,we then develop a dynamic robustness assessing algorithm through situational whole-space state sampling of changing episodes.Extensive experiments with different combinations of agent number and learning rate are implemented on an A3C-based pathfinding application,demonstrating that our proposed robustness assessment can effectively measure the robustness of A3C,which can achieve an accuracy of 83.3%.展开更多
Piezo actuators are widely used in ultra-precision fields because of their high response and nano-scale step length.However,their hysteresis characteristics seriously affect the accuracy and stability of piezo actuato...Piezo actuators are widely used in ultra-precision fields because of their high response and nano-scale step length.However,their hysteresis characteristics seriously affect the accuracy and stability of piezo actuators.Existing methods for fitting hysteresis loops include operator class,differential equation class,and machine learning class.The modeling cost of operator class and differential equation class methods is high,the model complexity is high,and the process of machine learning,such as neural network calculation,is opaque.The physical model framework cannot be directly extracted.Therefore,the sparse identification of nonlinear dynamics(SINDy)algorithm is proposed to fit hysteresis loops.Furthermore,the SINDy algorithm is improved.While the SINDy algorithm builds an orthogonal candidate database for modeling,the sparse regression model is simplified,and the Relay operator is introduced for piecewise fitting to solve the distortion problem of the SINDy algorithm fitting singularities.The Relay-SINDy algorithm proposed in this paper is applied to fitting hysteresis loops.Good performance is obtained with the experimental results of open and closed loops.Compared with the existing methods,the modeling cost and model complexity are reduced,and the modeling accuracy of the hysteresis loop is improved.展开更多
Considering that the algorithm accuracy of the traditional sparse representation models is not high under the influence of multiple complex environmental factors,this study focuses on the improvement of feature extrac...Considering that the algorithm accuracy of the traditional sparse representation models is not high under the influence of multiple complex environmental factors,this study focuses on the improvement of feature extraction and model construction.Firstly,the convolutional neural network(CNN)features of the face are extracted by the trained deep learning network.Next,the steady-state and dynamic classifiers for face recognition are constructed based on the CNN features and Haar features respectively,with two-stage sparse representation introduced in the process of constructing the steady-state classifier and the feature templates with high reliability are dynamically selected as alternative templates from the sparse representation template dictionary constructed using the CNN features.Finally,the results of face recognition are given based on the classification results of the steady-state classifier and the dynamic classifier together.Based on this,the feature weights of the steady-state classifier template are adjusted in real time and the dictionary set is dynamically updated to reduce the probability of irrelevant features entering the dictionary set.The average recognition accuracy of this method is 94.45%on the CMU PIE face database and 96.58%on the AR face database,which is significantly improved compared with that of the traditional face recognition methods.展开更多
An improved version of the sparse A^(*)algorithm is proposed to address the common issue of excessive expansion of nodes and failure to consider current ship status and parameters in traditional path planning algorith...An improved version of the sparse A^(*)algorithm is proposed to address the common issue of excessive expansion of nodes and failure to consider current ship status and parameters in traditional path planning algorithms.This algorithm considers factors such as initial position and orientation of the ship,safety range,and ship draft to determine the optimal obstacle-avoiding route from the current to the destination point for ship planning.A coordinate transformation algorithm is also applied to convert commonly used latitude and longitude coordinates of ship travel paths to easily utilized and analyzed Cartesian coordinates.The algorithm incorporates a hierarchical chart processing algorithm to handle multilayered chart data.Furthermore,the algorithm considers the impact of ship length on grid size and density when implementing chart gridification,adjusting the grid size and density accordingly based on ship length.Simulation results show that compared to traditional path planning algorithms,the sparse A^(*)algorithm reduces the average number of path points by 25%,decreases the average maximum storage node number by 17%,and raises the average path turning angle by approximately 10°,effectively improving the safety of ship planning paths.展开更多
Given the measurement matrix A and the observation signal y,the central purpose of compressed sensing is to find the most sparse solution of the underdetermined linear system y=Ax+z,where x is the s-sparse signal to b...Given the measurement matrix A and the observation signal y,the central purpose of compressed sensing is to find the most sparse solution of the underdetermined linear system y=Ax+z,where x is the s-sparse signal to be recovered and z is the noise vector.Zhou and Yu[Front.Appl.Math.Stat.,5(2019),Article 14]recently proposed a novel non-convex weighted l_(r)-l_(2)minimization method for effective sparse recovery.In this paper,under newly coherence-based conditions,we study the non-convex weighted l_(r)-l_(2)minimization in reconstructing sparse signals that are contaminated by different noises.Concretely,the results reveal that if the coherenceμof measurement matrix A fulfillsμ<k(s;r,α,N),s>1,α^(1/r)N(1/2)<1,then any s-sparse signals in the noisy scenarios could be ensured to be reconstructed robustly by solving weighted l_(r)-l_(2)minimization non-convex optimization problem.Furthermore,some central remarks are presented to clear that the reconstruction assurance is much weaker than the existing ones.To the best of our knowledge,this is the first mutual coherence-based sufficient condition for such approach.展开更多
Efficient three-dimensional(3D)building reconstruction from drone imagery often faces data acquisition,storage,and computational challenges because of its reliance on dense point clouds.In this study,we introduced a n...Efficient three-dimensional(3D)building reconstruction from drone imagery often faces data acquisition,storage,and computational challenges because of its reliance on dense point clouds.In this study,we introduced a novel method for efficient and lightweight 3D building reconstruction from drone imagery using line clouds and sparse point clouds.Our approach eliminates the need to generate dense point clouds,and thus significantly reduces the computational burden by reconstructing 3D models directly from sparse data.We addressed the limitations of line clouds for plane detection and reconstruction by using a new algorithm.This algorithm projects 3D line clouds onto a 2D plane,clusters the projections to identify potential planes,and refines them using sparse point clouds to ensure an accurate and efficient model reconstruction.Extensive qualitative and quantitative experiments demonstrated the effectiveness of our method,demonstrating its superiority over existing techniques in terms of simplicity and efficiency.展开更多
Radio antenna arrays have many advantages for astronomical observations,such as high resolution,high sensitivity,multi-target simultaneous observation,and flexible beam formation.Problems surrounding key indices,such ...Radio antenna arrays have many advantages for astronomical observations,such as high resolution,high sensitivity,multi-target simultaneous observation,and flexible beam formation.Problems surrounding key indices,such as sensitivity enhancement,scanning range extension,and sidelobe level suppression,need to be solved urgently.Here,we propose a sparse optimization scheme based on a genetic algorithm for a 64-array element planar radio antenna array.As optimization targets for the iterative process of the genetic algorithm,we use the maximum sidelobe levels and beamwidth of multiple cross-section patterns that pass through the main beam in three-dimensions,with the maximum sidelobe levels of the patterns at several different scanning angles.Element positions are adjusted for iterations,to select the optimal array configuration.Following sparse layout optimization,the simulated 64-element planar radio antenna array shows that the maximum sidelobe level decreases by 1.79 dB,and the beamwidth narrows by 3°.Within the scan range of±30°,after sparse array optimization,all sidelobe levels decrease,and all beamwidths narrow.This performance improvement can potentially enhance the sensitivity and spatial resolution of radio telescope systems.展开更多
Due to the high-order B-spline basis functions utilized in isogeometric analysis(IGA)and the repeatedly updating global stiffness matrix of topology optimization,Isogeometric topology optimization(ITO)intrinsically su...Due to the high-order B-spline basis functions utilized in isogeometric analysis(IGA)and the repeatedly updating global stiffness matrix of topology optimization,Isogeometric topology optimization(ITO)intrinsically suffers from the computationally demanding process.In this work,we address the efficiency problem existing in the assembling stiffness matrix and sensitivity analysis using B˙ezier element stiffness mapping.The Element-wise and Interaction-wise parallel computing frameworks for updating the global stiffness matrix are proposed for ITO with B˙ezier element stiffness mapping,which differs from these ones with the traditional Gaussian integrals utilized.Since the explicit stiffness computation formula derived from B˙ezier element stiffness mapping possesses a typical parallel structure,the presented GPU-enabled ITO method can greatly accelerate the computation speed while maintaining its high memory efficiency unaltered.Numerical examples demonstrate threefold speedup:1)the assembling stiffness matrix is accelerated by 10×maximumly with the proposed GPU strategy;2)the solution efficiency of a sparse linear system is enhanced by up to 30×with Eigen replaced by AMGCL;3)the efficiency of sensitivity analysis is promoted by 100×with GPU applied.Therefore,the proposed method is a promising way to enhance the numerical efficiency of ITO for both single-patch and multiple-patch design problems.展开更多
This paper presents a framework for constructing surrogate models for sensitivity analysis of structural dynamics behavior.Physical models involving deformation,such as collisions,vibrations,and penetration,are devel-...This paper presents a framework for constructing surrogate models for sensitivity analysis of structural dynamics behavior.Physical models involving deformation,such as collisions,vibrations,and penetration,are devel-oped using the material point method.To reduce the computational cost of Monte Carlo simulations,response surface models are created as surrogate models for the material point system to approximate its dynamic behavior.An adaptive randomized greedy algorithm is employed to construct a sparse polynomial chaos expansion model with a fixed order,effectively balancing the accuracy and computational efficiency of the surrogate model.Based on the sparse polynomial chaos expansion,sensitivity analysis is conducted using the global finite difference and Sobol methods.Several examples of structural dynamics are provided to demonstrate the effectiveness of the proposed method in addressing structural dynamics problems.展开更多
Sparse array design has significant implications for improving the accuracy of direction of arrival(DOA)estimation of non-circular(NC)signals.We propose an extended nested array with a filled sensor(ENAFS)based on the...Sparse array design has significant implications for improving the accuracy of direction of arrival(DOA)estimation of non-circular(NC)signals.We propose an extended nested array with a filled sensor(ENAFS)based on the hole-filling strategy.Specifically,we first introduce the improved nested array(INA)and prove its properties.Subsequently,we extend the sum-difference coarray(SDCA)by adding an additional sensor to fill the holes.Thus the larger uniform degrees of freedom(uDOFs)and virtual array aperture(VAA)can be abtained,and the ENAFS is designed.Finally,the simulation results are given to verify the superiority of the proposed ENAFS in terms of DOF,mutual coupling and estimation performance.展开更多
Urban air pollution has brought great troubles to physical and mental health,economic development,environmental protection,and other aspects.Predicting the changes and trends of air pollution can provide a scientific ...Urban air pollution has brought great troubles to physical and mental health,economic development,environmental protection,and other aspects.Predicting the changes and trends of air pollution can provide a scientific basis for governance and prevention efforts.In this paper,we propose an interval prediction method that considers the spatio-temporal characteristic information of PM_(2.5)signals from multiple stations.K-nearest neighbor(KNN)algorithm interpolates the lost signals in the process of collection,transmission,and storage to ensure the continuity of data.Graph generative network(GGN)is used to process time-series meteorological data with complex structures.The graph U-Nets framework is introduced into the GGN model to enhance its controllability to the graph generation process,which is beneficial to improve the efficiency and robustness of the model.In addition,sparse Bayesian regression is incorporated to improve the dimensional disaster defect of traditional kernel density estimation(KDE)interval prediction.With the support of sparse strategy,sparse Bayesian regression kernel density estimation(SBR-KDE)is very efficient in processing high-dimensional large-scale data.The PM_(2.5)data of spring,summer,autumn,and winter from 34 air quality monitoring sites in Beijing verified the accuracy,generalization,and superiority of the proposed model in interval prediction.展开更多
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.展开更多
Although many multi-view clustering(MVC) algorithms with acceptable performances have been presented, to the best of our knowledge, nearly all of them need to be fed with the correct number of clusters. In addition, t...Although many multi-view clustering(MVC) algorithms with acceptable performances have been presented, to the best of our knowledge, nearly all of them need to be fed with the correct number of clusters. In addition, these existing algorithms create only the hard and fuzzy partitions for multi-view objects,which are often located in highly-overlapping areas of multi-view feature space. The adoption of hard and fuzzy partition ignores the ambiguity and uncertainty in the assignment of objects, likely leading to performance degradation. To address these issues, we propose a novel sparse reconstructive multi-view evidential clustering algorithm(SRMVEC). Based on a sparse reconstructive procedure, SRMVEC learns a shared affinity matrix across views, and maps multi-view objects to a 2-dimensional humanreadable chart by calculating 2 newly defined mathematical metrics for each object. From this chart, users can detect the number of clusters and select several objects existing in the dataset as cluster centers. Then, SRMVEC derives a credal partition under the framework of evidence theory, improving the fault tolerance of clustering. Ablation studies show the benefits of adopting the sparse reconstructive procedure and evidence theory. Besides,SRMVEC delivers effectiveness on benchmark datasets by outperforming some state-of-the-art methods.展开更多
Passive detection of low-slow-small(LSS)targets is easily interfered by direct signal and multipath clutter,and the traditional clutter suppression method has the contradiction between step size and convergence rate.I...Passive detection of low-slow-small(LSS)targets is easily interfered by direct signal and multipath clutter,and the traditional clutter suppression method has the contradiction between step size and convergence rate.In this paper,a frequency domain clutter suppression algorithm based on sparse adaptive filtering is proposed.The pulse compression operation between the error signal and the input reference signal is added to the cost function as a sparsity constraint,and the criterion for filter weight updating is improved to obtain a purer echo signal.At the same time,the step size and penalty factor are brought into the adaptive iteration process,and the input data is used to drive the adaptive changes of parameters such as step size.The proposed algorithm has a small amount of calculation,which improves the robustness to parameters such as step size,reduces the weight error of the filter and has a good clutter suppression performance.展开更多
Monitoring seismicity in real time provides significant benefits for timely earthquake warning and analyses.In this study,we propose an automatic workflow based on machine learning(ML)to monitor seismicity in the sout...Monitoring seismicity in real time provides significant benefits for timely earthquake warning and analyses.In this study,we propose an automatic workflow based on machine learning(ML)to monitor seismicity in the southern Sichuan Basin of China.This workflow includes coherent event detection,phase picking,and earthquake location using three-component data from a seismic network.By combining Phase Net,we develop an ML-based earthquake location model called Phase Loc,to conduct real-time monitoring of the local seismicity.The approach allows us to use synthetic samples covering the entire study area to train Phase Loc,addressing the problems of insufficient data samples,imbalanced data distribution,and unreliable labels when training with observed data.We apply the trained model to observed data recorded in the southern Sichuan Basin,China,between September 2018 and March 2019.The results show that the average differences in latitude,longitude,and depth are 5.7 km,6.1 km,and 2 km,respectively,compared to the reference catalog.Phase Loc combines all available phase information to make fast and reliable predictions,even if only a few phases are detected and picked.The proposed workflow may help real-time seismic monitoring in other regions as well.展开更多
In this paper,ambient IoT is used as a typical use case of massive connections for the sixth generation(6G)mobile communications where we derive the performance requirements to facilitate the evaluation of technical s...In this paper,ambient IoT is used as a typical use case of massive connections for the sixth generation(6G)mobile communications where we derive the performance requirements to facilitate the evaluation of technical solutions.A rather complete design of unsourced multiple access is proposed in which two key parts:a compressed sensing module for active user detection,and a sparse interleaver-division multiple access(SIDMA)module are simulated side by side on a same platform at balanced signal to noise ratio(SNR)operating points.With a proper combination of compressed sensing matrix,a convolutional encoder,receiver algorithms,the simulated performance results appear superior to the state-of-the-art benchmark,yet with relatively less complicated processing.展开更多
基金The National Natural Science Foundation of China (No.50875048)the Natural Science Foundation of Jiangsu Province (No.BK2007115)the National High Technology Research and Development Program of China (863 Program)(No.2007AA04Z421)
文摘Aiming at the problems of bispectral analysis when applied to machinery fault diagnosis, a machinery fault feature extraction method based on sparseness-controlled non-negative tensor factorization （SNTF） is proposed. First, a non-negative tensor factorization（NTF） algorithm is improved by imposing sparseness constraints on it. Secondly, the bispectral images of mechanical signals are obtained and stacked to form a third-order tensor. Thirdly, the improved algorithm is used to extract features, which are represented by a series of basis images from this tensor. Finally, coefficients indicating these basis images＇ weights in constituting original bispectral images are calculated for fault classification. Experiments on fault diagnosis of gearboxes show that the extracted features can not only reveal some nonlinear characteristics of the system, but also have intuitive meanings with regard to fault characteristic frequencies. These features provide great convenience for the interpretation of the relationships between machinery faults and corresponding bispectra.
文摘To realize effective co-phasing adjustment in large-aperture sparse-aperture telescopes,a multichannel stripe tracking approach is employed,allowing simultaneous interferometric measurements of multiple optical paths and circumventing the need for pairwise measurements along the mirror boundaries in traditional interferometric methods.This approach enhances detection efficiency and reduces system complexity.Here,the principles of the multibeam interference process and construction of a co-phasing detection module based on direct optical fiber connections were analyzed using wavefront optics theory.Error analysis was conducted on the system surface obtained through multipath interference.Potential applications of the interferometric method were explored.Finally,the principle was verified by experiment,an interferometric fringe contrast better than 0.4 is achieved through flat field calibration and incoherent digital synthesis.The dynamic range of the measurement exceeds 10 times of the center wavelength of the working band(1550 nm).Moreover,a resolution better than one-tenth of the working center wavelength(1550 nm)was achieved.Simultaneous three-beam interference can be achieved,leading to a 50%improvement in detection efficiency.This method can effectively enhance the efficiency of sparse aperture telescope co-phasing,meeting the requirements for observations of 8-10 m telescopes.This study provides a technological foundation for observing distant and faint celestial objects.
基金supported by the National Natural Science Foundation of China under Grant Nos.61972025,61802389,61672092,U1811264,and 61966009the National Key Research and Development Program of China under Grant Nos.2020YFB1005604 and 2020YFB2103802Guangxi Key Laboratory of Trusted Software under Grant No.KX201902.
文摘Reinforcement learning as autonomous learning is greatly driving artificial intelligence(AI)development to practical applications.Having demonstrated the potential to significantly improve synchronously parallel learning,the parallel computing based asynchronous advantage actor-critic(A3C)opens a new door for reinforcement learning.Unfortunately,the acceleration's influence on A3C robustness has been largely overlooked.In this paper,we perform the first robustness assessment of A3C based on parallel computing.By perceiving the policy's action,we construct a global matrix of action probability deviation and define two novel measures of skewness and sparseness to form an integral robustness measure.Based on such static assessment,we then develop a dynamic robustness assessing algorithm through situational whole-space state sampling of changing episodes.Extensive experiments with different combinations of agent number and learning rate are implemented on an A3C-based pathfinding application,demonstrating that our proposed robustness assessment can effectively measure the robustness of A3C,which can achieve an accuracy of 83.3%.
基金National Natural Science Foundation of China(62203118)。
文摘Piezo actuators are widely used in ultra-precision fields because of their high response and nano-scale step length.However,their hysteresis characteristics seriously affect the accuracy and stability of piezo actuators.Existing methods for fitting hysteresis loops include operator class,differential equation class,and machine learning class.The modeling cost of operator class and differential equation class methods is high,the model complexity is high,and the process of machine learning,such as neural network calculation,is opaque.The physical model framework cannot be directly extracted.Therefore,the sparse identification of nonlinear dynamics(SINDy)algorithm is proposed to fit hysteresis loops.Furthermore,the SINDy algorithm is improved.While the SINDy algorithm builds an orthogonal candidate database for modeling,the sparse regression model is simplified,and the Relay operator is introduced for piecewise fitting to solve the distortion problem of the SINDy algorithm fitting singularities.The Relay-SINDy algorithm proposed in this paper is applied to fitting hysteresis loops.Good performance is obtained with the experimental results of open and closed loops.Compared with the existing methods,the modeling cost and model complexity are reduced,and the modeling accuracy of the hysteresis loop is improved.
基金the financial support from Natural Science Foundation of Gansu Province(Nos.22JR5RA217,22JR5RA216)Lanzhou Science and Technology Program(No.2022-2-111)+1 种基金Lanzhou University of Arts and Sciences School Innovation Fund Project(No.XJ2022000103)Lanzhou College of Arts and Sciences 2023 Talent Cultivation Quality Improvement Project(No.2023-ZL-jxzz-03)。
文摘Considering that the algorithm accuracy of the traditional sparse representation models is not high under the influence of multiple complex environmental factors,this study focuses on the improvement of feature extraction and model construction.Firstly,the convolutional neural network(CNN)features of the face are extracted by the trained deep learning network.Next,the steady-state and dynamic classifiers for face recognition are constructed based on the CNN features and Haar features respectively,with two-stage sparse representation introduced in the process of constructing the steady-state classifier and the feature templates with high reliability are dynamically selected as alternative templates from the sparse representation template dictionary constructed using the CNN features.Finally,the results of face recognition are given based on the classification results of the steady-state classifier and the dynamic classifier together.Based on this,the feature weights of the steady-state classifier template are adjusted in real time and the dictionary set is dynamically updated to reduce the probability of irrelevant features entering the dictionary set.The average recognition accuracy of this method is 94.45%on the CMU PIE face database and 96.58%on the AR face database,which is significantly improved compared with that of the traditional face recognition methods.
基金Supported by the Tianjin University of Technology Graduate R esearch Innovation Project(YJ2281).
文摘An improved version of the sparse A^(*)algorithm is proposed to address the common issue of excessive expansion of nodes and failure to consider current ship status and parameters in traditional path planning algorithms.This algorithm considers factors such as initial position and orientation of the ship,safety range,and ship draft to determine the optimal obstacle-avoiding route from the current to the destination point for ship planning.A coordinate transformation algorithm is also applied to convert commonly used latitude and longitude coordinates of ship travel paths to easily utilized and analyzed Cartesian coordinates.The algorithm incorporates a hierarchical chart processing algorithm to handle multilayered chart data.Furthermore,the algorithm considers the impact of ship length on grid size and density when implementing chart gridification,adjusting the grid size and density accordingly based on ship length.Simulation results show that compared to traditional path planning algorithms,the sparse A^(*)algorithm reduces the average number of path points by 25%,decreases the average maximum storage node number by 17%,and raises the average path turning angle by approximately 10°,effectively improving the safety of ship planning paths.
基金supported in part by the National Natural Science Foundation of China(Grant Nos.12101454,12101512,12071380,62063031)by the Chongqing Normal University Foundation Project(Grant No.23XLB013)+8 种基金by the Fuxi Scientific Research Innovation Team of Tianshui Normal University(Grant No.FXD2020-03)by the National Natural Science Foundation of China(Grant No.12301594)by the China Postdoctoral Science Foundation(Grant No.2021M692681)by the Natural Science Foundation of Chongqing,China(Grant No.cstc2021jcyj-bshX0155)by the Fundamental Research Funds for the Central Universities(Grant No.SWU120078)by the Natural Science Foundation of Gansu Province(Grant No.21JR1RE292)by the College Teachers Innovation Foundation of Gansu Province(Grant No.2023B-132)by the Joint Funds of the Natural Science Innovation-driven development of Chongqing(Grant No.2023NSCQ-LZX0218)by the Chongqing Talent Project(Grant No.cstc2021ycjh-bgzxm0015).
文摘Given the measurement matrix A and the observation signal y,the central purpose of compressed sensing is to find the most sparse solution of the underdetermined linear system y=Ax+z,where x is the s-sparse signal to be recovered and z is the noise vector.Zhou and Yu[Front.Appl.Math.Stat.,5(2019),Article 14]recently proposed a novel non-convex weighted l_(r)-l_(2)minimization method for effective sparse recovery.In this paper,under newly coherence-based conditions,we study the non-convex weighted l_(r)-l_(2)minimization in reconstructing sparse signals that are contaminated by different noises.Concretely,the results reveal that if the coherenceμof measurement matrix A fulfillsμ<k(s;r,α,N),s>1,α^(1/r)N(1/2)<1,then any s-sparse signals in the noisy scenarios could be ensured to be reconstructed robustly by solving weighted l_(r)-l_(2)minimization non-convex optimization problem.Furthermore,some central remarks are presented to clear that the reconstruction assurance is much weaker than the existing ones.To the best of our knowledge,this is the first mutual coherence-based sufficient condition for such approach.
基金Supported by the Guangdong Major Project of Basic and Applied Basic Research(2023B0303000016),and the National Natural Science Foundation of China(U21A20515).
文摘Efficient three-dimensional(3D)building reconstruction from drone imagery often faces data acquisition,storage,and computational challenges because of its reliance on dense point clouds.In this study,we introduced a novel method for efficient and lightweight 3D building reconstruction from drone imagery using line clouds and sparse point clouds.Our approach eliminates the need to generate dense point clouds,and thus significantly reduces the computational burden by reconstructing 3D models directly from sparse data.We addressed the limitations of line clouds for plane detection and reconstruction by using a new algorithm.This algorithm projects 3D line clouds onto a 2D plane,clusters the projections to identify potential planes,and refines them using sparse point clouds to ensure an accurate and efficient model reconstruction.Extensive qualitative and quantitative experiments demonstrated the effectiveness of our method,demonstrating its superiority over existing techniques in terms of simplicity and efficiency.
基金supported by the Ministry of Science and Technology SKA Special Project(2020SKA0110202)the Special Project on Building a Science and Technology Innovation Center for South and Southeast Asia–International Joint Innovation Platform in Yunnan Province:"Yunnan Sino-Malaysian International Joint Laboratory of HF-VHF Advanced Radio Astronomy Technology"(202303AP140003)+4 种基金the National Natural Science Foundation of China (NSFC) Joint Fund for Astronomy (JFA) incubator program (U2031133)the International Partnership Program Project of the International Cooperation Bureau of the Chinese Academy of Sciences:"Belt and Road"Cooperation (114A11KYSB20200001)the Kunming Foreign (International) Cooperation Base Program:"Yunnan Observatory of the Chinese Academy of Sciences-University of Malaya Joint R&D Cooperation Base for Advanced Radio Astronomy Technology"(GHJD-2021022)the China-Malaysia Collaborative Research on Space Remote Sensing and Radio Astronomy Observation of Space Weather at Low and Middle Latitudes under the Key Special Project of the State Key R&D Program of the Ministry of Science and Technology for International Cooperation in Science,Technology and Innovation among Governments (2022YFE0140000)the High-precision calibration method for low-frequency radio interferometric arrays for the SKA project of the Ministry of Science and Technology(2020SKA0110300).
文摘Radio antenna arrays have many advantages for astronomical observations,such as high resolution,high sensitivity,multi-target simultaneous observation,and flexible beam formation.Problems surrounding key indices,such as sensitivity enhancement,scanning range extension,and sidelobe level suppression,need to be solved urgently.Here,we propose a sparse optimization scheme based on a genetic algorithm for a 64-array element planar radio antenna array.As optimization targets for the iterative process of the genetic algorithm,we use the maximum sidelobe levels and beamwidth of multiple cross-section patterns that pass through the main beam in three-dimensions,with the maximum sidelobe levels of the patterns at several different scanning angles.Element positions are adjusted for iterations,to select the optimal array configuration.Following sparse layout optimization,the simulated 64-element planar radio antenna array shows that the maximum sidelobe level decreases by 1.79 dB,and the beamwidth narrows by 3°.Within the scan range of±30°,after sparse array optimization,all sidelobe levels decrease,and all beamwidths narrow.This performance improvement can potentially enhance the sensitivity and spatial resolution of radio telescope systems.
基金supported by the National Key R&D Program of China(2023YFB2504601)National Natural Science Foundation of China(52205267).
文摘Due to the high-order B-spline basis functions utilized in isogeometric analysis(IGA)and the repeatedly updating global stiffness matrix of topology optimization,Isogeometric topology optimization(ITO)intrinsically suffers from the computationally demanding process.In this work,we address the efficiency problem existing in the assembling stiffness matrix and sensitivity analysis using B˙ezier element stiffness mapping.The Element-wise and Interaction-wise parallel computing frameworks for updating the global stiffness matrix are proposed for ITO with B˙ezier element stiffness mapping,which differs from these ones with the traditional Gaussian integrals utilized.Since the explicit stiffness computation formula derived from B˙ezier element stiffness mapping possesses a typical parallel structure,the presented GPU-enabled ITO method can greatly accelerate the computation speed while maintaining its high memory efficiency unaltered.Numerical examples demonstrate threefold speedup:1)the assembling stiffness matrix is accelerated by 10×maximumly with the proposed GPU strategy;2)the solution efficiency of a sparse linear system is enhanced by up to 30×with Eigen replaced by AMGCL;3)the efficiency of sensitivity analysis is promoted by 100×with GPU applied.Therefore,the proposed method is a promising way to enhance the numerical efficiency of ITO for both single-patch and multiple-patch design problems.
基金support from the National Natural Science Foundation of China(Grant Nos.52174123&52274222).
文摘This paper presents a framework for constructing surrogate models for sensitivity analysis of structural dynamics behavior.Physical models involving deformation,such as collisions,vibrations,and penetration,are devel-oped using the material point method.To reduce the computational cost of Monte Carlo simulations,response surface models are created as surrogate models for the material point system to approximate its dynamic behavior.An adaptive randomized greedy algorithm is employed to construct a sparse polynomial chaos expansion model with a fixed order,effectively balancing the accuracy and computational efficiency of the surrogate model.Based on the sparse polynomial chaos expansion,sensitivity analysis is conducted using the global finite difference and Sobol methods.Several examples of structural dynamics are provided to demonstrate the effectiveness of the proposed method in addressing structural dynamics problems.
基金supported by China National Science Foundations(Nos.62371225,62371227)。
文摘Sparse array design has significant implications for improving the accuracy of direction of arrival(DOA)estimation of non-circular(NC)signals.We propose an extended nested array with a filled sensor(ENAFS)based on the hole-filling strategy.Specifically,we first introduce the improved nested array(INA)and prove its properties.Subsequently,we extend the sum-difference coarray(SDCA)by adding an additional sensor to fill the holes.Thus the larger uniform degrees of freedom(uDOFs)and virtual array aperture(VAA)can be abtained,and the ENAFS is designed.Finally,the simulation results are given to verify the superiority of the proposed ENAFS in terms of DOF,mutual coupling and estimation performance.
基金Project(2020YFC2008605)supported by the National Key Research and Development Project of ChinaProject(52072412)supported by the National Natural Science Foundation of ChinaProject(2021JJ30359)supported by the Natural Science Foundation of Hunan Province,China。
文摘Urban air pollution has brought great troubles to physical and mental health,economic development,environmental protection,and other aspects.Predicting the changes and trends of air pollution can provide a scientific basis for governance and prevention efforts.In this paper,we propose an interval prediction method that considers the spatio-temporal characteristic information of PM_(2.5)signals from multiple stations.K-nearest neighbor(KNN)algorithm interpolates the lost signals in the process of collection,transmission,and storage to ensure the continuity of data.Graph generative network(GGN)is used to process time-series meteorological data with complex structures.The graph U-Nets framework is introduced into the GGN model to enhance its controllability to the graph generation process,which is beneficial to improve the efficiency and robustness of the model.In addition,sparse Bayesian regression is incorporated to improve the dimensional disaster defect of traditional kernel density estimation(KDE)interval prediction.With the support of sparse strategy,sparse Bayesian regression kernel density estimation(SBR-KDE)is very efficient in processing high-dimensional large-scale data.The PM_(2.5)data of spring,summer,autumn,and winter from 34 air quality monitoring sites in Beijing verified the accuracy,generalization,and superiority of the proposed model in interval prediction.
基金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.
基金supported in part by NUS startup grantthe National Natural Science Foundation of China (52076037)。
文摘Although many multi-view clustering(MVC) algorithms with acceptable performances have been presented, to the best of our knowledge, nearly all of them need to be fed with the correct number of clusters. In addition, these existing algorithms create only the hard and fuzzy partitions for multi-view objects,which are often located in highly-overlapping areas of multi-view feature space. The adoption of hard and fuzzy partition ignores the ambiguity and uncertainty in the assignment of objects, likely leading to performance degradation. To address these issues, we propose a novel sparse reconstructive multi-view evidential clustering algorithm(SRMVEC). Based on a sparse reconstructive procedure, SRMVEC learns a shared affinity matrix across views, and maps multi-view objects to a 2-dimensional humanreadable chart by calculating 2 newly defined mathematical metrics for each object. From this chart, users can detect the number of clusters and select several objects existing in the dataset as cluster centers. Then, SRMVEC derives a credal partition under the framework of evidence theory, improving the fault tolerance of clustering. Ablation studies show the benefits of adopting the sparse reconstructive procedure and evidence theory. Besides,SRMVEC delivers effectiveness on benchmark datasets by outperforming some state-of-the-art methods.
文摘Passive detection of low-slow-small(LSS)targets is easily interfered by direct signal and multipath clutter,and the traditional clutter suppression method has the contradiction between step size and convergence rate.In this paper,a frequency domain clutter suppression algorithm based on sparse adaptive filtering is proposed.The pulse compression operation between the error signal and the input reference signal is added to the cost function as a sparsity constraint,and the criterion for filter weight updating is improved to obtain a purer echo signal.At the same time,the step size and penalty factor are brought into the adaptive iteration process,and the input data is used to drive the adaptive changes of parameters such as step size.The proposed algorithm has a small amount of calculation,which improves the robustness to parameters such as step size,reduces the weight error of the filter and has a good clutter suppression performance.
基金the financial support of the National Key R&D Program of China(2021YFC3000701)the China Seismic Experimental Site in Sichuan-Yunnan(CSES-SY)。
文摘Monitoring seismicity in real time provides significant benefits for timely earthquake warning and analyses.In this study,we propose an automatic workflow based on machine learning(ML)to monitor seismicity in the southern Sichuan Basin of China.This workflow includes coherent event detection,phase picking,and earthquake location using three-component data from a seismic network.By combining Phase Net,we develop an ML-based earthquake location model called Phase Loc,to conduct real-time monitoring of the local seismicity.The approach allows us to use synthetic samples covering the entire study area to train Phase Loc,addressing the problems of insufficient data samples,imbalanced data distribution,and unreliable labels when training with observed data.We apply the trained model to observed data recorded in the southern Sichuan Basin,China,between September 2018 and March 2019.The results show that the average differences in latitude,longitude,and depth are 5.7 km,6.1 km,and 2 km,respectively,compared to the reference catalog.Phase Loc combines all available phase information to make fast and reliable predictions,even if only a few phases are detected and picked.The proposed workflow may help real-time seismic monitoring in other regions as well.
文摘In this paper,ambient IoT is used as a typical use case of massive connections for the sixth generation(6G)mobile communications where we derive the performance requirements to facilitate the evaluation of technical solutions.A rather complete design of unsourced multiple access is proposed in which two key parts:a compressed sensing module for active user detection,and a sparse interleaver-division multiple access(SIDMA)module are simulated side by side on a same platform at balanced signal to noise ratio(SNR)operating points.With a proper combination of compressed sensing matrix,a convolutional encoder,receiver algorithms,the simulated performance results appear superior to the state-of-the-art benchmark,yet with relatively less complicated processing.
