An anti-aliasing filtering of quantum images in spatial domain using a pyramid structure

As a part of quantum image processing,quantum image filtering is a crucial technology in the development of quantum computing.Low-pass filtering can effectively achieve anti-aliasing effects on images.Currently,most quantum image filterings are based on classical domains and grayscale images,and there are relatively fewer studies on anti-aliasing in the quantum domain.This paper proposes a scheme for anti-aliasing filtering based on quantum grayscale and color image scaling in the spatial domain.It achieves the effect of anti-aliasing filtering on quantum images during the scaling process.First,we use the novel enhanced quantum representation(NEQR)and the improved quantum representation of color images(INCQI)to represent classical images.Since aliasing phenomena are more pronounced when images are scaled down,this paper focuses only on the anti-aliasing effects in the case of reduction.Subsequently,we perform anti-aliasing filtering on the quantum representation of the original image and then use bilinear interpolation to scale down the image,achieving the anti-aliasing effect.The constructed pyramid model is then used to select an appropriate image for upscaling to the original image size.Finally,the complexity of the circuit is analyzed.Compared to the images experiencing aliasing effects solely due to scaling,applying anti-aliasing filtering to the images results in smoother and clearer outputs.Additionally,the anti-aliasing filtering allows for manual intervention to select the desired level of image smoothness.

Collaborative Filtering Algorithms Based on Kendall Correlation in Recommender Systems

In this work, Kendall correlation based collaborative filtering algorithms for the recommender systems are proposed. The Kendall correlation method is used to measure the correlation amongst users by means of considering the relative order of the users＇ ratings. Kendall based algorithm is based upon a more general model and thus could be more widely applied in e-commerce. Another discovery of this work is that the consideration of only positive correlated neighbors in prediction, in both Pearson and Kendall algorithms, achieves higher accuracy than the consideration of all neighbors, with only a small loss of coverage.

Vehicle recognition and tracking based on simulated annealing chaotic particle swarm optimization-Gauss particle filter algorithm

Target recognition and tracking is an important research filed in the surveillance industry.Traditional target recognition and tracking is to track moving objects, however, for the detected moving objects the specific content can not be determined.In this paper, a multi-target vehicle recognition and tracking algorithm based on YOLO v5 network architecture is proposed.The specific content of moving objects are identified by the network architecture, furthermore, the simulated annealing chaotic mechanism is embedded in particle swarm optimization-Gauss particle filter algorithm.The proposed simulated annealing chaotic particle swarm optimization-Gauss particle filter algorithm(SA-CPSO-GPF) is used to track moving objects.The experiment shows that the algorithm has a good tracking effect for the vehicle in the monitoring range.The root mean square error(RMSE), running time and accuracy of the proposed method are superior to traditional methods.The proposed algorithm has very good application value.

Design of weak current measurement system and research on temperature impact

A dedicated weak current measurement system was designed to measure the weak currents generated by the neutron ionization chamber.This system incorporates a second-order low-pass filter circuit and the Kalman filtering algorithm to effectively filter out noise and minimize interference in the measurement results.Testing conducted under normal temperature conditions has demonstrated the system's high precision performance.However,it was observed that temperature variations can affect the measurement performance.Data were collected across temperatures ranging from -20 to 70℃,and a temperature correction model was established through linear regression fitting to address this issue.The feasibility of the temperature correction model was confirmed at temperatures of -5 and 40℃,where relative errors remained below 0.1% after applying the temperature correction.The research indicates that the designed measurement system exhibits excellent temperature adaptability and high precision,making it particularly suitable for measuring weak currents.

Assimilation of Remote Sensing and Crop Model for LAI Estimation Based on Ensemble Kalman Filter

Data assimilation in agricultural remote sensing research is of great significance to integrate with remote sensing observations and model simulations for parameters estimation. The present investigation not only designed and realized the Ensemble Kalman Filtering algorithm （EnKF） assimilation by combing the crop growth model （CERES-Wheat） with remote sensing data, but also optimized and updated the key parameters （LAI） of winter wheat by using remote sensing data. Results showed that the assimilation LAI and the observation ones agreed with each other, and the R2 reached 0.8315. So assimilation remote sensing and crop model could provide reference data for the agricultural production.

A novel fast classification filtering algorithm for LiDAR point clouds based on small grid density clustering

Clustering filtering is usually a practical method for light detection and ranging(LiDAR)point clouds filtering according to their characteristic attributes.However,the amount of point cloud data is extremely large in practice,making it impossible to cluster point clouds data directly,and the filtering error is also too large.Moreover,many existing filtering algorithms have poor classification results in discontinuous terrain.This article proposes a new fast classification filtering algorithm based on density clustering,which can solve the problem of point clouds classification in discontinuous terrain.Based on the spatial density of LiDAR point clouds,also the features of the ground object point clouds and the terrain point clouds,the point clouds are clustered firstly by their elevations,and then the plane point clouds are selected.Thus the number of samples and feature dimensions of data are reduced.Using the DBSCAN clustering filtering method,the original point clouds are finally divided into noise point clouds,ground object point clouds,and terrain point clouds.The experiment uses 15 sets of data samples provided by the International Society for Photogrammetry and Remote Sensing(ISPRS),and the results of the proposed algorithm are compared with the other eight classical filtering algorithms.Quantitative and qualitative analysis shows that the proposed algorithm has good applicability in urban areas and rural areas,and is significantly better than other classic filtering algorithms in discontinuous terrain,with a total error of about 10%.The results show that the proposed method is feasible and can be used in different terrains.

Adaptive Median Filtering Algorithm Based on Divide and Conquer and Its Application in CAPTCHA Recognition

As the first barrier to protect cyberspace,the CAPTCHA has made significant contributions to maintaining Internet security and preventing malicious attacks.By researching the CAPTCHA,we can find its vulnerability and improve the security of CAPTCHA.Recently,many studies have shown that improving the image preprocessing effect of the CAPTCHA,which can achieve a better recognition rate by the state-of-theart machine learning algorithms.There are many kinds of noise and distortion in the CAPTCHA images of this experiment.We propose an adaptive median filtering algorithm based on divide and conquer in this paper.Firstly,the filtering window data quickly sorted by the data correlation,which can greatly improve the filtering efficiency.Secondly,the size of the filtering window is adaptively adjusted according to the noise density.As demonstrated in the experimental results,the proposed scheme can achieve superior performance compared with the conventional median filter.The algorithm can not only effectively detect the noise and remove it,but also has a good effect in preservation details.Therefore,this algorithm can be one of the most strong tools for various CAPTCHA image recognition and related applications.

A Novel Shilling Attack Detection Model Based on Particle Filter and Gravitation

With the rapid development of e-commerce, the security issues of collaborative filtering recommender systems have been widely investigated. Malicious users can benefit from injecting a great quantities of fake profiles into recommender systems to manipulate recommendation results. As one of the most important attack methods in recommender systems, the shilling attack has been paid considerable attention, especially to its model and the way to detect it. Among them, the loose version of Group Shilling Attack Generation Algorithm (GSAGenl) has outstanding performance. It can be immune to some PCC (Pearson Correlation Coefficient)-based detectors due to the nature of anti-Pearson correlation. In order to overcome the vulnerabilities caused by GSAGenl, a gravitation-based detection model (GBDM) is presented, integrated with a sophisticated gravitational detector and a decider. And meanwhile two new basic attributes and a particle filter algorithm are used for tracking prediction. And then, whether an attack occurs can be judged according to the law of universal gravitation in decision-making. The detection performances of GBDM, HHT-SVM, UnRAP, AP-UnRAP Semi-SAD,SVM-TIA and PCA-P are compared and evaluated. And simulation results show the effectiveness and availability of GBDM.

Distributed Filtering Algorithm Based on Tunable Weights Under Untrustworthy Dynamics

Aiming at effective fusion of a system state estimate of sensor network under attack in an untrustworthy environment, distributed filtering algorithm based on tunable weights is proposed. Considering node location and node influence over the network topology, a distributed filtering algorithm is developed to evaluate the certainty degree firstly. Using the weight reallocation approach, the weights of the attacked nodes are assigned to other intact nodes to update the certainty degree, and then the weight composed by the certainty degree is used to optimize the consensus protocol to update the node estimates. The proposed algorithm not only improves accuracy of the distributed filtering,but also enhances consistency of the node estimates. Simulation results demonstrate the effectiveness of the proposed algorithm.

Improved particle filtering techniques based on generalized interactive genetic algorithm

This paper improves the resampling step of particle filtering（PF） based on a broad interactive genetic algorithm to resolve particle degeneration and particle shortage.For target tracking in image processing,this paper uses the information coming from the particles of the previous fame image and new observation data to self-adaptively determine the selecting range of particles in current fame image.The improved selecting operator with jam gene is used to ensure the diversity of particles in mathematics,and the absolute arithmetical crossing operator whose feasible solution space being close about crossing operation,and non-uniform mutation operator is used to capture all kinds of mutation in this paper.The result of simulating experiment shows that the algorithm of this paper has better iterative estimating capability than extended Kalman filtering（EKF）,PF,regularized partide filtering（RPF）,and genetic algorithm（GA）-PF.

Filtering algorithm of line structured light for long-distance obstacle detection

Since unmanned ground vehicles often encounter concave and convex obstacles in wild ground, a filtering algorithm using line structured light to detect these long distance obstacles is proposed. For the line structured light image, a ranked-order based adaptively extremum median （RAEM） filter algorithm on salt and pepper noise is presented. In the algorithm, firstly effective points and noise points in a filtering window are differentiated; then the gray values of noise points are replaced by the medium of gray values of the effective pixels, with the efficient points＇ gray values unchanged; in the end this algorithm is proved to be efficient by experiments. Experimental resuits demonstrate that the image blur, resulting into proposed algorithm can remove noise points effectively and minimize the protecting the edge information as much as possible.

Stability and performance analysis of the compressed Kalman filter algorithm for sparse stochastic systems

This paper considers the problem of estimating unknown sparse time-varying signals for stochastic dynamic systems.To deal with the challenges of extensive sparsity,we resort to the compressed sensing method and propose a compressed Kalman filter(KF)algorithm.Our algorithm first compresses the original high-dimensional sparse regression vector via the sensing matrix and then obtains a KF estimate in the compressed low-dimensional space.Subsequently,the original high-dimensional sparse signals can be well recovered by a reconstruction technique.To ensure stability and establish upper bounds on the estimation errors,we introduce a compressed excitation condition without imposing independence or stationarity on the system signal,and therefore suitable for feedback systems.We further present the performance of the compressed KF algorithm.Specifically,we show that the mean square compressed tracking error matrix can be approximately calculated by a linear deterministic difference matrix equation,which can be readily evaluated,analyzed,and optimized.Finally,a numerical example demonstrates that our algorithm outperforms the standard uncompressed KF algorithm and other compressed algorithms for estimating high-dimensional sparse signals.

Underwater four-quadrant dual-beam circumferential scanning laser fuze using nonlinear adaptive backscatter filter based on pauseable SAF-LMS algorithm

The phenomenon of a target echo peak overlapping with the backscattered echo peak significantly undermines the detection range and precision of underwater laser fuzes.To overcome this issue,we propose a four-quadrant dual-beam circumferential scanning laser fuze to distinguish various interference signals and provide more real-time data for the backscatter filtering algorithm.This enhances the algorithm loading capability of the fuze.In order to address the problem of insufficient filtering capacity in existing linear backscatter filtering algorithms,we develop a nonlinear backscattering adaptive filter based on the spline adaptive filter least mean square(SAF-LMS)algorithm.We also designed an algorithm pause module to retain the original trend of the target echo peak,improving the time discrimination accuracy and anti-interference capability of the fuze.Finally,experiments are conducted with varying signal-to-noise ratios of the original underwater target echo signals.The experimental results show that the average signal-to-noise ratio before and after filtering can be improved by more than31 d B,with an increase of up to 76%in extreme detection distance.

Remaining lifetime prediction for nonlinear degradation device with random effect

For the large number of nonlinear degradation devices existing in a project, the existing methods have not systematically studied the effects of random effect on the remaining lifetime(RL),the accuracy and efficiency of the parameters estimation are not high, and the current degradation state of the target device is not accurately estimated. In this paper, a nonlinear Wiener degradation model with random effect is proposed and the corresponding probability density function(PDF) of the first hitting time(FHT)is deduced. A parameter estimation method based on modified expectation maximum(EM) algorithm is proposed to obtain the estimated value of fixed coefficient and the priori value of random coefficient in the model. The posterior value of the random coefficient and the current degradation state of target device are updated synchronously by the state space model(SSM) and the Kalman filter algorithm. The PDF of RL with random effect is deduced. A simulation example is analyzed to verify that the proposed method has the obvious advantage over the existing methods in parameter estimation error and RL prediction accuracy.

工业CT大视场扫描成像方法研究(英文)

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.

Research on Anti-noise Processing Method of Production Signal Based on Ensemble Empirical Mode Decomposition(EEMD)

The grain production prediction is one of the most important links in precision agriculture. In the process of grain production prediction, mechanical noise caused by the factors of difference in field topography and mechanical vibration will be mixed in the original signal, which undoubtedly will affect the prediction accuracy. Therefore, in order to reduce the influence of vibration noise on the prediction accuracy, an adaptive Ensemble Empirical Mode Decomposition(EEMD) threshold filtering algorithm was applied to the original signal in this paper: the output signal was decomposed into a finite number of Intrinsic Mode Functions(IMF) from high frequency to low frequency by using the Empirical Mode Decomposition(EMD) algorithm which could effectively restrain the mode mixing phenomenon; then the demarcation point of high and low frequency IMF components were determined by Continuous Mean Square Error criterion(CMSE), the high frequency IMF components were denoised by wavelet threshold algorithm, and finally the signal was reconstructed. The algorithm was an improved algorithm based on the commonly used wavelet threshold. The two algorithms were used to denoise the original production signal respectively, the adaptive EEMD threshold filtering algorithm had significant advantages in three denoising performance indexes of signal denoising ratio, root mean square error and smoothness. The five field verification tests showed that the average error of field experiment was 1.994% and the maximum relative error was less than 3%. According to the test results, the relative error of the predicted yield per hectare was 2.97%, which was relative to the actual yield. The test results showed that the algorithm could effectively resist noise and improve the accuracy of prediction.

A better carbon-water flux simulation in multiple vegetation types by data assimilation

Background:The accurate estimation of carbon-water flux is critical for understanding the carbon and water cycles of terrestrial ecosystems and further mitigating climate change.Model simulations and observations have been widely used to research water and carbon cycles of terrestrial ecosystems.Given the advantages and limitations of each method,combining simulations and observations through a data assimilation technique has been proven to be highly promising for improving carbon-water flux simulation.However,to the best of our knowledge,few studies have accomplished both parameter optimization and the updating of model state variables through data assimilation for carbon-water flux simulation in multiple vegetation types.And little is known about the variation of the performance of data assimilation for carbon-water flux simulation in different vegetation types.Methods:In this study,we assimilated leaf area index(LAI)time-series observations into a biogeochemical model(Biome-BGC)using different assimilation algorithms(ensemble Kalman filter algorithm(EnKF)and unscented Kalman filter(UKF))in different vegetation types(deciduous broad-leaved forest(DBF),evergreen broad-leaved forest(EBF)and grassland(GL))to simulate carbon-water flux.Results:The validation of the results against the eddy covariance measurements indicated that,overall,compared with the original simulation,assimilating the LAI into the Biome-BGC model improved the carbon-water flux simulations(R^(2)increased by 35%,root mean square error decreased by 10%;the sum of the absolute error decreased by 8%)but more significantly,improved the water flux simulations(R^(2)increased by 31%,root mean square error decreased by 18%;the sum of the absolute error decreased by 16%).Among the different forest types,the data assimilation techniques(both EnKF and UKF)achieved the best performance towards carbon-water flux in EBF(R^(2)increased by 44%,root mean square error decreased by 24%;the sum of the absolute error decreased by 28%),and the performances of EnKF and UKF showed slightly different when simulating carbon fluxes.Conclusion:We suggest that to reduce the uncertainty in global carbon-water flux quantification,forthcoming data assimilation treatment should consider the vegetation types where the data assimilation experiments are carried out,the simulated objectives and the assimilation algorithms.

离散不确定系统的优化鲁棒滤波方法及在飞行试验中的应用(英文)

An optimized robust filtering algorithm for uncertain discrete-time systemsis presented. To get a series of computational equations, the uncertain part generated by theuncertain systematic matrix in the expression of the error-covariance matrix of time update stateestimation is optimized and the least upper bound of the uncertain part is given. By means of theseresults, the equivalent systematic matrix is obtained and a robust time update algorithm is builtup. On the other hand, uncertain parts generated by the uncertain observation matrix in theexpression of the error-covariance matrix of measurement update state estimation are optimized, andthe largest lower bound of the uncertain part is given. Thus both the time update and measurementupdate algorithms are developed. By means of the matrix inversion formula, the expression structuresof both time update and measurement update algorithms are all simplified. Moreover, the convergencecondition of a robust filter is developed to make the results easy to application. The results offlight data processing show that the method presented in this paper is efficient.

Obstacle avoidance technology of bionic quadruped robot based on multi-sensor information fusion

In order to improve the ability of a bionic quadruped robot to percept the location of obstacles in a complex and dynamic environment, the information fusion between an ultrasonic sensor and a binocular sensor was studied under the condition that the robot moves in the Walk gait on a structured road. Firstly, the distance information of obstacles from these two sensors was separately processed by the Kalman filter algorithm, which largely reduced the noise interference. After that, we obtained two groups of estimated distance values from the robot to the obstacle and a variance of the estimation value. Additionally, a fusion of the estimation values and the variances was achieved based on the STF fusion algorithm. Finally, a simulation was performed to show that the curve of a real value was tracked well by that of the estimation value, which attributes to the effectiveness of the Kalman filter algorithm. In contrast to statistics before fusion, the fusion variance of the estimation value was sharply decreased. The precision of the position information is 4. 6 cm, which meets the application requirements of the robot.

Design of Hybrid Recommendation Algorithm in Online Shopping System

In order to improve user satisfaction and loyalty on e-commerce websites,recommendation algorithms are used to recommend products that may be of interest to users.Therefore,the accuracy of the recommendation algorithm is a primary issue.So far,there are three mainstream recommendation algorithms,content-based recommendation algorithms,collaborative filtering algorithms and hybrid recommendation algorithms.Content-based recommendation algorithms and collaborative filtering algorithms have their own shortcomings.The content-based recommendation algorithm has the problem of the diversity of recommended items,while the collaborative filtering algorithm has the problem of data sparsity and scalability.On the basis of these two algorithms,the hybrid recommendation algorithm learns from each other’s strengths and combines the advantages of the two algorithms to provide people with better services.This article will focus on the use of a content-based recommendation algorithm to mine the user’s existing interests,and then combine the collaborative filtering algorithm to establish a potential interest model,mix the existing and potential interests,and calculate with the candidate search content set.The similarity gets the recommendation list.