Stochastic iterative learning control(ILC) is designed for solving the tracking problem of stochastic linear systems through fading channels. Consequently, the signals used in learning control algorithms are faded in ...Stochastic iterative learning control(ILC) is designed for solving the tracking problem of stochastic linear systems through fading channels. Consequently, the signals used in learning control algorithms are faded in the sense that a random variable is multiplied by the original signal. To achieve the tracking objective, a two-dimensional Kalman filtering method is used in this study to derive a learning gain matrix varying along both time and iteration axes. The learning gain matrix minimizes the trace of input error covariance. The asymptotic convergence of the generated input sequence to the desired input value is strictly proved in the mean-square sense. Both output and input fading are accounted for separately in turn, followed by a general formulation that both input and output fading coexists.Illustrative examples are provided to verify the effectiveness of the proposed schemes.展开更多
Although many graph processing systems have been proposed, graphs in the real-world are often dynamic. It is important to keep the results of graph computation up-todate. Incremental computation is demonstrated to be ...Although many graph processing systems have been proposed, graphs in the real-world are often dynamic. It is important to keep the results of graph computation up-todate. Incremental computation is demonstrated to be an efficient solution to update calculated results. Recently, many incremental graph processing systems have been proposed to handle dynamic graphs in an asynchronous way and are able to achieve better performance than those processed in a synchronous way. However, these solutions still suffer from sub-optimal convergence speed due to their slow propagation of important vertex state (important to convergence speed) and poor locality. In order to solve these problems, we propose a novel graph processing framework. It introduces a dynamic partition method to gather the important vertices for high locality, and then uses a priority-based scheduling algorithm to assign them with a higher priority for an effective processing order. By such means, it is able to reduce the number of updates and increase the locality, thereby reducing the convergence time. Experimental results show that our method reduces the number of updates by 30%, and reduces the total execution time by 35%, compared with state-of-the-art systems.展开更多
This paper deals with the problem of iterative learning control for a class of discrete singular systems with fixed initial shift. According to the characteristics of the discrete singular systems, a closed-loop learn...This paper deals with the problem of iterative learning control for a class of discrete singular systems with fixed initial shift. According to the characteristics of the discrete singular systems, a closed-loop learning algorithm is proposed and the corresponding state limiting trajectory is presented.It is shown that the algorithm can guarantee that the system state converges uniformly to the state limiting trajectory on the whole time interval. Then the initial rectifying strategy is introduced to the discrete singular systems for eliminating the effect of the fixed initial shift. Under the action of the initial rectifying strategy, the system state can converge to the desired state trajectory within the pre-specified finite time interval no matter what value the fixed initial shift takes. Finally, a numerical example is given to illustrate the effectiveness of the proposed approach.展开更多
Dear editor,Force tracking control is important for constrained operations. In recent years, impedance control is garnering increasing attention in robot force control. A new two-phase impedance function through null ...Dear editor,Force tracking control is important for constrained operations. In recent years, impedance control is garnering increasing attention in robot force control. A new two-phase impedance function through null stiffness in an original impedance equation to satisfy zero-force tracking error for any environment was presented in (1, 2)Further improvement was performed in (3)。展开更多
The actual boundary conditions of cantilever-like structures might be non-ideally clamped in engineering practice, and they can also vary with time due to damage or aging. Precise modelling of boundary conditions, in ...The actual boundary conditions of cantilever-like structures might be non-ideally clamped in engineering practice, and they can also vary with time due to damage or aging. Precise modelling of boundary conditions, in which both the boundary stiffness and the boundary mass should be modelled correctly, might be one of the most significant aspects in dynamic analysis and testing for such structures. However, only the boundary stiffness was considered in the most existing methods. In this paper, a boundary condition modelling and identification method for cantilever-like structures is proposed to precisely model both the boundary stiffness and the boundary mass using sensitivity analysis of natural frequencies. The boundary conditions of a cantilever-like structure can be parameterized by constant mass, constant rotational inertia,constant translational stiffness, and constant rotational stiffness. The relationship between natural frequencies and boundary parameters is deduced according to the vibration equation for the lateral vibration of a non-uniform beam. Then, an iterative identification formulation is established using the sensitivity analysis of natural frequencies with respect to the boundary parameters. The regularization technique is also used to solve the potential ill-posed problem in the identification procedure.Numerical simulations and experiments are performed to validate the feasibility and accuracy of the proposed method. Results show that the proposed method can be utilized to precisely model the boundary parameters of a cantilever-like structure.展开更多
Utilizing data from controlled seismic sources to image the subsurface structures and invert the physical properties of the subsurface media is a major effort in exploration geophysics. Dense seismic records with high...Utilizing data from controlled seismic sources to image the subsurface structures and invert the physical properties of the subsurface media is a major effort in exploration geophysics. Dense seismic records with high signal-to-noise ratio (SNR) and high fidelity helps in producing high quality imaging results. Therefore, seismic data denoising and missing traces reconstruction are significant for seismic data processing. Traditional denoising and interpolation methods rarely occasioned rely on noise level estimations, thus requiring heavy manual work to deal with records and the selection of optimal parameters. We propose a simultaneous denoising and interpolation method based on deep learning. For noisy records with missing traces, we adopt an iterative alternating optimization strategy and separate the objective function of the data restoring problem into two sub-problems. The seismic records can be reconstructed by solving a least-square problem and applying a set of pre-trained denoising models alternatively and iteratively. We demonstrate this method with synthetic and field data.展开更多
A functional model named EIO(Errors-In-Observations) is proposed for general TLS(total least-squares)adjustment. The EIO model only considers the correction of the observation vector, but doesn’t consider to correct ...A functional model named EIO(Errors-In-Observations) is proposed for general TLS(total least-squares)adjustment. The EIO model only considers the correction of the observation vector, but doesn’t consider to correct all elements in the design matrix as the EIV(Errors-In-Variables) model does, furthermore, the dimension of cofactor matrix is much smaller. Iterative algorithms for the parameter estimation and their precise covariance matrix are derived rigorously, and the computation steps are also presented. The proposed approach considers the correction of the observations in the coefficient matrix, and ensures their agreements in every matrix elements. Parameters and corrections can be solved at the same time.An approximate solution and a precise solution of the covariance matrix can be achieved by corresponding algorithms. Applications of EIO model and the proposed algorithms are demonstrated with several examples. The results and comparative studies show that the proposed EIO model and algorithms are feasible and reliable for general adjustment problems.展开更多
A smart homing guidance strategy with control saturation against a target-defender team is derived. It is noteworthy that a cooperative strategy of the target-defender team is applied,which has been proved more challe...A smart homing guidance strategy with control saturation against a target-defender team is derived. It is noteworthy that a cooperative strategy of the target-defender team is applied,which has been proved more challenging for the homing guidance.The defender missile is launched by the target and guided by a cooperative augmented proportional navigation(APN). At the same time, the target performs a one-switch maneuver to cooperate and minimize the defender’s acceleration requirement. The problem is analyzed for arbitrary-order linear dynamics of the agents in the linearized form but validated by the mathematical simulations by using nonlinear kinematics. The perfect information of three agents’ states is assumed. Then, a method to deal with the target-defender team is proposed. It contains a combined performance index penalizing the miss distance relative to the target and energy consumption in the whole duration. Besides, the specific miss distance related to the defender is regarded as an inequality constraint. An analytical solution for the smart guidance strategy against the APN guided defender is derived. Meanwhile, the control saturations are introduced to get more realistic and reasonable insights to this practical target-missile-defender problem. A simple but effective iterative searching technique is proposed to determine the saturation time points. The solution provides an optimal homing strategy to evade the defender with a specific miss distance and intercept the target with the minimum miss distance in the minimum energy manner. Nonlinear two-dimensional simulation results are used to validate the theoretical analysis. By comparison with the optimal differential game guidance(ODGG) and the combined minimum effort guidance(CMEG), the superiority of this smart guidance strategy is concluded.展开更多
In this paper, we consider the problem of finding sparse solutions for underdetermined systems of linear equations, which can be formulated as a class of L0 norm minimization problem. By using the least absolute resid...In this paper, we consider the problem of finding sparse solutions for underdetermined systems of linear equations, which can be formulated as a class of L0 norm minimization problem. By using the least absolute residual approximation, we propose a new piecewis, quadratic function to approximate the L0 norm.Then, we develop a piecewise quadratic approximation(PQA) model where the objective function is given by the summation of a smooth non-convex component and a non-smooth convex component. To solve the(PQA) model,we present an algorithm based on the idea of the iterative thresholding algorithm and derive the convergence and the convergence rate. Finally, we carry out a series of numerical experiments to demonstrate the performance of the proposed algorithm for(PQA). We also conduct a phase diagram analysis to further show the superiority of(PQA) over L1 and L1/2 regularizations.展开更多
For a class of discrete switched systems with unknown input, an unknown input observer design method is proposed under the premise of changes along time axis but no changes along iteration axis. This method applies th...For a class of discrete switched systems with unknown input, an unknown input observer design method is proposed under the premise of changes along time axis but no changes along iteration axis. This method applies the iterative learning control thought to the design of unknown input observer, construets the unknown input observer by introducing virtual input signal, and uses the error signal generated from the actual system output and the observer output to correct repetitively the virtual input, which gradually approxima tes the actual unknown input as the it erations increase. Moreover, the convergence of the observer is strictly proved based on contraction mapping theory, as well as the convergence condition is given. The theoretical analysis indicates that designed unknown input observer can accurately estimate the state and unknown input of the system simultaneously. Simulation example further verifies the effectiveness of the proposed algorithm.展开更多
Simple linear iterative cluster(SLIC) is widely used because controllable superpixel number, accurate edge covering, symmetrical production and fast speed of calculation. The main problem of the SLIC algorithm is its ...Simple linear iterative cluster(SLIC) is widely used because controllable superpixel number, accurate edge covering, symmetrical production and fast speed of calculation. The main problem of the SLIC algorithm is its under-segmentation when applied to segment artificial structure images with unobvious boundaries and narrow regions. Therefore, an improved clustering segmentation algorithm to correct the segmentation results of SLIC is presented in this paper. The allocation of pixels is not only related to its own characteristic, but also to those of its surrounding pixels.Hence, it is appropriate to improve the standard SLIC through the pixels by focusing on boundaries. An improved SLIC method adheres better to the boundaries in the image is proposed, by using the first and second order difference operators as magnified factors. Experimental results demonstrate that the proposed method achieves an excellent boundary adherence for artificial structure images. The application of the proposed method is extended to images with an unobvious boundary in the Berkeley Segmentation Dataset BSDS500. In comparison with SLIC, the boundary adherence is increased obviously.展开更多
Predicting the future information and recovering the missing data for time series are two vital tasks faced in various application fields.They are often subjected to big challenges,especially when the signal is nonlin...Predicting the future information and recovering the missing data for time series are two vital tasks faced in various application fields.They are often subjected to big challenges,especially when the signal is nonlinear and nonstationary which is common in practice.In this paper,we propose a hybrid 2-stage approach,named IF2FNN,to predict(including short-term and long-term predictions)and recover the general types of time series.In the first stage,we decompose the original non-stationary series into several“quasi stationary”intrinsic mode functions(IMFs)by the iterative filtering(IF)method.In the second stage,all of the IMFs are fed as the inputs to the factorization machine based neural network model to perform the prediction and recovery.We test the strategy on five datasets including an artificial constructed signal(ACS),and four real-world signals:the length of day(LOD),the northern hemisphere land-ocean temperature index(NHLTI),the troposphere monthly mean temperature(TMMT),and the national association of securities dealers automated quotations index(NASDAQ).The results are compared with those obtained from the other prevailing methods.Our experiments indicate that under the same conditions,the proposed method outperforms the others for prediction and recovery according to various metrics such as mean absolute error(MAE),root mean square error(RMSE),and mean absolute percentage error(MAPE).展开更多
Most inverse reservoir modeling techniques require many forward simulations, and the posterior models cannot preserve geological features of prior models. This study proposes an iterative static modeling approach that...Most inverse reservoir modeling techniques require many forward simulations, and the posterior models cannot preserve geological features of prior models. This study proposes an iterative static modeling approach that utilizes dynamic data for rejecting an unsuitable training image (TI) among a set of TI candidates and for synthesizing history-matched pseudo-soft data. The proposed method is applied to two cases of channelized reservoirs, which have uncertainty in channel geometry such as direction, amplitude, and width. Distance-based clustering is applied to the initial models in total to select the qualified models efficiently. The mean of the qualified models is employed as a history-matched facies probability map in the next iteration of static models. Also, the most plausible TI is determined among TI candidates by rejecting other TIs during the iteration. The posterior models of the proposed method outperform updated models of ensemble Kalman filter (EnKF) and ensemble smoother (ES) because they describe the true facies connectivity with bimodal distribution and predict oil and water production with a reasonable range of uncertainty. In terms of simulation time, it requires 30 times of forward simulation in history matching, while the EnKF and ES need 9000 times and 200 times, respectively.展开更多
We propose a novel method for vector sketch simplification based on the simplification of the geometric structure that is extracted from the input vector graph, which can be referred to as a base complex.Unlike the se...We propose a novel method for vector sketch simplification based on the simplification of the geometric structure that is extracted from the input vector graph, which can be referred to as a base complex.Unlike the sets of strokes, which are treated in the existing approaches, a base complex is considered to be a collection of various geometric primitives. Guided by the shape similarity metrics that are defined for the base complex, an agglomeration procedure is proposed to simplify the base complex by iteratively merging a pair of geometric primitives that exhibit the minimum cost into a new one. This simplified base complex is finally converted into a simplified vector graph. Our algorithm is computationally efficient and is able to retain a large amount of useful shape information from the original vector graph, thereby achieving a tradeoff between efficiency and geometric fidelity. Furthermore, the level of simplification of the input vector graph can be easily controlled using a single threshold in our method. We make comparisons with some existing methods using the datasets that have been provided in the corresponding studies as well as using different styles of sketches drawn by artists. Thus, our experiments demonstrate the computational efficiency of our method and its capability for producing the desirable results.展开更多
This paper summarizes the parameter estimation of systems with set-valued signals, which can be classified to three catalogs: one-time completed algorithms, iterative methods and recursive algorithms. For one-time com...This paper summarizes the parameter estimation of systems with set-valued signals, which can be classified to three catalogs: one-time completed algorithms, iterative methods and recursive algorithms. For one-time completed algorithms, empirical measure method is one of the earliest methods to estimate parameters by using set-valued signals, which has been applied to the adaptive tracking of periodic target signals. The iterative methods seek numerical solutions of the maximum likelihood estimation, which have been applied to both complex diseases diagnosis and radar target recognition. The recursive algorithms are constructed via stochastic approximation and stochastic gradient methods, which have been applied to adaptive tracking of non-periodic signals.展开更多
The centroid location of a near infrared star always deviates from the real center due to the effects of surrounding radiation. To determine a more accurate center of a near infrared star, this paper proposes a method...The centroid location of a near infrared star always deviates from the real center due to the effects of surrounding radiation. To determine a more accurate center of a near infrared star, this paper proposes a method to detect the star’s saliency area and calculate the star’s centroid via the pixels only in this area, which can greatly decrease the effect of the radiation. During saliency area detection, we calculated the boundary connectivity and gray similarity of every pixel to estimate how likely it was to be a background pixel. Aiming to simplify and speed up the calculation process, we divided the near infrared starry sky image into super pixel maps at multi-scale by Simple Linear Iterative Clustering(SLIC). Second, we detected the saliency map for every super pixel map of the image. Finally, we fused the saliency maps according to a weighted coefficient that is determined by the least square method. For the images used in our experiment, we set the multi-scale super pixel numbers to 100, 150,and 200. The results show that our method can obtain an offset variance of less than 0.27 for the center coordinates compared to the labelled centers.展开更多
In order to solve the springback problem in sheet metal forming, the trial and error method is a widely used method in the factory, which is time-consuming and costly for its non-direction and non-quantitative. Finite...In order to solve the springback problem in sheet metal forming, the trial and error method is a widely used method in the factory, which is time-consuming and costly for its non-direction and non-quantitative. Finite element simulation is an e ective method to predict the springback of complex shape parts, but its precision is sensitive to the simulation model, particularly material model and boundary conditions. In this paper, the simple iterative method is introduced to establish the iterative compensation algorithm, and the convergence criterion of iterative parameters is put forward. In addition, the new algorithm is applied to the V-free bending and stretch-bending processes, and the convergence of curvature and bending angle is proved theoretically and verified experimentally. At the same time,the iterative compensation experiments for plane bending show that, the new method can predict the next compensaantido tnh ev atlaureg ebta cseurdv oatnu trhe ew sitphri tnhgeb earcrko ro fo fe laecshs ttehsat,n s0 o. 5 th%a ta rteh eo btatraigneet db aefntedri n2 g-3 a nitgelrea tiwoitnhs.t Thhei se rrreosre aorf clhe sps rtohpaons e±s 0 a.1%new iterative compensation algorithm to predict springback in sheet metal forming process, where each compensation value depends only on the iteration parameter di erence before and after springback for the same forming process of same material.展开更多
基金supported by the National Natural Science Foundation of China(61673045)the Fundamental Research Funds for the Central Universities(XK1802-4).
文摘Stochastic iterative learning control(ILC) is designed for solving the tracking problem of stochastic linear systems through fading channels. Consequently, the signals used in learning control algorithms are faded in the sense that a random variable is multiplied by the original signal. To achieve the tracking objective, a two-dimensional Kalman filtering method is used in this study to derive a learning gain matrix varying along both time and iteration axes. The learning gain matrix minimizes the trace of input error covariance. The asymptotic convergence of the generated input sequence to the desired input value is strictly proved in the mean-square sense. Both output and input fading are accounted for separately in turn, followed by a general formulation that both input and output fading coexists.Illustrative examples are provided to verify the effectiveness of the proposed schemes.
基金the National Natural Science Foundation of China (Grant No. 61702202)China Postdoctoral Science Foundation Funded Project (2017M610477 and 2017T100555).
文摘Although many graph processing systems have been proposed, graphs in the real-world are often dynamic. It is important to keep the results of graph computation up-todate. Incremental computation is demonstrated to be an efficient solution to update calculated results. Recently, many incremental graph processing systems have been proposed to handle dynamic graphs in an asynchronous way and are able to achieve better performance than those processed in a synchronous way. However, these solutions still suffer from sub-optimal convergence speed due to their slow propagation of important vertex state (important to convergence speed) and poor locality. In order to solve these problems, we propose a novel graph processing framework. It introduces a dynamic partition method to gather the important vertices for high locality, and then uses a priority-based scheduling algorithm to assign them with a higher priority for an effective processing order. By such means, it is able to reduce the number of updates and increase the locality, thereby reducing the convergence time. Experimental results show that our method reduces the number of updates by 30%, and reduces the total execution time by 35%, compared with state-of-the-art systems.
基金National Natural Science Foundation of China under Grant Nos. 61374104 and 61773170Natural Science Foundation of Guangdong Province of China under Grant No. 2016A030313505.
文摘This paper deals with the problem of iterative learning control for a class of discrete singular systems with fixed initial shift. According to the characteristics of the discrete singular systems, a closed-loop learning algorithm is proposed and the corresponding state limiting trajectory is presented.It is shown that the algorithm can guarantee that the system state converges uniformly to the state limiting trajectory on the whole time interval. Then the initial rectifying strategy is introduced to the discrete singular systems for eliminating the effect of the fixed initial shift. Under the action of the initial rectifying strategy, the system state can converge to the desired state trajectory within the pre-specified finite time interval no matter what value the fixed initial shift takes. Finally, a numerical example is given to illustrate the effectiveness of the proposed approach.
基金supported by National Key Research and Development Program of China(Grant No.2017YFB1303401)National Natural Science Foundation of China(Grant Nos.91748114,51535004,51705175).
文摘Dear editor,Force tracking control is important for constrained operations. In recent years, impedance control is garnering increasing attention in robot force control. A new two-phase impedance function through null stiffness in an original impedance equation to satisfy zero-force tracking error for any environment was presented in (1, 2)Further improvement was performed in (3)。
基金the National Natural Science Foundation of China(No.11402205)the Aeronautical Science Foundation of China(No.20171553014)the Natural Science Basic Reasearch Plan in Shaanxi Province of China(No.2018JM5178).
文摘The actual boundary conditions of cantilever-like structures might be non-ideally clamped in engineering practice, and they can also vary with time due to damage or aging. Precise modelling of boundary conditions, in which both the boundary stiffness and the boundary mass should be modelled correctly, might be one of the most significant aspects in dynamic analysis and testing for such structures. However, only the boundary stiffness was considered in the most existing methods. In this paper, a boundary condition modelling and identification method for cantilever-like structures is proposed to precisely model both the boundary stiffness and the boundary mass using sensitivity analysis of natural frequencies. The boundary conditions of a cantilever-like structure can be parameterized by constant mass, constant rotational inertia,constant translational stiffness, and constant rotational stiffness. The relationship between natural frequencies and boundary parameters is deduced according to the vibration equation for the lateral vibration of a non-uniform beam. Then, an iterative identification formulation is established using the sensitivity analysis of natural frequencies with respect to the boundary parameters. The regularization technique is also used to solve the potential ill-posed problem in the identification procedure.Numerical simulations and experiments are performed to validate the feasibility and accuracy of the proposed method. Results show that the proposed method can be utilized to precisely model the boundary parameters of a cantilever-like structure.
基金the National Natural Science Foundation of China (Grant No. 41674120).
文摘Utilizing data from controlled seismic sources to image the subsurface structures and invert the physical properties of the subsurface media is a major effort in exploration geophysics. Dense seismic records with high signal-to-noise ratio (SNR) and high fidelity helps in producing high quality imaging results. Therefore, seismic data denoising and missing traces reconstruction are significant for seismic data processing. Traditional denoising and interpolation methods rarely occasioned rely on noise level estimations, thus requiring heavy manual work to deal with records and the selection of optimal parameters. We propose a simultaneous denoising and interpolation method based on deep learning. For noisy records with missing traces, we adopt an iterative alternating optimization strategy and separate the objective function of the data restoring problem into two sub-problems. The seismic records can be reconstructed by solving a least-square problem and applying a set of pre-trained denoising models alternatively and iteratively. We demonstrate this method with synthetic and field data.
基金the Open Fund of Engineering laboratory of Spatial Information Technology of Highway Geological Disaster Early Warning in Hunan Province(Changsha University of Science&Technology,Grant No:KFJ150602)Hunan Province Science and Technology Program Funded Projects,China(Grant No:2015NK3035).
文摘A functional model named EIO(Errors-In-Observations) is proposed for general TLS(total least-squares)adjustment. The EIO model only considers the correction of the observation vector, but doesn’t consider to correct all elements in the design matrix as the EIV(Errors-In-Variables) model does, furthermore, the dimension of cofactor matrix is much smaller. Iterative algorithms for the parameter estimation and their precise covariance matrix are derived rigorously, and the computation steps are also presented. The proposed approach considers the correction of the observations in the coefficient matrix, and ensures their agreements in every matrix elements. Parameters and corrections can be solved at the same time.An approximate solution and a precise solution of the covariance matrix can be achieved by corresponding algorithms. Applications of EIO model and the proposed algorithms are demonstrated with several examples. The results and comparative studies show that the proposed EIO model and algorithms are feasible and reliable for general adjustment problems.
基金the National Natural Science Foundation of China (9121610461503302).
文摘A smart homing guidance strategy with control saturation against a target-defender team is derived. It is noteworthy that a cooperative strategy of the target-defender team is applied,which has been proved more challenging for the homing guidance.The defender missile is launched by the target and guided by a cooperative augmented proportional navigation(APN). At the same time, the target performs a one-switch maneuver to cooperate and minimize the defender’s acceleration requirement. The problem is analyzed for arbitrary-order linear dynamics of the agents in the linearized form but validated by the mathematical simulations by using nonlinear kinematics. The perfect information of three agents’ states is assumed. Then, a method to deal with the target-defender team is proposed. It contains a combined performance index penalizing the miss distance relative to the target and energy consumption in the whole duration. Besides, the specific miss distance related to the defender is regarded as an inequality constraint. An analytical solution for the smart guidance strategy against the APN guided defender is derived. Meanwhile, the control saturations are introduced to get more realistic and reasonable insights to this practical target-missile-defender problem. A simple but effective iterative searching technique is proposed to determine the saturation time points. The solution provides an optimal homing strategy to evade the defender with a specific miss distance and intercept the target with the minimum miss distance in the minimum energy manner. Nonlinear two-dimensional simulation results are used to validate the theoretical analysis. By comparison with the optimal differential game guidance(ODGG) and the combined minimum effort guidance(CMEG), the superiority of this smart guidance strategy is concluded.
基金National Natural Science Foundation of China (Grant No. 11771275).
文摘In this paper, we consider the problem of finding sparse solutions for underdetermined systems of linear equations, which can be formulated as a class of L0 norm minimization problem. By using the least absolute residual approximation, we propose a new piecewis, quadratic function to approximate the L0 norm.Then, we develop a piecewise quadratic approximation(PQA) model where the objective function is given by the summation of a smooth non-convex component and a non-smooth convex component. To solve the(PQA) model,we present an algorithm based on the idea of the iterative thresholding algorithm and derive the convergence and the convergence rate. Finally, we carry out a series of numerical experiments to demonstrate the performance of the proposed algorithm for(PQA). We also conduct a phase diagram analysis to further show the superiority of(PQA) over L1 and L1/2 regularizations.
基金the National Natural Science Foundation of China under Grant No. 61672304Qiqihar Science and Technology Industrial Projects under Grant No. GYGG-201620and the Fundamental Research Funds in Heilongjiang Provincial Universities under Grant Nos. 135109240 and 135209527.
文摘For a class of discrete switched systems with unknown input, an unknown input observer design method is proposed under the premise of changes along time axis but no changes along iteration axis. This method applies the iterative learning control thought to the design of unknown input observer, construets the unknown input observer by introducing virtual input signal, and uses the error signal generated from the actual system output and the observer output to correct repetitively the virtual input, which gradually approxima tes the actual unknown input as the it erations increase. Moreover, the convergence of the observer is strictly proved based on contraction mapping theory, as well as the convergence condition is given. The theoretical analysis indicates that designed unknown input observer can accurately estimate the state and unknown input of the system simultaneously. Simulation example further verifies the effectiveness of the proposed algorithm.
基金Supported by Defense Industrial Technology Development Program(JCKY2017602C016).
文摘Simple linear iterative cluster(SLIC) is widely used because controllable superpixel number, accurate edge covering, symmetrical production and fast speed of calculation. The main problem of the SLIC algorithm is its under-segmentation when applied to segment artificial structure images with unobvious boundaries and narrow regions. Therefore, an improved clustering segmentation algorithm to correct the segmentation results of SLIC is presented in this paper. The allocation of pixels is not only related to its own characteristic, but also to those of its surrounding pixels.Hence, it is appropriate to improve the standard SLIC through the pixels by focusing on boundaries. An improved SLIC method adheres better to the boundaries in the image is proposed, by using the first and second order difference operators as magnified factors. Experimental results demonstrate that the proposed method achieves an excellent boundary adherence for artificial structure images. The application of the proposed method is extended to images with an unobvious boundary in the Berkeley Segmentation Dataset BSDS500. In comparison with SLIC, the boundary adherence is increased obviously.
基金the National Natural Science Foundation of China under Grant Nos.11771458,431015 and 61628203the National Science Foundation of US under Grant Nos.DMS-1620345 and DMS-1830225+3 种基金the Office of Naval Research(ONR)Award of US under Grant No.N00014-18-1-2852the Guangdong Youth Innovation Talent Project(Natural Sciences)under Grant No.2017KQNCX083the Guangdong Philosophy and Social Science Project of China under Grant No.GD15CGL11the Guangzhou Science and Technology Project of China under Grant No.201707010495.
文摘Predicting the future information and recovering the missing data for time series are two vital tasks faced in various application fields.They are often subjected to big challenges,especially when the signal is nonlinear and nonstationary which is common in practice.In this paper,we propose a hybrid 2-stage approach,named IF2FNN,to predict(including short-term and long-term predictions)and recover the general types of time series.In the first stage,we decompose the original non-stationary series into several“quasi stationary”intrinsic mode functions(IMFs)by the iterative filtering(IF)method.In the second stage,all of the IMFs are fed as the inputs to the factorization machine based neural network model to perform the prediction and recovery.We test the strategy on five datasets including an artificial constructed signal(ACS),and four real-world signals:the length of day(LOD),the northern hemisphere land-ocean temperature index(NHLTI),the troposphere monthly mean temperature(TMMT),and the national association of securities dealers automated quotations index(NASDAQ).The results are compared with those obtained from the other prevailing methods.Our experiments indicate that under the same conditions,the proposed method outperforms the others for prediction and recovery according to various metrics such as mean absolute error(MAE),root mean square error(RMSE),and mean absolute percentage error(MAPE).
基金supported by Korea Institute of Geoscience and Mineral Resources(Project No.GP2017-024)Ministry of Trade and Industry [Project No.NP2017-021(20172510102090)]funded by National Research Foundation of Korea(NRF)Grants(Nos.NRF-2017R1C1B5017767,NRF-2017K2A9A1A01092734).
文摘Most inverse reservoir modeling techniques require many forward simulations, and the posterior models cannot preserve geological features of prior models. This study proposes an iterative static modeling approach that utilizes dynamic data for rejecting an unsuitable training image (TI) among a set of TI candidates and for synthesizing history-matched pseudo-soft data. The proposed method is applied to two cases of channelized reservoirs, which have uncertainty in channel geometry such as direction, amplitude, and width. Distance-based clustering is applied to the initial models in total to select the qualified models efficiently. The mean of the qualified models is employed as a history-matched facies probability map in the next iteration of static models. Also, the most plausible TI is determined among TI candidates by rejecting other TIs during the iteration. The posterior models of the proposed method outperform updated models of ensemble Kalman filter (EnKF) and ensemble smoother (ES) because they describe the true facies connectivity with bimodal distribution and predict oil and water production with a reasonable range of uncertainty. In terms of simulation time, it requires 30 times of forward simulation in history matching, while the EnKF and ES need 9000 times and 200 times, respectively.
基金supported by National Natural Science Foundation of China(Grant Nos.61572292,6160227,61672187)NSFC Joint Fund with Guangdong(Grant No.U1609218)Shandong Provincial Key Research and Development Project(Grant No.2018GGX103038).
文摘We propose a novel method for vector sketch simplification based on the simplification of the geometric structure that is extracted from the input vector graph, which can be referred to as a base complex.Unlike the sets of strokes, which are treated in the existing approaches, a base complex is considered to be a collection of various geometric primitives. Guided by the shape similarity metrics that are defined for the base complex, an agglomeration procedure is proposed to simplify the base complex by iteratively merging a pair of geometric primitives that exhibit the minimum cost into a new one. This simplified base complex is finally converted into a simplified vector graph. Our algorithm is computationally efficient and is able to retain a large amount of useful shape information from the original vector graph, thereby achieving a tradeoff between efficiency and geometric fidelity. Furthermore, the level of simplification of the input vector graph can be easily controlled using a single threshold in our method. We make comparisons with some existing methods using the datasets that have been provided in the corresponding studies as well as using different styles of sketches drawn by artists. Thus, our experiments demonstrate the computational efficiency of our method and its capability for producing the desirable results.
基金National Natural Science Foundation of China (Nos. 61803370, 61622309)the China Postdoctoral Science Foundation (No. 2018M630216)the National Key Research and Development Program of China (No. 2016YFB0901902).
文摘This paper summarizes the parameter estimation of systems with set-valued signals, which can be classified to three catalogs: one-time completed algorithms, iterative methods and recursive algorithms. For one-time completed algorithms, empirical measure method is one of the earliest methods to estimate parameters by using set-valued signals, which has been applied to the adaptive tracking of periodic target signals. The iterative methods seek numerical solutions of the maximum likelihood estimation, which have been applied to both complex diseases diagnosis and radar target recognition. The recursive algorithms are constructed via stochastic approximation and stochastic gradient methods, which have been applied to adaptive tracking of non-periodic signals.
基金the National Natural Science Foundation of China (No.61303192).
文摘The centroid location of a near infrared star always deviates from the real center due to the effects of surrounding radiation. To determine a more accurate center of a near infrared star, this paper proposes a method to detect the star’s saliency area and calculate the star’s centroid via the pixels only in this area, which can greatly decrease the effect of the radiation. During saliency area detection, we calculated the boundary connectivity and gray similarity of every pixel to estimate how likely it was to be a background pixel. Aiming to simplify and speed up the calculation process, we divided the near infrared starry sky image into super pixel maps at multi-scale by Simple Linear Iterative Clustering(SLIC). Second, we detected the saliency map for every super pixel map of the image. Finally, we fused the saliency maps according to a weighted coefficient that is determined by the least square method. For the images used in our experiment, we set the multi-scale super pixel numbers to 100, 150,and 200. The results show that our method can obtain an offset variance of less than 0.27 for the center coordinates compared to the labelled centers.
基金Hebei Provincial Natural Science Foundation of in China(Grant Nos.E2015203244,E2016203266)Program for the Youth Top-notch Talents of Hebei Province.
文摘In order to solve the springback problem in sheet metal forming, the trial and error method is a widely used method in the factory, which is time-consuming and costly for its non-direction and non-quantitative. Finite element simulation is an e ective method to predict the springback of complex shape parts, but its precision is sensitive to the simulation model, particularly material model and boundary conditions. In this paper, the simple iterative method is introduced to establish the iterative compensation algorithm, and the convergence criterion of iterative parameters is put forward. In addition, the new algorithm is applied to the V-free bending and stretch-bending processes, and the convergence of curvature and bending angle is proved theoretically and verified experimentally. At the same time,the iterative compensation experiments for plane bending show that, the new method can predict the next compensaantido tnh ev atlaureg ebta cseurdv oatnu trhe ew sitphri tnhgeb earcrko ro fo fe laecshs ttehsat,n s0 o. 5 th%a ta rteh eo btatraigneet db aefntedri n2 g-3 a nitgelrea tiwoitnhs.t Thhei se rrreosre aorf clhe sps rtohpaons e±s 0 a.1%new iterative compensation algorithm to predict springback in sheet metal forming process, where each compensation value depends only on the iteration parameter di erence before and after springback for the same forming process of same material.