The finite volume method was applied to numerically simulate the bottom pressure field induced by regular waves,vehicles in calm water and vehicles in regular waves.The solution of Navier-Stokes(N-S)equations in the v...The finite volume method was applied to numerically simulate the bottom pressure field induced by regular waves,vehicles in calm water and vehicles in regular waves.The solution of Navier-Stokes(N-S)equations in the vicinity of numerical wave tank's boundary was forced towards the wave theoretical solution by incorporating momentum source terms,thereby reducing adverse effects such as wave reflection.Simulations utilizing laminar flow,turbulent flow,and ideal fluid models were all found capable of effectively capturing the waveform and bottom pressure of regular waves,agreeing well with experimental data.In predicting the bottom pressure field of the submerged vehicle,turbulent simulations considering fluid viscosity and boundary layer development provided more accurate predictions for the stern region than inviscid simulations.Due to sphere's diffractive effect,the sphere's bottom pressure field in waves is not a linear superposition of the wave's and the sphere's bottom pressure field.However,a slender submerged vehicle exhibits a weaker diffractive effect on waves,thus the submerged vehicle's bottom pressure field in waves can be approximated as a linear superposition of the wave's and the submerged vehicle's bottom pressure field,which simplifies computation and analysis.展开更多
Modern warfare demands weapons capable of penetrating substantial structures,which presents sig-nificant challenges to the reliability of the electronic devices that are crucial to the weapon's perfor-mance.Due to...Modern warfare demands weapons capable of penetrating substantial structures,which presents sig-nificant challenges to the reliability of the electronic devices that are crucial to the weapon's perfor-mance.Due to miniaturization of electronic components,it is challenging to directly measure or numerically predict the mechanical response of small-sized critical interconnections in board-level packaging structures to ensure the mechanical reliability of electronic devices in projectiles under harsh working conditions.To address this issue,an indirect measurement method using the Bayesian regularization-based load identification was proposed in this study based on finite element(FE)pre-dictions to estimate the load applied on critical interconnections of board-level packaging structures during the process of projectile penetration.For predicting the high-strain-rate penetration process,an FE model was established with elasto-plastic constitutive models of the representative packaging ma-terials(that is,solder material and epoxy molding compound)in which material constitutive parameters were calibrated against the experimental results by using the split-Hopkinson pressure bar.As the impact-induced dynamic bending of the printed circuit board resulted in an alternating tensile-compressive loading on the solder joints during penetration,the corner solder joints in the edge re-gions experience the highest S11 and strain,making them more prone to failure.Based on FE predictions at different structural scales,an improved Bayesian method based on augmented Tikhonov regulariza-tion was theoretically proposed to address the issues of ill-posed matrix inversion and noise sensitivity in the load identification at the critical solder joints.By incorporating a wavelet thresholding technique,the method resolves the problem of poor load identification accuracy at high noise levels.The proposed method achieves satisfactorily small relative errors and high correlation coefficients in identifying the mechanical response of local interconnections in board-level packaging structures,while significantly balancing the smoothness of response curves with the accuracy of peak identification.At medium and low noise levels,the relative error is less than 6%,while it is less than 10%at high noise levels.The proposed method provides an effective indirect approach for the boundary conditions of localized solder joints during the projectile penetration process,and its philosophy can be readily extended to other scenarios of multiscale analysis for highly nonlinear materials and structures under extreme loading conditions.展开更多
This paper presents a generalization of the authors＇ earlier work. In this paper, the two concepts, generic regular decomposition （GRD） and regular-decomposition-unstable （RDU） variety introduced in the authors＇...This paper presents a generalization of the authors＇ earlier work. In this paper, the two concepts, generic regular decomposition （GRD） and regular-decomposition-unstable （RDU） variety introduced in the authors＇ previous work for generic zero-dimensional systems, are extended to the case where the parametric systems are not necessarily zero-dimensional. An algorithm is provided to compute GRDs and the associated RDU varieties of parametric systems simultaneously on the basis of the algorithm for generic zero-dimensional systems proposed in the authors＇ previous work. Then the solutions of any parametric system can be represented by the solutions of finitely many regular systems and the decomposition is stable at any parameter value in the complement of the associated RDU variety of the parameter space. The related definitions and the results presented in the authors＇ previous work are also generalized and a further discussion on RDU varieties is given from an experimental point of view. The new algorithm has been implemented on the basis of DISCOVERER with Maple 16 and experimented with a number of benchmarks from the literature.展开更多
The classical elastic impedance （EI） inversion method, however, is based on the L2-norm misfit function and considerably sensitive to outliers, assuming the noise of the seismic data to be the Guassian-distribution....The classical elastic impedance （EI） inversion method, however, is based on the L2-norm misfit function and considerably sensitive to outliers, assuming the noise of the seismic data to be the Guassian-distribution. So we have developed a more robust elastic impedance inversion based on the Ll-norm misfit function, and the noise is assumed to be non-Gaussian. Meanwhile, some regularization methods including the sparse constraint regularization and elastic impedance point constraint regularization are incorporated to improve the ill-posed characteristics of the seismic inversion problem. Firstly, we create the Ll-norm misfit objective function of pre-stack inversion problem based on the Bayesian scheme within the sparse constraint regularization and elastic impedance point constraint regularization. And then, we obtain more robust elastic impedances of different angles which are less sensitive to outliers in seismic data by using the IRLS strategy. Finally, we extract the P-wave and S-wave velocity and density by using the more stable parameter extraction method. Tests on synthetic data show that the P-wave and S-wave velocity and density parameters are still estimated reasonable with moderate noise. A test on the real data set shows that compared to the results of the classical elastic impedance inversion method, the estimated results using the proposed method can get better lateral continuity and more distinct show of the gas, verifying the feasibility and stability of the method.展开更多
The presented iterative multiuser detection technique was based on joint deregularized and box-constrained solution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated...The presented iterative multiuser detection technique was based on joint deregularized and box-constrained solution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated algorithm.The deregularization maximized the energy of the solution,which was opposite to the Tikhonov regularization where the energy was minimized.However,combined with box-constraints,the deregularization forced the solution to be close to the binary set.It further exploited the box-constrained dichotomous coordinate descent algorithm and adapted it to the nonstationary iterative Tikhonov regularization to present an efficient detector.As a result,the worst-case and average complexity are reduced down as K2.8 and K2.5 floating point operation per second,respectively.The development improves the "efficient frontier" in multiuser detection,which is illustrated by simulation results.In addition,most operations in the detector are additions and bit-shifts.This makes the proposed technique attractive for fixed-point hardware implementation.展开更多
Multiuser detection can be described as a quadratic optimization problem with binary constraint. Many techniques are available to find approximate solution to this problem. These tech- niques can be characterized in t...Multiuser detection can be described as a quadratic optimization problem with binary constraint. Many techniques are available to find approximate solution to this problem. These tech- niques can be characterized in terms of complexity and detection performance. The ＂efficient frontier＂ of known techniques include the decision-feedback, branch-and-bound and probabilistic data association detectors. The presented iterative multiuser detection technique is based on joint deregularized and box-constrained so- lution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated algorithm. The deregulari- zation maximizes the energy of the solution, this is opposite to the Tikhonov regularization where the energy is minimized. However, combined with box-constraints, the deregularization forces the solution to be close to the binary set. We further exploit the box- constrained dichotomous coordinate descent （DCD） algorithm and adapt it to the nonstationary iterative Tikhonov regularization to present an efficient detector. As a result, the worst-case and aver- age complexity are reduced down to K28 and K2~ floating point operation per second, respectively. The development improves the ＂efficient frontier＂ in multiuser detection, which is illustrated by simulation results. Finally, a field programmable gate array （FPGA） design of the detector is presented. The detection performance obtained from the fixed-point FPGA implementation shows a good match to the floating-point implementation.展开更多
A new normalized least mean square(NLMS) adaptive filter is first derived from a cost function, which incorporates the conventional one of the NLMS with a minimum-disturbance(MD)constraint. A variable regularization f...A new normalized least mean square(NLMS) adaptive filter is first derived from a cost function, which incorporates the conventional one of the NLMS with a minimum-disturbance(MD)constraint. A variable regularization factor(RF) is then employed to control the contribution made by the MD constraint in the cost function. Analysis results show that the RF can be taken as a combination of the step size and regularization parameter in the conventional NLMS. This implies that these parameters can be jointly controlled by simply tuning the RF as the proposed algorithm does. It also demonstrates that the RF can accelerate the convergence rate of the proposed algorithm and its optimal value can be obtained by minimizing the squared noise-free posteriori error. A method for automatically determining the value of the RF is also presented, which is free of any prior knowledge of the noise. While simulation results verify the analytical ones, it is also illustrated that the performance of the proposed algorithm is superior to the state-of-art ones in both the steady-state misalignment and the convergence rate. A novel algorithm is proposed to solve some problems. Simulation results show the effectiveness of the proposed algorithm.展开更多
A method for fast 1-fold cross validation is proposed for the regularized extreme learning machine （RELM）. The computational time of fast l-fold cross validation increases as the fold number decreases, which is oppo...A method for fast 1-fold cross validation is proposed for the regularized extreme learning machine （RELM）. The computational time of fast l-fold cross validation increases as the fold number decreases, which is opposite to that of naive 1-fold cross validation. As opposed to naive l-fold cross validation, fast l-fold cross validation takes the advantage in terms of computational time, especially for the large fold number such as l 〉 20. To corroborate the efficacy and feasibility of fast l-fold cross validation, experiments on five benchmark regression data sets are evaluated.展开更多
Kernel-based methods work by embedding the data into a feature space and then searching linear hypothesis among the embedding data points. The performance is mostly affected by which kernel is used. A promising way is...Kernel-based methods work by embedding the data into a feature space and then searching linear hypothesis among the embedding data points. The performance is mostly affected by which kernel is used. A promising way is to learn the kernel from the data automatically. A general regularized risk functional （RRF） criterion for kernel matrix learning is proposed. Compared with the RRF criterion, general RRF criterion takes into account the geometric distributions of the embedding data points. It is proven that the distance between different geometric distdbutions can be estimated by their centroid distance in the reproducing kernel Hilbert space. Using this criterion for kernel matrix learning leads to a convex quadratically constrained quadratic programming （QCQP） problem. For several commonly used loss functions, their mathematical formulations are given. Experiment results on a collection of benchmark data sets demonstrate the effectiveness of the proposed method.展开更多
In order to avoid staircasing effect and preserve small scale texture information for the classical total variation regularization, a new minimization energy functional model for image decomposition is proposed. First...In order to avoid staircasing effect and preserve small scale texture information for the classical total variation regularization, a new minimization energy functional model for image decomposition is proposed. Firstly, an adaptive regularization based on the local feature of images is introduced to substitute total variational regularization. The oscillatory component containing texture and/or noise is modeled in generalized function space div （BMO）. And then, the existence and uniqueness of the minimizer for proposed model are proved. Finally, the gradient descent flow of the Euler-Lagrange equations for the new model is numerically implemented by using a finite difference method. Experiments show that the proposed model is very robust to noise, and the staircasing effect is avoided efficiently, while edges and textures are well remained.展开更多
Target maneuver trajectory prediction is an important prerequisite for air combat situation awareness and maneuver decision-making.However,how to use a large amount of trajectory data generated by air combat confronta...Target maneuver trajectory prediction is an important prerequisite for air combat situation awareness and maneuver decision-making.However,how to use a large amount of trajectory data generated by air combat confrontation training to achieve real-time and accurate prediction of target maneuver trajectory is an urgent problem to be solved.To solve this problem,in this paper,a hybrid algorithm based on transfer learning,online learning,ensemble learning,regularization technology,target maneuvering segmentation point recognition algorithm,and Volterra series,abbreviated as AERTrOS-Volterra is proposed.Firstly,the model makes full use of a large number of trajectory sample data generated by air combat confrontation training,and constructs a Tr-Volterra algorithm framework suitable for air combat target maneuver trajectory prediction,which realizes the extraction of effective information from the historical trajectory data.Secondly,in order to improve the real-time online prediction accuracy and robustness of the prediction model in complex electromagnetic environments,on the basis of the TrVolterra algorithm framework,a robust regularized online Sequential Volterra prediction model is proposed by integrating online learning method,regularization technology and inverse weighting calculation method based on the priori error.Finally,inspired by the preferable performance of models ensemble,ensemble learning scheme is also incorporated into our proposed algorithm,which adaptively updates the ensemble prediction model according to the performance of the model on real-time samples and the recognition results of target maneuvering segmentation points,including the adaptation of model weights;adaptation of parameters;and dynamic inclusion and removal of models.Compared with many existing time series prediction methods,the newly proposed target maneuver trajectory prediction algorithm can fully mine the prior knowledge contained in the historical data to assist the current prediction.The rationality and effectiveness of the proposed algorithm are verified by simulation on three sets of chaotic time series data sets and a set of real target maneuver trajectory data sets.展开更多
Tomographic synthetic aperture radar(TomoSAR)imaging exploits the antenna array measurements taken at different elevation aperture to recover the reflectivity function along the elevation direction.In these years,for ...Tomographic synthetic aperture radar(TomoSAR)imaging exploits the antenna array measurements taken at different elevation aperture to recover the reflectivity function along the elevation direction.In these years,for the sparse elevation distribution,compressive sensing(CS)is a developed favorable technique for the high-resolution elevation reconstruction in TomoSAR by solving an L_(1) regularization problem.However,because the elevation distribution in the forested area is nonsparse,if we want to use CS in the recovery,some basis,such as wavelet,should be exploited in the sparse L_(1/2) representation of the elevation reflectivity function.This paper presents a novel wavelet-based L_(2) regularization CS-TomoSAR imaging method of the forested area.In the proposed method,we first construct a wavelet basis,which can sparsely represent the elevation reflectivity function of the forested area,and then reconstruct the elevation distribution by using the L_(1/2) regularization technique.Compared to the wavelet-based L_(1) regularization TomoSAR imaging,the proposed method can improve the elevation recovered quality efficiently.展开更多
A novel rcgularization-based approach is presented for super-resolution reconstruction in order to achieve good tradeoff between noise removal and edge preservation. The method is developed by using L1 norm as data fi...A novel rcgularization-based approach is presented for super-resolution reconstruction in order to achieve good tradeoff between noise removal and edge preservation. The method is developed by using L1 norm as data fidelity term and anisotropic fourth-order diffusion model as a regularization item to constrain the smoothness of the reconstructed images. To evaluate and prove the performance of the proposed method, series of experiments and comparisons with some existing methods including bi-cubic interpolation method and bilateral total variation method are carried out. Numerical results on synthetic data show that the PSNR improvement of the proposed method is approximately 1.0906 dB on average compared to bilateral total variation method, and the results on real videos indicate that the proposed algorithm is also effective in terms of removing visual artifacts and preserving edges in restored images.展开更多
Aiming at the Four-Dimensional Variation source term inversion algorithm proposed earlier,the observation error regularization factor is introduced to improve the prediction accuracy of the diffusion model,and an impr...Aiming at the Four-Dimensional Variation source term inversion algorithm proposed earlier,the observation error regularization factor is introduced to improve the prediction accuracy of the diffusion model,and an improved Four-Dimensional Variation source term inversion algorithm with observation error regularization(OER-4DVAR STI model)is formed.Firstly,by constructing the inversion process and basic model of OER-4DVAR STI model,its basic principle and logical structure are studied.Secondly,the observation error regularization factor estimation method based on Bayesian optimization is proposed,and the error factor is separated and optimized by two parameters:error statistical time and deviation degree.Finally,the scientific,feasible and advanced nature of the OER-4DVAR STI model are verified by numerical simulation and tracer test data.The experimental results show that OER-4DVAR STI model can better reverse calculate the hazard source term information under the conditions of high atmospheric stability and flat underlying surface.Compared with the previous inversion algorithm,the source intensity estimation accuracy of OER-4DVAR STI model is improved by about 46.97%,and the source location estimation accuracy is improved by about 26.72%.展开更多
Image fusion based on the sparse representation(SR)has become the primary research direction of the transform domain method.However,the SR-based image fusion algorithm has the characteristics of high computational com...Image fusion based on the sparse representation(SR)has become the primary research direction of the transform domain method.However,the SR-based image fusion algorithm has the characteristics of high computational complexity and neglecting the local features of an image,resulting in limited image detail retention and a high registration misalignment sensitivity.In order to overcome these shortcomings and the noise existing in the image of the fusion process,this paper proposes a new signal decomposition model,namely the multi-source image fusion algorithm of the gradient regularization convolution SR(CSR).The main innovation of this work is using the sparse optimization function to perform two-scale decomposition of the source image to obtain high-frequency components and low-frequency components.The sparse coefficient is obtained by the gradient regularization CSR model,and the sparse coefficient is taken as the maximum value to get the optimal high frequency component of the fused image.The best low frequency component is obtained by using the fusion strategy of the extreme or the average value.The final fused image is obtained by adding two optimal components.Experimental results demonstrate that this method greatly improves the ability to maintain image details and reduces image registration sensitivity.展开更多
文摘The finite volume method was applied to numerically simulate the bottom pressure field induced by regular waves,vehicles in calm water and vehicles in regular waves.The solution of Navier-Stokes(N-S)equations in the vicinity of numerical wave tank's boundary was forced towards the wave theoretical solution by incorporating momentum source terms,thereby reducing adverse effects such as wave reflection.Simulations utilizing laminar flow,turbulent flow,and ideal fluid models were all found capable of effectively capturing the waveform and bottom pressure of regular waves,agreeing well with experimental data.In predicting the bottom pressure field of the submerged vehicle,turbulent simulations considering fluid viscosity and boundary layer development provided more accurate predictions for the stern region than inviscid simulations.Due to sphere's diffractive effect,the sphere's bottom pressure field in waves is not a linear superposition of the wave's and the sphere's bottom pressure field.However,a slender submerged vehicle exhibits a weaker diffractive effect on waves,thus the submerged vehicle's bottom pressure field in waves can be approximated as a linear superposition of the wave's and the submerged vehicle's bottom pressure field,which simplifies computation and analysis.
基金supported by the National Natural Science Foundation of China(Grant Nos.52475166,52175148)the Regional Collaboration Project of Shanxi Province(Grant No.202204041101044).
文摘Modern warfare demands weapons capable of penetrating substantial structures,which presents sig-nificant challenges to the reliability of the electronic devices that are crucial to the weapon's perfor-mance.Due to miniaturization of electronic components,it is challenging to directly measure or numerically predict the mechanical response of small-sized critical interconnections in board-level packaging structures to ensure the mechanical reliability of electronic devices in projectiles under harsh working conditions.To address this issue,an indirect measurement method using the Bayesian regularization-based load identification was proposed in this study based on finite element(FE)pre-dictions to estimate the load applied on critical interconnections of board-level packaging structures during the process of projectile penetration.For predicting the high-strain-rate penetration process,an FE model was established with elasto-plastic constitutive models of the representative packaging ma-terials(that is,solder material and epoxy molding compound)in which material constitutive parameters were calibrated against the experimental results by using the split-Hopkinson pressure bar.As the impact-induced dynamic bending of the printed circuit board resulted in an alternating tensile-compressive loading on the solder joints during penetration,the corner solder joints in the edge re-gions experience the highest S11 and strain,making them more prone to failure.Based on FE predictions at different structural scales,an improved Bayesian method based on augmented Tikhonov regulariza-tion was theoretically proposed to address the issues of ill-posed matrix inversion and noise sensitivity in the load identification at the critical solder joints.By incorporating a wavelet thresholding technique,the method resolves the problem of poor load identification accuracy at high noise levels.The proposed method achieves satisfactorily small relative errors and high correlation coefficients in identifying the mechanical response of local interconnections in board-level packaging structures,while significantly balancing the smoothness of response curves with the accuracy of peak identification.At medium and low noise levels,the relative error is less than 6%,while it is less than 10%at high noise levels.The proposed method provides an effective indirect approach for the boundary conditions of localized solder joints during the projectile penetration process,and its philosophy can be readily extended to other scenarios of multiscale analysis for highly nonlinear materials and structures under extreme loading conditions.
基金supported by by the National Natural Science Foundation of China under Grant Nos.11271034,11290141the Project SYSKF1207 from SKLCS,IOS,the Chinese Academy of Sciences
文摘This paper presents a generalization of the authors＇ earlier work. In this paper, the two concepts, generic regular decomposition （GRD） and regular-decomposition-unstable （RDU） variety introduced in the authors＇ previous work for generic zero-dimensional systems, are extended to the case where the parametric systems are not necessarily zero-dimensional. An algorithm is provided to compute GRDs and the associated RDU varieties of parametric systems simultaneously on the basis of the algorithm for generic zero-dimensional systems proposed in the authors＇ previous work. Then the solutions of any parametric system can be represented by the solutions of finitely many regular systems and the decomposition is stable at any parameter value in the complement of the associated RDU variety of the parameter space. The related definitions and the results presented in the authors＇ previous work are also generalized and a further discussion on RDU varieties is given from an experimental point of view. The new algorithm has been implemented on the basis of DISCOVERER with Maple 16 and experimented with a number of benchmarks from the literature.
基金Projects(U1562215,41674130,41404088)supported by the National Natural Science Foundation of ChinaProjects(2013CB228604,2014CB239201)supported by the National Basic Research Program of China+1 种基金Projects(2016ZX05027004-001,2016ZX05002006-009)supported by the National Oil and Gas Major Projects of ChinaProject(15CX08002A)supported by the Fundamental Research Funds for the Central Universities,China
文摘The classical elastic impedance （EI） inversion method, however, is based on the L2-norm misfit function and considerably sensitive to outliers, assuming the noise of the seismic data to be the Guassian-distribution. So we have developed a more robust elastic impedance inversion based on the Ll-norm misfit function, and the noise is assumed to be non-Gaussian. Meanwhile, some regularization methods including the sparse constraint regularization and elastic impedance point constraint regularization are incorporated to improve the ill-posed characteristics of the seismic inversion problem. Firstly, we create the Ll-norm misfit objective function of pre-stack inversion problem based on the Bayesian scheme within the sparse constraint regularization and elastic impedance point constraint regularization. And then, we obtain more robust elastic impedances of different angles which are less sensitive to outliers in seismic data by using the IRLS strategy. Finally, we extract the P-wave and S-wave velocity and density by using the more stable parameter extraction method. Tests on synthetic data show that the P-wave and S-wave velocity and density parameters are still estimated reasonable with moderate noise. A test on the real data set shows that compared to the results of the classical elastic impedance inversion method, the estimated results using the proposed method can get better lateral continuity and more distinct show of the gas, verifying the feasibility and stability of the method.
文摘The presented iterative multiuser detection technique was based on joint deregularized and box-constrained solution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated algorithm.The deregularization maximized the energy of the solution,which was opposite to the Tikhonov regularization where the energy was minimized.However,combined with box-constraints,the deregularization forced the solution to be close to the binary set.It further exploited the box-constrained dichotomous coordinate descent algorithm and adapted it to the nonstationary iterative Tikhonov regularization to present an efficient detector.As a result,the worst-case and average complexity are reduced down as K2.8 and K2.5 floating point operation per second,respectively.The development improves the "efficient frontier" in multiuser detection,which is illustrated by simulation results.In addition,most operations in the detector are additions and bit-shifts.This makes the proposed technique attractive for fixed-point hardware implementation.
基金supported by the National Council for Technological and Scientific Development of Brazil (RN82/2008)
文摘Multiuser detection can be described as a quadratic optimization problem with binary constraint. Many techniques are available to find approximate solution to this problem. These tech- niques can be characterized in terms of complexity and detection performance. The ＂efficient frontier＂ of known techniques include the decision-feedback, branch-and-bound and probabilistic data association detectors. The presented iterative multiuser detection technique is based on joint deregularized and box-constrained so- lution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated algorithm. The deregulari- zation maximizes the energy of the solution, this is opposite to the Tikhonov regularization where the energy is minimized. However, combined with box-constraints, the deregularization forces the solution to be close to the binary set. We further exploit the box- constrained dichotomous coordinate descent （DCD） algorithm and adapt it to the nonstationary iterative Tikhonov regularization to present an efficient detector. As a result, the worst-case and aver- age complexity are reduced down to K28 and K2~ floating point operation per second, respectively. The development improves the ＂efficient frontier＂ in multiuser detection, which is illustrated by simulation results. Finally, a field programmable gate array （FPGA） design of the detector is presented. The detection performance obtained from the fixed-point FPGA implementation shows a good match to the floating-point implementation.
基金supported by the National Natural Science Foundation of China(61571131 11604055)
文摘A new normalized least mean square(NLMS) adaptive filter is first derived from a cost function, which incorporates the conventional one of the NLMS with a minimum-disturbance(MD)constraint. A variable regularization factor(RF) is then employed to control the contribution made by the MD constraint in the cost function. Analysis results show that the RF can be taken as a combination of the step size and regularization parameter in the conventional NLMS. This implies that these parameters can be jointly controlled by simply tuning the RF as the proposed algorithm does. It also demonstrates that the RF can accelerate the convergence rate of the proposed algorithm and its optimal value can be obtained by minimizing the squared noise-free posteriori error. A method for automatically determining the value of the RF is also presented, which is free of any prior knowledge of the noise. While simulation results verify the analytical ones, it is also illustrated that the performance of the proposed algorithm is superior to the state-of-art ones in both the steady-state misalignment and the convergence rate. A novel algorithm is proposed to solve some problems. Simulation results show the effectiveness of the proposed algorithm.
基金supported by the National Natural Science Foundation of China(51006052)the NUST Outstanding Scholar Supporting Program
文摘A method for fast 1-fold cross validation is proposed for the regularized extreme learning machine （RELM）. The computational time of fast l-fold cross validation increases as the fold number decreases, which is opposite to that of naive 1-fold cross validation. As opposed to naive l-fold cross validation, fast l-fold cross validation takes the advantage in terms of computational time, especially for the large fold number such as l 〉 20. To corroborate the efficacy and feasibility of fast l-fold cross validation, experiments on five benchmark regression data sets are evaluated.
基金supported by the National Natural Science Fundation of China (60736021)the Joint Funds of NSFC-Guangdong Province(U0735003)
文摘Kernel-based methods work by embedding the data into a feature space and then searching linear hypothesis among the embedding data points. The performance is mostly affected by which kernel is used. A promising way is to learn the kernel from the data automatically. A general regularized risk functional （RRF） criterion for kernel matrix learning is proposed. Compared with the RRF criterion, general RRF criterion takes into account the geometric distributions of the embedding data points. It is proven that the distance between different geometric distdbutions can be estimated by their centroid distance in the reproducing kernel Hilbert space. Using this criterion for kernel matrix learning leads to a convex quadratically constrained quadratic programming （QCQP） problem. For several commonly used loss functions, their mathematical formulations are given. Experiment results on a collection of benchmark data sets demonstrate the effectiveness of the proposed method.
基金supported by the Science and Technology Foundation Program of Chongqing Municipal Education Committee (KJ091208)
文摘In order to avoid staircasing effect and preserve small scale texture information for the classical total variation regularization, a new minimization energy functional model for image decomposition is proposed. Firstly, an adaptive regularization based on the local feature of images is introduced to substitute total variational regularization. The oscillatory component containing texture and/or noise is modeled in generalized function space div （BMO）. And then, the existence and uniqueness of the minimizer for proposed model are proved. Finally, the gradient descent flow of the Euler-Lagrange equations for the new model is numerically implemented by using a finite difference method. Experiments show that the proposed model is very robust to noise, and the staircasing effect is avoided efficiently, while edges and textures are well remained.
基金the support of the Fundamental Research Funds for the Air Force Engineering University under Grant No.XZJK2019040。
文摘Target maneuver trajectory prediction is an important prerequisite for air combat situation awareness and maneuver decision-making.However,how to use a large amount of trajectory data generated by air combat confrontation training to achieve real-time and accurate prediction of target maneuver trajectory is an urgent problem to be solved.To solve this problem,in this paper,a hybrid algorithm based on transfer learning,online learning,ensemble learning,regularization technology,target maneuvering segmentation point recognition algorithm,and Volterra series,abbreviated as AERTrOS-Volterra is proposed.Firstly,the model makes full use of a large number of trajectory sample data generated by air combat confrontation training,and constructs a Tr-Volterra algorithm framework suitable for air combat target maneuver trajectory prediction,which realizes the extraction of effective information from the historical trajectory data.Secondly,in order to improve the real-time online prediction accuracy and robustness of the prediction model in complex electromagnetic environments,on the basis of the TrVolterra algorithm framework,a robust regularized online Sequential Volterra prediction model is proposed by integrating online learning method,regularization technology and inverse weighting calculation method based on the priori error.Finally,inspired by the preferable performance of models ensemble,ensemble learning scheme is also incorporated into our proposed algorithm,which adaptively updates the ensemble prediction model according to the performance of the model on real-time samples and the recognition results of target maneuvering segmentation points,including the adaptation of model weights;adaptation of parameters;and dynamic inclusion and removal of models.Compared with many existing time series prediction methods,the newly proposed target maneuver trajectory prediction algorithm can fully mine the prior knowledge contained in the historical data to assist the current prediction.The rationality and effectiveness of the proposed algorithm are verified by simulation on three sets of chaotic time series data sets and a set of real target maneuver trajectory data sets.
基金This work was supported by the Fundamental Research Funds for the Central Universities(NE2020004)the National Natural Science Foundation of China(61901213)+3 种基金the Natural Science Foundation of Jiangsu Province(BK20190397)the Aeronautical Science Foundation of China(201920052001)the Young Science and Technology Talent Support Project of Jiangsu Science and Technology Associationthe Foundation of Graduate Innovation Center in Nanjing University of Aeronautics and Astronautics(kfjj20200419).
文摘Tomographic synthetic aperture radar(TomoSAR)imaging exploits the antenna array measurements taken at different elevation aperture to recover the reflectivity function along the elevation direction.In these years,for the sparse elevation distribution,compressive sensing(CS)is a developed favorable technique for the high-resolution elevation reconstruction in TomoSAR by solving an L_(1) regularization problem.However,because the elevation distribution in the forested area is nonsparse,if we want to use CS in the recovery,some basis,such as wavelet,should be exploited in the sparse L_(1/2) representation of the elevation reflectivity function.This paper presents a novel wavelet-based L_(2) regularization CS-TomoSAR imaging method of the forested area.In the proposed method,we first construct a wavelet basis,which can sparsely represent the elevation reflectivity function of the forested area,and then reconstruct the elevation distribution by using the L_(1/2) regularization technique.Compared to the wavelet-based L_(1) regularization TomoSAR imaging,the proposed method can improve the elevation recovered quality efficiently.
基金Projects(60963012,61262034)supported by the National Natural Science Foundation of ChinaProject(211087)supported by the Key Project of Ministry of Education of ChinaProjects(2010GZS0052,20114BAB211020)supported by the Natural Science Foundation of Jiangxi Province,China
文摘A novel rcgularization-based approach is presented for super-resolution reconstruction in order to achieve good tradeoff between noise removal and edge preservation. The method is developed by using L1 norm as data fidelity term and anisotropic fourth-order diffusion model as a regularization item to constrain the smoothness of the reconstructed images. To evaluate and prove the performance of the proposed method, series of experiments and comparisons with some existing methods including bi-cubic interpolation method and bilateral total variation method are carried out. Numerical results on synthetic data show that the PSNR improvement of the proposed method is approximately 1.0906 dB on average compared to bilateral total variation method, and the results on real videos indicate that the proposed algorithm is also effective in terms of removing visual artifacts and preserving edges in restored images.
基金Ministry of Science and Technology of the People’s Republic of China for its support and guidance(Grant No.2018YFC0214100)。
文摘Aiming at the Four-Dimensional Variation source term inversion algorithm proposed earlier,the observation error regularization factor is introduced to improve the prediction accuracy of the diffusion model,and an improved Four-Dimensional Variation source term inversion algorithm with observation error regularization(OER-4DVAR STI model)is formed.Firstly,by constructing the inversion process and basic model of OER-4DVAR STI model,its basic principle and logical structure are studied.Secondly,the observation error regularization factor estimation method based on Bayesian optimization is proposed,and the error factor is separated and optimized by two parameters:error statistical time and deviation degree.Finally,the scientific,feasible and advanced nature of the OER-4DVAR STI model are verified by numerical simulation and tracer test data.The experimental results show that OER-4DVAR STI model can better reverse calculate the hazard source term information under the conditions of high atmospheric stability and flat underlying surface.Compared with the previous inversion algorithm,the source intensity estimation accuracy of OER-4DVAR STI model is improved by about 46.97%,and the source location estimation accuracy is improved by about 26.72%.
基金the National Natural Science Foundation of China(61671383)Shaanxi Key Industry Innovation Chain Project(2018ZDCXL-G-12-2,2019ZDLGY14-02-02,2019ZDLGY14-02-03).
文摘Image fusion based on the sparse representation(SR)has become the primary research direction of the transform domain method.However,the SR-based image fusion algorithm has the characteristics of high computational complexity and neglecting the local features of an image,resulting in limited image detail retention and a high registration misalignment sensitivity.In order to overcome these shortcomings and the noise existing in the image of the fusion process,this paper proposes a new signal decomposition model,namely the multi-source image fusion algorithm of the gradient regularization convolution SR(CSR).The main innovation of this work is using the sparse optimization function to perform two-scale decomposition of the source image to obtain high-frequency components and low-frequency components.The sparse coefficient is obtained by the gradient regularization CSR model,and the sparse coefficient is taken as the maximum value to get the optimal high frequency component of the fused image.The best low frequency component is obtained by using the fusion strategy of the extreme or the average value.The final fused image is obtained by adding two optimal components.Experimental results demonstrate that this method greatly improves the ability to maintain image details and reduces image registration sensitivity.
