A Robust Indoor Localization Algorithm Based on Polynomial Fitting and Gaussian Mixed Model

Wireless sensor network(WSN)positioning has a good effect on indoor positioning,so it has received extensive attention in the field of positioning.Non-line-of sight(NLOS)is a primary challenge in indoor complex environment.In this paper,a robust localization algorithm based on Gaussian mixture model and fitting polynomial is proposed to solve the problem of NLOS error.Firstly,fitting polynomials are used to predict the measured values.The residuals of predicted and measured values are clustered by Gaussian mixture model(GMM).The LOS probability and NLOS probability are calculated according to the clustering centers.The measured values are filtered by Kalman filter(KF),variable parameter unscented Kalman filter(VPUKF)and variable parameter particle filter(VPPF)in turn.The distance value processed by KF and VPUKF and the distance value processed by KF,VPUKF and VPPF are combined according to probability.Finally,the maximum likelihood method is used to calculate the position coordinate estimation.Through simulation comparison,the proposed algorithm has better positioning accuracy than several comparison algorithms in this paper.And it shows strong robustness in strong NLOS environment.

A blast furnace fault monitoring algorithm with low false alarm rate:Ensemble of greedy dynamic principal component analysis-Gaussian mixture model

The large blast furnace is essential equipment in the process of iron and steel manufacturing. Due to the complex operation process and frequent fluctuations of variables, conventional monitoring methods often bring false alarms. To address the above problem, an ensemble of greedy dynamic principal component analysis-Gaussian mixture model(EGDPCA-GMM) is proposed in this paper. First, PCA-GMM is introduced to deal with the collinearity and the non-Gaussian distribution of blast furnace data.Second, in order to explain the dynamics of data, the greedy algorithm is used to determine the extended variables and their corresponding time lags, so as to avoid introducing unnecessary noise. Then the bagging ensemble is adopted to cooperate with greedy extension to eliminate the randomness brought by the greedy algorithm and further reduce the false alarm rate(FAR) of monitoring results. Finally, the algorithm is applied to the blast furnace of a large iron and steel group in South China to verify performance.Compared with the basic algorithms, the proposed method achieves lowest FAR, while keeping missed alarm rate(MAR) remain stable.

A Probabilistic Trust Model and Control Algorithm to Protect 6G Networks against Malicious Data Injection Attacks in Edge Computing Environments

Future 6G communications are envisioned to enable a large catalogue of pioneering applications.These will range from networked Cyber-Physical Systems to edge computing devices,establishing real-time feedback control loops critical for managing Industry 5.0 deployments,digital agriculture systems,and essential infrastructures.The provision of extensive machine-type communications through 6G will render many of these innovative systems autonomous and unsupervised.While full automation will enhance industrial efficiency significantly,it concurrently introduces new cyber risks and vulnerabilities.In particular,unattended systems are highly susceptible to trust issues:malicious nodes and false information can be easily introduced into control loops.Additionally,Denialof-Service attacks can be executed by inundating the network with valueless noise.Current anomaly detection schemes require the entire transformation of the control software to integrate new steps and can only mitigate anomalies that conform to predefined mathematical models.Solutions based on an exhaustive data collection to detect anomalies are precise but extremely slow.Standard models,with their limited understanding of mobile networks,can achieve precision rates no higher than 75%.Therefore,more general and transversal protection mechanisms are needed to detect malicious behaviors transparently.This paper introduces a probabilistic trust model and control algorithm designed to address this gap.The model determines the probability of any node to be trustworthy.Communication channels are pruned for those nodes whose probability is below a given threshold.The trust control algorithmcomprises three primary phases,which feed themodel with three different probabilities,which are weighted and combined.Initially,anomalous nodes are identified using Gaussian mixture models and clustering technologies.Next,traffic patterns are studied using digital Bessel functions and the functional scalar product.Finally,the information coherence and content are analyzed.The noise content and abnormal information sequences are detected using a Volterra filter and a bank of Finite Impulse Response filters.An experimental validation based on simulation tools and environments was carried out.Results show the proposed solution can successfully detect up to 92%of malicious data injection attacks.

ALMOST SURELY TIME-SPACE INTERMITTENCY FOR THE PARABOLIC ANDERSON MODEL WITH A LOG-CORRELATED GAUSSIAN FIELD

In this paper, we consider the continuous parabolic Anderson model with a logcorrelated Gaussian field, and obtain the precise quenched long-time asymptotics and spatial asymptotics. To overcome the difficulties arising from the log-correlated Gaussian field in the proof of the lower bound of the spatial asymptotics, we first establish the relation between quenched long-time asymptotics and spatial asymptotics, and then get the lower bound of the spatial asymptotics through the lower bound of the quenched long-time asymptotics.

Calibration of quantitative rescattering model for simulating vortex high-order harmonic generation driven by Laguerre–Gaussian beam with nonzero orbital angular momentum

We calibrate the macroscopic vortex high-order harmonic generation(HHG)obtained by the quantitative rescattering(QRS)model to compute single-atom induced dipoles against that by solving the time-dependent Schr?dinger equation(TDSE).We show that the QRS perfectly agrees with the TDSE under the favorable phase-matching condition,and the QRS can accurately predict the main features in the spatial profiles of vortex HHG if the phase-matching condition is not good.We uncover that harmonic emissions from short and long trajectories are adjusted by the phase-matching condition through the time-frequency analysis and the QRS can simulate the vortex HHG accurately only when the interference between two trajectories is absent.This work confirms that it is an efficient way to employ the QRS model in the single-atom response for precisely simulating the macroscopic vortex HHG.

Propagation of Gaussian Schell-Model Array Beams through a Jet Engine Exhaust

Here a Gaussian Shell Model Array (GSMA) beam is used to investigate the propagation characteristics in the jet engine exhaust region. It has great significance to improve various optical systems for wide application in trapping cold atoms, creating gratings, and atmospheric optical communication. We calculate analytical formulas for the spectral density (SD) and the propagation factors Mx2 and My2 of a GSMA beam. The influence of inner scale of turbulence in the jet engine exhaust region on its power spectrum has been also analyzed. According to these results, the influence of turbulence in a jet engine exhaust on a GSMA beam has been reduced by changing the parameters of light source and turbulence. For example, it is an excellent tool for mitigation of the jet engine exhaust-induced anisotropy of turbulence to increase the source coherence length, the root-mean-squared (rms) beam width, the wavelength or reduce the outer scale of turbulence.

Persymmetric adaptive polarimetric detection of subspace range-spread targets in compound Gaussian sea clutter

This paper focuses on the adaptive detection of range and Doppler dual-spread targets in non-homogeneous and nonGaussian sea clutter.The sea clutter from two polarimetric channels is modeled as a compound-Gaussian model with different parameters,and the target is modeled as a subspace rangespread target model.The persymmetric structure is used to model the clutter covariance matrix,in order to reduce the reliance on secondary data of the designed detectors.Three adaptive polarimetric persymmetric detectors are designed based on the generalized likelihood ratio test(GLRT),Rao test,and Wald test.All the proposed detectors have constant falsealarm rate property with respect to the clutter texture,the speckle covariance matrix.Experimental results on simulated and measured data show that three adaptive detectors outperform the competitors in different clutter environments,and the proposed GLRT detector has the best detection performance under different parameters.

A Gaussian Noise-Based Algorithm for Enhancing Backdoor Attacks

Deep Neural Networks(DNNs)are integral to various aspects of modern life,enhancing work efficiency.Nonethe-less,their susceptibility to diverse attack methods,including backdoor attacks,raises security concerns.We aim to investigate backdoor attack methods for image categorization tasks,to promote the development of DNN towards higher security.Research on backdoor attacks currently faces significant challenges due to the distinct and abnormal data patterns of malicious samples,and the meticulous data screening by developers,hindering practical attack implementation.To overcome these challenges,this study proposes a Gaussian Noise-Targeted Universal Adversarial Perturbation(GN-TUAP)algorithm.This approach restricts the direction of perturbations and normalizes abnormal pixel values,ensuring that perturbations progress as much as possible in a direction perpendicular to the decision hyperplane in linear problems.This limits anomalies within the perturbations improves their visual stealthiness,and makes them more challenging for defense methods to detect.To verify the effectiveness,stealthiness,and robustness of GN-TUAP,we proposed a comprehensive threat model.Based on this model,extensive experiments were conducted using the CIFAR-10,CIFAR-100,GTSRB,and MNIST datasets,comparing our method with existing state-of-the-art attack methods.We also tested our perturbation triggers using various defense methods and further experimented on the robustness of the triggers against noise filtering techniques.The experimental outcomes demonstrate that backdoor attacks leveraging perturbations generated via our algorithm exhibit cross-model attack effectiveness and superior stealthiness.Furthermore,they possess robust anti-detection capabilities and maintain commendable performance when subjected to noise-filtering methods.

An Efficient Local Radial Basis Function Method for Image Segmentation Based on the Chan-Vese Model

In this paper,we consider the Chan–Vese(C-V)model for image segmentation and obtain its numerical solution accurately and efficiently.For this purpose,we present a local radial basis function method based on a Gaussian kernel(GA-LRBF)for spatial discretization.Compared to the standard radial basis functionmethod,this approach consumes less CPU time and maintains good stability because it uses only a small subset of points in the whole computational domain.Additionally,since the Gaussian function has the property of dimensional separation,the GA-LRBF method is suitable for dealing with isotropic images.Finally,a numerical scheme that couples GA-LRBF with the fourth-order Runge–Kutta method is applied to the C-V model,and a comparison of some numerical results demonstrates that this scheme achieves much more reliable image segmentation.

Stationary properties of a single-mode laser system with non-Gaussian and Gaussian noise

A single-mode laser system with non-Gaussian and Gaussian noise is investigated. The stationary mean value and the normalized variance of the laser intensity are numerically calculated under the condition that the stationary probability distribution function （SPDF） is derived. The SPDF as a function of the laser intensity exhibits a maximum, The maximum becomes smaller with the increase of the correlation intensity or the non-Gaussian parameter, where the later is a measure of the deviation from the Gaussian characteristic. The maximum becomes larger as the correlation time increases. The laser intensity stationary mean value decreases with the increase of the correlation intensity or the non-Gaussian parameter while increases with the correlation time increasing. The laser intensity normalized variance increases with the increase of the correlation intensity or the non-Gaussian parameter while decreases as the correlation time increases.

General Single-Mode Gaussian Operation with Two-Mode Entangled State

Realizing the logic operations with small-scale states is pursued to improve the utilization of quantum resources and to simplify the experimental setup. We propose a scheme to realize a general single-mode Gauss/an operation with a two-mode entangled state by utilizing only one nondegenerate optical parametric amplifier and by adjusting four angle parameters. The fidelity of the output mode can be optimized by changing one of the angle parameters. This scheme would be utilized as a basic efficient element in the future large-scale quantum computation.

Cascaded projection of Gaussian mixture model for emotion recognition in speech and ECG signals

A cascaded projection of the Gaussian mixture model algorithm is proposed.First,the marginal distribution of the Gaussian mixture model is computed for different feature dimensions, and a number of sub-classifiers are generated using the marginal distribution model.Each sub-classifier is based on different feature sets.The cascaded structure is adopted to fuse the sub-classifiers dynamically to achieve sample adaptation ability.Secondly,the effectiveness of the proposed algorithm is verified on electrocardiogram emotional signal and speech emotional signal.Emotional data including fidgetiness,happiness and sadness is collected by induction experiments.Finally,the emotion feature extraction method is discussed,including heart rate variability, the chaotic electrocardiogram feature and utterance level static feature.The emotional feature reduction methods are studied, including principle component analysis,sequential forward selection, the Fisher discriminant ratio and maximal information coefficient.The experimental results show that the proposed classification algorithm can effectively improve recognition accuracy in two different scenarios.

Adaptive moving target detection algorithm based on Gaussian mixture model

In order to enhance the reliability of the moving target detection, an adaptive moving target detection algorithm based on the Gaussian mixture model is proposed. This algorithm employs Gaussian mixture distributions in modeling the background of each pixel. As a result, the number of Gaussian distributions is not fixed but adaptively changes with the change of the pixel value frequency. The pixels of the difference image are divided into two parts according to their values. Then the two parts are separately segmented by the adaptive threshold, and finally the foreground image is obtained. The shadow elimination method based on morphological reconstruction is introduced to improve the performance of foreground image＇s segmentation. Experimental results show that the proposed algorithm can quickly and accurately build the background model and it is more robust in different real scenes.

Gaussian mixture models for clustering and classifying traffic flow in real-time for traffic operation and management

Based on Gaussian mixture models（GMM）, speed, flow and occupancy are used together in the cluster analysis of traffic flow data. Compared with other clustering and sorting techniques, as a structural model, the GMM is suitable for various kinds of traffic flow parameters. Gap statistics and domain knowledge of traffic flow are used to determine a proper number of clusters. The expectation-maximization （E-M） algorithm is used to estimate parameters of the GMM model. The clustered traffic flow pattems are then analyzed statistically and utilized for designing maximum likelihood classifiers for grouping real-time traffic flow data when new observations become available. Clustering analysis and pattern recognition can also be used to cluster and classify dynamic traffic flow patterns for freeway on-ramp and off-ramp weaving sections as well as for other facilities or things involving the concept of level of service, such as airports, parking lots, intersections, interrupted-flow pedestrian facilities, etc.

Gaussian mixture model clustering with completed likelihood minimum message length criterion

An improved Gaussian mixture model （GMM）- based clustering method is proposed for the difficult case where the true distribution of data is against the assumed GMM. First, an improved model selection criterion, the completed likelihood minimum message length criterion, is derived. It can measure both the goodness-of-fit of the candidate GMM to the data and the goodness-of-partition of the data. Secondly, by utilizing the proposed criterion as the clustering objective function, an improved expectation- maximization （EM） algorithm is developed, which can avoid poor local optimal solutions compared to the standard EM algorithm for estimating the model parameters. The experimental results demonstrate that the proposed method can rectify the over-fitting tendency of representative GMM-based clustering approaches and can robustly provide more accurate clustering results.

EFFECTIVE IMAGE SEGMENTATION FRAMEWORK FOR GAUSSIAN MIXTURE MODEL INCORPORATING LOCAL INFORMATION

A new two-step framework is proposed for image segmentation. In the first step, the gray-value distribution of the given image is reshaped to have larger inter-class variance and less intra-class variance. In the sec- ond step, the discriminant-based methods or clustering-based methods are performed on the reformed distribution. It is focused on the typical clustering methods-Gaussian mixture model （GMM） and its variant to demonstrate the feasibility of the framework. Due to the independence of the first step in its second step, it can be integrated into the pixel-based and the histogram-based methods to improve their segmentation quality. The experiments on artificial and real images show that the framework can achieve effective and robust segmentation results.

Quality prediction of batch process using the global-local discriminant analysis based Gaussian process regression model

The conventional single model strategy may be ill- suited due to the multiplicity of operation phases and system uncertainty. A novel global-local discriminant analysis （GLDA） based Gaussian process regression （GPR） approach is developed for the quality prediction of nonlinear and multiphase batch processes. After the collected data is preprocessed through batchwise unfolding, the hidden Markov model （HMM） is applied to identify different operation phases. A GLDA algorithm is also presented to extract the appropriate process variables highly correlated with the quality variables, decreasing the complexity of modeling. Besides, the multiple local GPR models are built in the reduced- dimensional space for all the identified operation phases. Furthermore, the HMM-based state estimation is used to classify each measurement sample of a test batch into a corresponding phase with the maximal likelihood estimation. Therefore, the local GPR model with respect to specific phase is selected for online prediction. The effectiveness of the proposed prediction approach is demonstrated through the multiphase penicillin fermentation process. The comparison results show that the proposed GLDA-GPR approach is superior to the regular GPR model and the GPR based on HMM （HMM-GPR） model.

Multiple Model Soft Sensor Based on Affinity Propagation, Gaussian Process and Bayesian Committee Machine

Presented is a multiple model soft sensing method based on Affinity Propagation （AP）, Gaussian process （GP） and Bayesian committee machine （BCM）. AP clustering arithmetic is used to cluster training samples according to their operating points. Then, the sub-models are estimated by Gaussian Process Regression （GPR）. Finally, in order to get a global probabilistic prediction, Bayesian committee mactnne is used to combine the outputs of the sub-estimators. The proposed method has been applied to predict the light naphtha end point in hydrocracker fractionators. Practical applications indicate that it is useful for the online prediction of quality monitoring in chemical processes.

Application of a Novel Method for Machine Performance Degradation Assessment Based on Gaussian Mixture Model and Logistic Regression

The currently prevalent machine performance degradation assessment techniques involve estimating a machine＇s current condition based upon the recognition of indications of failure features,which entail complete data collected in different conditions.However,failure data are always hard to acquire,thus making those techniques hard to be applied.In this paper,a novel method which does not need failure history data is introduced.Wavelet packet decomposition（WPD） is used to extract features from raw signals,principal component analysis（PCA） is utilized to reduce feature dimensions,and Gaussian mixture model（GMM） is then applied to approximate the feature space distributions.Single-channel confidence value（SCV） is calculated by the overlap between GMM of the monitoring condition and that of the normal condition,which can indicate the performance of single-channel.Furthermore,multi-channel confidence value（MCV）,which can be deemed as the overall performance index of multi-channel,is calculated via logistic regression（LR） and that the task of decision-level sensor fusion is also completed.Both SCV and MCV can serve as the basis on which proactive maintenance measures can be taken,thus preventing machine breakdown.The method has been adopted to assess the performance of the turbine of a centrifugal compressor in a factory of Petro-China,and the result shows that it can effectively complete this task.The proposed method has engineering significance for machine performance degradation assessment.

Color-texture segmentation using JSEG based on Gaussian mixture modeling

An improved approach for J-value segmentation （JSEG） is presented for unsupervised color image segmentation. Instead of color quantization algorithm, an automatic classification method based on adaptive mean shift （AMS） based clustering is used for nonparametric clustering of image data set. The clustering results are used to construct Gaussian mixture modelling （GMM） of image data for the calculation of soft J value. The region growing algorithm used in JSEG is then applied in segmenting the image based on the multiscale soft J-images. Experiments show that the synergism of JSEG and the soft classification based on AMS based clustering and GMM overcomes the limitations of JSEG successfully and is more robust.