An ε-subgradient projection algorithm for solving a convex feasibility problem is presented.Based on the iterative projection methods and the notion of ε-subgradient,a series of special projection hyperplanes is est...An ε-subgradient projection algorithm for solving a convex feasibility problem is presented.Based on the iterative projection methods and the notion of ε-subgradient,a series of special projection hyperplanes is established.Moreover,compared with the existing projection hyperplanes methods with subgradient,the proposed hyperplanes are interactive with ε,and their ranges are more larger.The convergence of the proposed algorithm is given under some mild conditions,and the validity of the algorithm is proved by the numerical test.展开更多
This paper analyzes and dissertates the discrete wavelet transform and improved projection algorithm in four kernel stages （image preprocessing, license plate localization, character segmentation, license plate recog...This paper analyzes and dissertates the discrete wavelet transform and improved projection algorithm in four kernel stages （image preprocessing, license plate localization, character segmentation, license plate recognition, i.e.） of license plate recognition system in detail. At last, it gives some conclusions and suggestions on future research.展开更多
In this paper, we propose two hybrid inertial CQ projection algorithms with linesearch process for the split feasibility problem. Based on the hybrid CQ projection algorithm, we firstly add the inertial term into the ...In this paper, we propose two hybrid inertial CQ projection algorithms with linesearch process for the split feasibility problem. Based on the hybrid CQ projection algorithm, we firstly add the inertial term into the iteration to accelerate the convergence of the algorithm, and adopt flexible rules for selecting the stepsize and the shrinking projection region, which makes an optimal stepsize available at each iteration. The shrinking projection region is the intersection of three sets, which are the set C and two hyperplanes. Furthermore, we modify the Armijo-type line-search step in the presented algorithm to get a new algorithm.The algorithms are shown to be convergent under certain mild assumptions. Besides, numerical examples are given to show that the proposed algorithms have better performance than the general CQ algorithm.展开更多
Based on the fabricated 12-element cavity-backed microstrip sector cylinder array,a novel hybrid alternate projection algorithm（HAPA）,which combines analytical method with numerical techniques effectively,is propose...Based on the fabricated 12-element cavity-backed microstrip sector cylinder array,a novel hybrid alternate projection algorithm（HAPA）,which combines analytical method with numerical techniques effectively,is proposed for synthesizing the pattern of practical conformal array.The algorithm applies the variable direction aperture projection method with mutual coupling correction techniques to provide the good initial excitations of elements to the enhanced alternate projection algorithm（EAPA）.In order to do further optimization,which improves the convergent speed of the algorithm significantly.Finally,the HAPA has been applied to the fabricated sector cylinder array with mutual coupling considered.The results of synthesized patterns,such as low sidelobe with null points formed pattern,beam scanning with low sidelobe pattern and the shaped beam pattern are presented.It demonstrates the validity of HAPA in practical conformal array synthesis.展开更多
Aimed at the problem of adaptive noise canceling(ANC),three implementary algorithms which are least mean square(LMS) algorithm,recursive least square(RLS) algorithm and fast affine projection(FAP) algorithm,have been ...Aimed at the problem of adaptive noise canceling(ANC),three implementary algorithms which are least mean square(LMS) algorithm,recursive least square(RLS) algorithm and fast affine projection(FAP) algorithm,have been researched.The simulations were made for the performance of these algorithms.The extraction of fetal electrocardiogram(FECG) is applied to compare the application effect of the above algorithms.The proposed FAP algorithm has obvious advantages in computational complexity,convergence speed and steadystate error.展开更多
Conditional nonlinear optimal perturbation(CNOP) is an extension of the linear singular vector technique in the nonlinear regime.It represents the initial perturbation that is subjected to a given physical constraint,...Conditional nonlinear optimal perturbation(CNOP) is an extension of the linear singular vector technique in the nonlinear regime.It represents the initial perturbation that is subjected to a given physical constraint,and results in the largest nonlinear evolution at the prediction time.CNOP-type errors play an important role in the predictability of weather and climate.Generally,when calculating CNOP in a complicated numerical model,we need the gradient of the objective function with respect to the initial perturbations to provide the descent direction for searching the phase space.The adjoint technique is widely used to calculate the gradient of the objective function.However,it is difficult and cumbersome to construct the adjoint model of a complicated numerical model,which imposes a limitation on the application of CNOP.Based on previous research,this study proposes a new ensemble projection algorithm based on singular vector decomposition(SVD).The new algorithm avoids the localization procedure of previous ensemble projection algorithms,and overcomes the uncertainty caused by choosing the localization radius empirically.The new algorithm is applied to calculate the CNOP in an intermediate forecasting model.The results show that the CNOP obtained by the new ensemble-based algorithm can effectively approximate that calculated by the adjoint algorithm,and retains the general spatial characteristics of the latter.Hence,the new SVD-based ensemble projection algorithm proposed in this study is an effective method of approximating the CNOP.展开更多
The existing methods of projection for solving convex feasibility problem may lead to slow conver- gence when the sequences enter some narrow＂corridor＂ between two or more convex sets. In this paper, we apply a tech...The existing methods of projection for solving convex feasibility problem may lead to slow conver- gence when the sequences enter some narrow＂corridor＂ between two or more convex sets. In this paper, we apply a technique that may interrupt the monotonity of the constructed sequence to the sequential subgradient pro- jection algorithm to construct a nommonotonous sequential subgradient projection algorithm for solving convex feasibility problem, which can leave such corridor by taking a big step at different steps during the iteration. Under some suitable conditions, the convergence is proved.We also compare the numerical performance of the proposed algorithm with that of the monotonous algorithm by numerical experiments.展开更多
Spectroscopy can be used for detecting crop characteristics. A goal of crop spectrum analysis is to extract effective features from spectral data for establishing a detection model. An ideal spectral feature set shoul...Spectroscopy can be used for detecting crop characteristics. A goal of crop spectrum analysis is to extract effective features from spectral data for establishing a detection model. An ideal spectral feature set should have high sensitivity to target parameters but low information redundancy among features.However, feature-selection methods that satisfy both requirements are lacking. To address this issue,in this study, a novel method, the continuous wavelet projections algorithm(CWPA), was developed,which has advantages of both continuous wavelet analysis(CWA) and the successive projections algorithm(SPA) for generating optimal spectral feature set for crop detection. Three datasets collected for crop stress detection and retrieval of biochemical properties were used to validate the CWPA under both classification and regression scenarios. The CWPA generated a feature set with fewer features yet achieving accuracy comparable to or even higher than those of CWA and SPA. With only two to three features identified by CWPA, an overall accuracy of 98% in classifying tea plant stresses was achieved, and high coefficients of determination were obtained in retrieving corn leaf chlorophyll content(R^(2)= 0.8521)and equivalent water thickness(R^(2)= 0.9508). The mechanism of the CWPA ensures that the novel algorithm discovers the most sensitive features while retaining complementarity among features. Its ability to reduce the data dimension suggests its potential for crop monitoring and phenotyping with hyperspectral data.展开更多
In this paper,a zero-sum game Nash equilibrium computation problem with a common constraint set is investigated under two time-varying multi-agent subnetworks,where the two subnetworks have opposite payoff function.A ...In this paper,a zero-sum game Nash equilibrium computation problem with a common constraint set is investigated under two time-varying multi-agent subnetworks,where the two subnetworks have opposite payoff function.A novel distributed projection subgradient algorithm with random sleep scheme is developed to reduce the calculation amount of agents in the process of computing Nash equilibrium.In our algorithm,each agent is determined by an independent identically distributed Bernoulli decision to compute the subgradient and perform the projection operation or to keep the previous consensus estimate,it effectively reduces the amount of computation and calculation time.Moreover,the traditional assumption of stepsize adopted in the existing methods is removed,and the stepsizes in our algorithm are randomized diminishing.Besides,we prove that all agents converge to Nash equilibrium with probability 1 by our algorithm.Finally,a simulation example verifies the validity of our algorithm.展开更多
A new beam broadening synthesis technique for Synthetic Aperture Radar(SAR) antenna array, namely Projection Matrix Algorithm(PMA) is presented. The theory of PMA is introduced firstly, and then the iterative renewed ...A new beam broadening synthesis technique for Synthetic Aperture Radar(SAR) antenna array, namely Projection Matrix Algorithm(PMA) is presented. The theory of PMA is introduced firstly, and then the iterative renewed manner is improved to resolve the unbalance problem under amplitude and phase control. In order to validate the algorithm correct and effective, an actual engineering application example is investigated. The beam synthesis results of 1.0~4.5 times broadening under the phase only control and the amplitude and phase control using improved PMA are given. The results show that the beam directivity, the beam broadening, and the side-lobe level requirements were met. It is demonstrated that the improved PMA was effective and feasible for SAR application.展开更多
Plant diseases are a major threat that can severely impact the production of agriculture and forestry.This can lead to the disruption of ecosystem functions and health.With its ability to capture continuous narrow-ban...Plant diseases are a major threat that can severely impact the production of agriculture and forestry.This can lead to the disruption of ecosystem functions and health.With its ability to capture continuous narrow-band spectra,hyperspectral technology has become a crucial tool to monitor crop diseases using remote sensing.However,existing continuous wavelet analysis(CWA)methods suffer from feature redundancy issues,while the continuous wavelet projection algorithm(CWPA),an optimization approach for feature selection,has not been fully validated to monitor plant diseases.This study utilized rice bacterial leaf blight(BLB)as an example by evaluating the performance of four wavelet basis functions-Gaussian2,Mexican hat,Meyer,andMorlet-within theCWAandCWPAframeworks.Additionally,the classification models were constructed using the k-nearest neighbors(KNN),randomforest(RF),and Naïve Bayes(NB)algorithms.The results showed the following:(1)Compared to traditional CWA,CWPA significantly reduced the number of required features.Under the CWPA framework,almost all the model combinations achieved maximum classification accuracy with only one feature.In contrast,the CWA framework required three to seven features.(2)Thechoice of wavelet basis functions markedly affected the performance of themodel.Of the four functions tested,the Meyer wavelet demonstrated the best overall performance in both the CWPA and CWA frameworks.(3)Under theCWPAframework,theMeyer-KNNandMeyer-NBcombinations achieved the highest overall accuracy of 93.75%using just one feature.In contrast,under the CWA framework,the CWA-RF combination achieved comparable accuracy(93.75%)but required six features.This study verified the technical advantages of CWPA for monitoring crop diseases,identified an optimal wavelet basis function selection scheme,and provided reliable technical support to precisely monitor BLB in rice(Oryza sativa).Moreover,the proposed methodological framework offers a scalable approach for the early diagnosis and assessment of plant stress,which can contribute to improved accuracy and timeliness when plant stress is monitored.展开更多
In this study,eight different varieties of maize seeds were used as the research objects.Conduct 81 types of combined preprocessing on the original spectra.Through comparison,Savitzky-Golay(SG)-multivariate scattering...In this study,eight different varieties of maize seeds were used as the research objects.Conduct 81 types of combined preprocessing on the original spectra.Through comparison,Savitzky-Golay(SG)-multivariate scattering correction(MSC)-maximum-minimum normalization(MN)was identified as the optimal preprocessing technique.The competitive adaptive reweighted sampling(CARS),successive projections algorithm(SPA),and their combined methods were employed to extract feature wavelengths.Classification models based on back propagation(BP),support vector machine(SVM),random forest(RF),and partial least squares(PLS)were established using full-band data and feature wavelengths.Among all models,the(CARS-SPA)-BP model achieved the highest accuracy rate of 98.44%.This study offers novel insights and methodologies for the rapid and accurate identification of corn seeds as well as other crop seeds.展开更多
A real-time electronic image stabilization motion estimation method based on fast sub- block gray projection algorithm is proposed. In the method, each image is divided into a number of sub-blocks, and sub-blocks are ...A real-time electronic image stabilization motion estimation method based on fast sub- block gray projection algorithm is proposed. In the method, each image is divided into a number of sub-blocks, and sub-blocks are sifted with their gray gradients. After removing sub-blocks whose gray gradients are lower than the given threshold, the calculation amount of projection is reduced and the motion estimation accuracy is improved. Then gray projection is done in each remained sub- block, and global motion vector of the image is calculated according to the local motion vectors of sub-blocks and the affine motion model. The drawbacks as the local motions reducing the global mo- tion estimation accuracy and traditional gray projection algorithm could not deal with rotation are re- solved well by this algorithm. The experiment results show that the algorithm is more accurate and efficient than the gray projection algorithm.展开更多
Dykstra’s alternating projection algorithm was proposed to treat the problem of finding the projection of a given point onto the intersection of some closed convex sets. In this paper, we first apply Dykstra’s alter...Dykstra’s alternating projection algorithm was proposed to treat the problem of finding the projection of a given point onto the intersection of some closed convex sets. In this paper, we first apply Dykstra’s alternating projection algorithm to compute the optimal approximate symmetric positive semidefinite solution of the matrix equations AXB = E, CXD = F. If we choose the initial iterative matrix X<sub>0</sub> = 0, the least Frobenius norm symmetric positive semidefinite solution of these matrix equations is obtained. A numerical example shows that the new algorithm is feasible and effective.展开更多
Improving numerical forecasting skill in the atmospheric and oceanic sciences by solving optimization problems is an important issue. One such method is to compute the conditional nonlinear optimal perturbation(CNOP),...Improving numerical forecasting skill in the atmospheric and oceanic sciences by solving optimization problems is an important issue. One such method is to compute the conditional nonlinear optimal perturbation(CNOP), which has been applied widely in predictability studies. In this study, the Differential Evolution(DE) algorithm, which is a derivative-free algorithm and has been applied to obtain CNOPs for exploring the uncertainty of terrestrial ecosystem processes, was employed to obtain the CNOPs for finite-dimensional optimization problems with ball constraint conditions using Burgers' equation. The aim was first to test if the CNOP calculated by the DE algorithm is similar to that computed by traditional optimization algorithms, such as the Spectral Projected Gradient(SPG2) algorithm. The second motive was to supply a possible route through which the CNOP approach can be applied in predictability studies in the atmospheric and oceanic sciences without obtaining a model adjoint system, or for optimization problems with non-differentiable cost functions. A projection skill was first explanted to the DE algorithm to calculate the CNOPs. To validate the algorithm, the SPG2 algorithm was also applied to obtain the CNOPs for the same optimization problems. The results showed that the CNOPs obtained by the DE algorithm were nearly the same as those obtained by the SPG2 algorithm in terms of their spatial distributions and nonlinear evolutions. The implication is that the DE algorithm could be employed to calculate the optimal values of optimization problems, especially for non-differentiable and nonlinear optimization problems associated with the atmospheric and oceanic sciences.展开更多
This paper develops a new algorithm based on the Projected Gradient Algorithm (PGA) for the design of FIR digital filters with "sum of power of two" coefficients. It is shown that the integer programming inv...This paper develops a new algorithm based on the Projected Gradient Algorithm (PGA) for the design of FIR digital filters with "sum of power of two" coefficients. It is shown that the integer programming involved in the FIR filter design can be solved by this algorithm. It is compared with the reported method for a SemiDefinite Programming (SDP) relaxation- based design. The simulations demonstrate that the new algorithm often yields the similar error performances of the FIR filter design, but the average CPU time of this approach is significantly reduced.展开更多
Because the conventional ultra wideband（UWB） radar imaging algorithm cannot meet the demand in the capability of multiple targets detection,a novel UWB radar imaging algorithm based on the near field radiation theor...Because the conventional ultra wideband（UWB） radar imaging algorithm cannot meet the demand in the capability of multiple targets detection,a novel UWB radar imaging algorithm based on the near field radiation theory of dipole is presented.On the foundation of researching the principle of a time domain imaging algorithm,the back projection（BP） algorithm is derived and analyzed.Firstly,the far field sampling data are transferred to the near field sampling data by using the near field radiation theory of dipole.Then the BP algorithm is applied to target detection.The capability of the new algorithm to detect the multi-target is verified by using the finite-difference time-domain method,and the threedimensional images of targets are obtained.The coupling effect between targets for imaging is analyzed.The simulation results show that the new UWB radar imaging algorithm based on the near field radiation theory of dipole could weaken the coupling effect for imaging,and as a result the quality of imaging is improved.展开更多
For industrial computed tomography systems, generation II scan mode has a large field of view but time consuming and generation III has a small field of view but fast. In order to realize the rapid ICT test of large ...For industrial computed tomography systems, generation II scan mode has a large field of view but time consuming and generation III has a small field of view but fast. In order to realize the rapid ICT test of large objects, a scan mode based on generation III called large field of view scan was discussed and its reconstruction algorithm based on FBP was deduced. The validity of the algorithm was verified by the results of computer simulation and experiments. Analysis showed that the effective scan field of view could be improved by more than 90% compared with that of generation III.展开更多
Congestion pricing is an important component of urban intelligent transport system.The efficiency,equity and the environmental impacts associated with road pricing schemes are key issues that should be considered befo...Congestion pricing is an important component of urban intelligent transport system.The efficiency,equity and the environmental impacts associated with road pricing schemes are key issues that should be considered before such schemes are implemented.This paper focuses on the cordon-based pricing with distance tolls,where the tolls are determined by a nonlinear function of a vehicles' travel distance within a cordon,termed as toll charge function.The optimal tolls can give rise to:1) higher total social benefits,2) better levels of equity,and 3) reduced environmental impacts(e.g.,less emission).Firstly,a deterministic equilibrium(DUE) model with elastic demand is presented to evaluate any given toll charge function.The distance tolls are non-additive,thus a modified path-based gradient projection algorithm is developed to solve the DUE model.Then,to quantitatively measure the equity level of each toll charge function,the Gini coefficient is adopted to measure the equity level of the flows in the entire transport network based on equilibrium flows.The total emission level is used to reflect the impacts of distance tolls on the environment.With these two indexes/measurements for the efficiency,equity and environmental issues as well as the DUE model,a multi-objective bi-level programming model is then developed to determine optimal distance tolls.The multi-objective model is converted to a single level model using the goal programming.A genetic algorithm(GA) is adopted to determine solutions.Finally,a numerical example is presented to verify the methodology.展开更多
A new method in digital hearing aids to adaptively localize the speech source in noise and reverberant environment is proposed. Based on the room reverberant model and the multichannel adaptive eigenvalue decompositi...A new method in digital hearing aids to adaptively localize the speech source in noise and reverberant environment is proposed. Based on the room reverberant model and the multichannel adaptive eigenvalue decomposition （MCAED） algorithm, the proposed method can iteratively estimate impulse response coefficients between the speech source and microphones by the adaptive subgradient projection method. Then, it acquires the time delays of microphone pairs, and calculates the source position by the geometric method. Compared with the traditional normal least mean square （NLMS） algorithm, the adaptive subgradient projection method achieves faster and more accurate convergence in a low signal-to-noise ratio （SNR） environment. Simulations for glasses digital hearing aids with four-component square array demonstrate the robust performance of the proposed method.展开更多
基金supported by the National Natural Science Foundation of China (10671126)Shanghai Leading Academic Discipline Project(S30501)
文摘An ε-subgradient projection algorithm for solving a convex feasibility problem is presented.Based on the iterative projection methods and the notion of ε-subgradient,a series of special projection hyperplanes is established.Moreover,compared with the existing projection hyperplanes methods with subgradient,the proposed hyperplanes are interactive with ε,and their ranges are more larger.The convergence of the proposed algorithm is given under some mild conditions,and the validity of the algorithm is proved by the numerical test.
文摘This paper analyzes and dissertates the discrete wavelet transform and improved projection algorithm in four kernel stages （image preprocessing, license plate localization, character segmentation, license plate recognition, i.e.） of license plate recognition system in detail. At last, it gives some conclusions and suggestions on future research.
基金Supported by the National Natural Science Foundation of China(72071130)。
文摘In this paper, we propose two hybrid inertial CQ projection algorithms with linesearch process for the split feasibility problem. Based on the hybrid CQ projection algorithm, we firstly add the inertial term into the iteration to accelerate the convergence of the algorithm, and adopt flexible rules for selecting the stepsize and the shrinking projection region, which makes an optimal stepsize available at each iteration. The shrinking projection region is the intersection of three sets, which are the set C and two hyperplanes. Furthermore, we modify the Armijo-type line-search step in the presented algorithm to get a new algorithm.The algorithms are shown to be convergent under certain mild assumptions. Besides, numerical examples are given to show that the proposed algorithms have better performance than the general CQ algorithm.
文摘Based on the fabricated 12-element cavity-backed microstrip sector cylinder array,a novel hybrid alternate projection algorithm（HAPA）,which combines analytical method with numerical techniques effectively,is proposed for synthesizing the pattern of practical conformal array.The algorithm applies the variable direction aperture projection method with mutual coupling correction techniques to provide the good initial excitations of elements to the enhanced alternate projection algorithm（EAPA）.In order to do further optimization,which improves the convergent speed of the algorithm significantly.Finally,the HAPA has been applied to the fabricated sector cylinder array with mutual coupling considered.The results of synthesized patterns,such as low sidelobe with null points formed pattern,beam scanning with low sidelobe pattern and the shaped beam pattern are presented.It demonstrates the validity of HAPA in practical conformal array synthesis.
基金the National Key Technologies R&D Program (No. 2006BAI22B01)
文摘Aimed at the problem of adaptive noise canceling(ANC),three implementary algorithms which are least mean square(LMS) algorithm,recursive least square(RLS) algorithm and fast affine projection(FAP) algorithm,have been researched.The simulations were made for the performance of these algorithms.The extraction of fetal electrocardiogram(FECG) is applied to compare the application effect of the above algorithms.The proposed FAP algorithm has obvious advantages in computational complexity,convergence speed and steadystate error.
基金jointly sponsored by the National Natural Science Foundation of China(Grant Nos.41176013,41230420 and 41006007)
文摘Conditional nonlinear optimal perturbation(CNOP) is an extension of the linear singular vector technique in the nonlinear regime.It represents the initial perturbation that is subjected to a given physical constraint,and results in the largest nonlinear evolution at the prediction time.CNOP-type errors play an important role in the predictability of weather and climate.Generally,when calculating CNOP in a complicated numerical model,we need the gradient of the objective function with respect to the initial perturbations to provide the descent direction for searching the phase space.The adjoint technique is widely used to calculate the gradient of the objective function.However,it is difficult and cumbersome to construct the adjoint model of a complicated numerical model,which imposes a limitation on the application of CNOP.Based on previous research,this study proposes a new ensemble projection algorithm based on singular vector decomposition(SVD).The new algorithm avoids the localization procedure of previous ensemble projection algorithms,and overcomes the uncertainty caused by choosing the localization radius empirically.The new algorithm is applied to calculate the CNOP in an intermediate forecasting model.The results show that the CNOP obtained by the new ensemble-based algorithm can effectively approximate that calculated by the adjoint algorithm,and retains the general spatial characteristics of the latter.Hence,the new SVD-based ensemble projection algorithm proposed in this study is an effective method of approximating the CNOP.
基金Supported by the National Science Foundation of China(No.11171221)Natural Science Foundation of Shanghai(14ZR1429200)+2 种基金Innovation Program of Shanghai Municipal Education Commission(15ZZ074)Henan Province fundation frontier projec(No.162300410226)Key Scientific research projectins of Henan Province(NO.17b120001)
文摘The existing methods of projection for solving convex feasibility problem may lead to slow conver- gence when the sequences enter some narrow＂corridor＂ between two or more convex sets. In this paper, we apply a technique that may interrupt the monotonity of the constructed sequence to the sequential subgradient pro- jection algorithm to construct a nommonotonous sequential subgradient projection algorithm for solving convex feasibility problem, which can leave such corridor by taking a big step at different steps during the iteration. Under some suitable conditions, the convergence is proved.We also compare the numerical performance of the proposed algorithm with that of the monotonous algorithm by numerical experiments.
基金supported by the National Natural Science Foundation of China (42071420)the Major Special Project for 2025 Scientific,Technological Innovation (Major Scientific and Technological Task Project in Ningbo City)(2021Z048)the National Key Research and Development Program of China(2019YFE0125300)。
文摘Spectroscopy can be used for detecting crop characteristics. A goal of crop spectrum analysis is to extract effective features from spectral data for establishing a detection model. An ideal spectral feature set should have high sensitivity to target parameters but low information redundancy among features.However, feature-selection methods that satisfy both requirements are lacking. To address this issue,in this study, a novel method, the continuous wavelet projections algorithm(CWPA), was developed,which has advantages of both continuous wavelet analysis(CWA) and the successive projections algorithm(SPA) for generating optimal spectral feature set for crop detection. Three datasets collected for crop stress detection and retrieval of biochemical properties were used to validate the CWPA under both classification and regression scenarios. The CWPA generated a feature set with fewer features yet achieving accuracy comparable to or even higher than those of CWA and SPA. With only two to three features identified by CWPA, an overall accuracy of 98% in classifying tea plant stresses was achieved, and high coefficients of determination were obtained in retrieving corn leaf chlorophyll content(R^(2)= 0.8521)and equivalent water thickness(R^(2)= 0.9508). The mechanism of the CWPA ensures that the novel algorithm discovers the most sensitive features while retaining complementarity among features. Its ability to reduce the data dimension suggests its potential for crop monitoring and phenotyping with hyperspectral data.
文摘In this paper,a zero-sum game Nash equilibrium computation problem with a common constraint set is investigated under two time-varying multi-agent subnetworks,where the two subnetworks have opposite payoff function.A novel distributed projection subgradient algorithm with random sleep scheme is developed to reduce the calculation amount of agents in the process of computing Nash equilibrium.In our algorithm,each agent is determined by an independent identically distributed Bernoulli decision to compute the subgradient and perform the projection operation or to keep the previous consensus estimate,it effectively reduces the amount of computation and calculation time.Moreover,the traditional assumption of stepsize adopted in the existing methods is removed,and the stepsizes in our algorithm are randomized diminishing.Besides,we prove that all agents converge to Nash equilibrium with probability 1 by our algorithm.Finally,a simulation example verifies the validity of our algorithm.
文摘A new beam broadening synthesis technique for Synthetic Aperture Radar(SAR) antenna array, namely Projection Matrix Algorithm(PMA) is presented. The theory of PMA is introduced firstly, and then the iterative renewed manner is improved to resolve the unbalance problem under amplitude and phase control. In order to validate the algorithm correct and effective, an actual engineering application example is investigated. The beam synthesis results of 1.0~4.5 times broadening under the phase only control and the amplitude and phase control using improved PMA are given. The results show that the beam directivity, the beam broadening, and the side-lobe level requirements were met. It is demonstrated that the improved PMA was effective and feasible for SAR application.
基金supported by the‘Pioneer’and‘Leading Goose’R&D Program of Zhejiang(Grant No.2023C02018)Zhejiang Provincial Natural Science Foundation of China(Grant No.LTGN23D010002)+2 种基金National Natural Science Foundation of China(Grant No.42371385)Funds of the Natural Science Foundation of Hangzhou(Grant No.2024SZRYBD010001)Nanxun Scholars Program of ZJWEU(Grant No.RC2022010755).
文摘Plant diseases are a major threat that can severely impact the production of agriculture and forestry.This can lead to the disruption of ecosystem functions and health.With its ability to capture continuous narrow-band spectra,hyperspectral technology has become a crucial tool to monitor crop diseases using remote sensing.However,existing continuous wavelet analysis(CWA)methods suffer from feature redundancy issues,while the continuous wavelet projection algorithm(CWPA),an optimization approach for feature selection,has not been fully validated to monitor plant diseases.This study utilized rice bacterial leaf blight(BLB)as an example by evaluating the performance of four wavelet basis functions-Gaussian2,Mexican hat,Meyer,andMorlet-within theCWAandCWPAframeworks.Additionally,the classification models were constructed using the k-nearest neighbors(KNN),randomforest(RF),and Naïve Bayes(NB)algorithms.The results showed the following:(1)Compared to traditional CWA,CWPA significantly reduced the number of required features.Under the CWPA framework,almost all the model combinations achieved maximum classification accuracy with only one feature.In contrast,the CWA framework required three to seven features.(2)Thechoice of wavelet basis functions markedly affected the performance of themodel.Of the four functions tested,the Meyer wavelet demonstrated the best overall performance in both the CWPA and CWA frameworks.(3)Under theCWPAframework,theMeyer-KNNandMeyer-NBcombinations achieved the highest overall accuracy of 93.75%using just one feature.In contrast,under the CWA framework,the CWA-RF combination achieved comparable accuracy(93.75%)but required six features.This study verified the technical advantages of CWPA for monitoring crop diseases,identified an optimal wavelet basis function selection scheme,and provided reliable technical support to precisely monitor BLB in rice(Oryza sativa).Moreover,the proposed methodological framework offers a scalable approach for the early diagnosis and assessment of plant stress,which can contribute to improved accuracy and timeliness when plant stress is monitored.
基金supported by the Science and Technology Development Plan Project of Jilin Provincial Department of Science and Technology (No.20220203112S)the Jilin Provincial Department of Education Science and Technology Research Project (No.JJKH20210039KJ)。
文摘In this study,eight different varieties of maize seeds were used as the research objects.Conduct 81 types of combined preprocessing on the original spectra.Through comparison,Savitzky-Golay(SG)-multivariate scattering correction(MSC)-maximum-minimum normalization(MN)was identified as the optimal preprocessing technique.The competitive adaptive reweighted sampling(CARS),successive projections algorithm(SPA),and their combined methods were employed to extract feature wavelengths.Classification models based on back propagation(BP),support vector machine(SVM),random forest(RF),and partial least squares(PLS)were established using full-band data and feature wavelengths.Among all models,the(CARS-SPA)-BP model achieved the highest accuracy rate of 98.44%.This study offers novel insights and methodologies for the rapid and accurate identification of corn seeds as well as other crop seeds.
基金Supported by the National Defense Scientific Research Project （ B2220132013 ）
文摘A real-time electronic image stabilization motion estimation method based on fast sub- block gray projection algorithm is proposed. In the method, each image is divided into a number of sub-blocks, and sub-blocks are sifted with their gray gradients. After removing sub-blocks whose gray gradients are lower than the given threshold, the calculation amount of projection is reduced and the motion estimation accuracy is improved. Then gray projection is done in each remained sub- block, and global motion vector of the image is calculated according to the local motion vectors of sub-blocks and the affine motion model. The drawbacks as the local motions reducing the global mo- tion estimation accuracy and traditional gray projection algorithm could not deal with rotation are re- solved well by this algorithm. The experiment results show that the algorithm is more accurate and efficient than the gray projection algorithm.
文摘Dykstra’s alternating projection algorithm was proposed to treat the problem of finding the projection of a given point onto the intersection of some closed convex sets. In this paper, we first apply Dykstra’s alternating projection algorithm to compute the optimal approximate symmetric positive semidefinite solution of the matrix equations AXB = E, CXD = F. If we choose the initial iterative matrix X<sub>0</sub> = 0, the least Frobenius norm symmetric positive semidefinite solution of these matrix equations is obtained. A numerical example shows that the new algorithm is feasible and effective.
基金provided by grants from the LASG State Key Laboratory Special Fundthe National Natural Science Foundation of China (Grant Nos. 40905050, 40830955, and 41375111)
文摘Improving numerical forecasting skill in the atmospheric and oceanic sciences by solving optimization problems is an important issue. One such method is to compute the conditional nonlinear optimal perturbation(CNOP), which has been applied widely in predictability studies. In this study, the Differential Evolution(DE) algorithm, which is a derivative-free algorithm and has been applied to obtain CNOPs for exploring the uncertainty of terrestrial ecosystem processes, was employed to obtain the CNOPs for finite-dimensional optimization problems with ball constraint conditions using Burgers' equation. The aim was first to test if the CNOP calculated by the DE algorithm is similar to that computed by traditional optimization algorithms, such as the Spectral Projected Gradient(SPG2) algorithm. The second motive was to supply a possible route through which the CNOP approach can be applied in predictability studies in the atmospheric and oceanic sciences without obtaining a model adjoint system, or for optimization problems with non-differentiable cost functions. A projection skill was first explanted to the DE algorithm to calculate the CNOPs. To validate the algorithm, the SPG2 algorithm was also applied to obtain the CNOPs for the same optimization problems. The results showed that the CNOPs obtained by the DE algorithm were nearly the same as those obtained by the SPG2 algorithm in terms of their spatial distributions and nonlinear evolutions. The implication is that the DE algorithm could be employed to calculate the optimal values of optimization problems, especially for non-differentiable and nonlinear optimization problems associated with the atmospheric and oceanic sciences.
基金Supported by Shaanxi Province Natural Science Funds.
文摘This paper develops a new algorithm based on the Projected Gradient Algorithm (PGA) for the design of FIR digital filters with "sum of power of two" coefficients. It is shown that the integer programming involved in the FIR filter design can be solved by this algorithm. It is compared with the reported method for a SemiDefinite Programming (SDP) relaxation- based design. The simulations demonstrate that the new algorithm often yields the similar error performances of the FIR filter design, but the average CPU time of this approach is significantly reduced.
基金supported by the Key Laboratory of Millimeter Waves of China (K200907)
文摘Because the conventional ultra wideband（UWB） radar imaging algorithm cannot meet the demand in the capability of multiple targets detection,a novel UWB radar imaging algorithm based on the near field radiation theory of dipole is presented.On the foundation of researching the principle of a time domain imaging algorithm,the back projection（BP） algorithm is derived and analyzed.Firstly,the far field sampling data are transferred to the near field sampling data by using the near field radiation theory of dipole.Then the BP algorithm is applied to target detection.The capability of the new algorithm to detect the multi-target is verified by using the finite-difference time-domain method,and the threedimensional images of targets are obtained.The coupling effect between targets for imaging is analyzed.The simulation results show that the new UWB radar imaging algorithm based on the near field radiation theory of dipole could weaken the coupling effect for imaging,and as a result the quality of imaging is improved.
文摘For industrial computed tomography systems, generation II scan mode has a large field of view but time consuming and generation III has a small field of view but fast. In order to realize the rapid ICT test of large objects, a scan mode based on generation III called large field of view scan was discussed and its reconstruction algorithm based on FBP was deduced. The validity of the algorithm was verified by the results of computer simulation and experiments. Analysis showed that the effective scan field of view could be improved by more than 90% compared with that of generation III.
基金Projects (61304198,61374195) supported by the National Natural Science Foundation of ChinaProjects (2013M530159,2014T70351) supported by the China Postdoctoral Science Foundation
文摘Congestion pricing is an important component of urban intelligent transport system.The efficiency,equity and the environmental impacts associated with road pricing schemes are key issues that should be considered before such schemes are implemented.This paper focuses on the cordon-based pricing with distance tolls,where the tolls are determined by a nonlinear function of a vehicles' travel distance within a cordon,termed as toll charge function.The optimal tolls can give rise to:1) higher total social benefits,2) better levels of equity,and 3) reduced environmental impacts(e.g.,less emission).Firstly,a deterministic equilibrium(DUE) model with elastic demand is presented to evaluate any given toll charge function.The distance tolls are non-additive,thus a modified path-based gradient projection algorithm is developed to solve the DUE model.Then,to quantitatively measure the equity level of each toll charge function,the Gini coefficient is adopted to measure the equity level of the flows in the entire transport network based on equilibrium flows.The total emission level is used to reflect the impacts of distance tolls on the environment.With these two indexes/measurements for the efficiency,equity and environmental issues as well as the DUE model,a multi-objective bi-level programming model is then developed to determine optimal distance tolls.The multi-objective model is converted to a single level model using the goal programming.A genetic algorithm(GA) is adopted to determine solutions.Finally,a numerical example is presented to verify the methodology.
基金Supported by the National Natural Science Foundation of China (60872073)~~
文摘A new method in digital hearing aids to adaptively localize the speech source in noise and reverberant environment is proposed. Based on the room reverberant model and the multichannel adaptive eigenvalue decomposition （MCAED） algorithm, the proposed method can iteratively estimate impulse response coefficients between the speech source and microphones by the adaptive subgradient projection method. Then, it acquires the time delays of microphone pairs, and calculates the source position by the geometric method. Compared with the traditional normal least mean square （NLMS） algorithm, the adaptive subgradient projection method achieves faster and more accurate convergence in a low signal-to-noise ratio （SNR） environment. Simulations for glasses digital hearing aids with four-component square array demonstrate the robust performance of the proposed method.
