An Enhanced Multiview Transformer for Population Density Estimation Using Cellular Mobility Data in Smart City

This paper addresses the problem of predicting population density leveraging cellular station data.As wireless communication devices are commonly used,cellular station data has become integral for estimating population figures and studying their movement,thereby implying significant contributions to urban planning.However,existing research grapples with issues pertinent to preprocessing base station data and the modeling of population prediction.To address this,we propose methodologies for preprocessing cellular station data to eliminate any irregular or redundant data.The preprocessing reveals a distinct cyclical characteristic and high-frequency variation in population shift.Further,we devise a multi-view enhancement model grounded on the Transformer(MVformer),targeting the improvement of the accuracy of extended time-series population predictions.Comparative experiments,conducted on the above-mentioned population dataset using four alternate Transformer-based models,indicate that our proposedMVformer model enhances prediction accuracy by approximately 30%for both univariate and multivariate time-series prediction assignments.The performance of this model in tasks pertaining to population prediction exhibits commendable results.

A Weakly-Supervised Crowd Density Estimation Method Based on Two-Stage Linear Feature Calibration

In a crowd density estimation dataset,the annotation of crowd locations is an extremely laborious task,and they are not taken into the evaluation metrics.In this paper,we aim to reduce the annotation cost of crowd datasets,and propose a crowd density estimation method based on weakly-supervised learning,in the absence of crowd position supervision information,which directly reduces the number of crowds by using the number of pedestrians in the image as the supervised information.For this purpose,we design a new training method,which exploits the correlation between global and local image features by incremental learning to train the network.Specifically,we design a parent-child network(PC-Net)focusing on the global and local image respectively,and propose a linear feature calibration structure to train the PC-Net simultaneously,and the child network learns feature transfer factors and feature bias weights,and uses the transfer factors and bias weights to linearly feature calibrate the features extracted from the Parent network,to improve the convergence of the network by using local features hidden in the crowd images.In addition,we use the pyramid vision transformer as the backbone of the PC-Net to extract crowd features at different levels,and design a global-local feature loss function(L2).We combine it with a crowd counting loss(LC)to enhance the sensitivity of the network to crowd features during the training process,which effectively improves the accuracy of crowd density estimation.The experimental results show that the PC-Net significantly reduces the gap between fullysupervised and weakly-supervised crowd density estimation,and outperforms the comparison methods on five datasets of Shanghai Tech Part A,ShanghaiTech Part B,UCF_CC_50,UCF_QNRF and JHU-CROWD++.

Prediction and Output Estimation of Pattern Moving in Non-Newtonian Mechanical Systems Based on Probability Density Evolution

A prediction framework based on the evolution of pattern motion probability density is proposed for the output prediction and estimation problem of non-Newtonian mechanical systems,assuming that the system satisfies the generalized Lipschitz condition.As a complex nonlinear system primarily governed by statistical laws rather than Newtonian mechanics,the output of non-Newtonian mechanics systems is difficult to describe through deterministic variables such as state variables,which poses difficulties in predicting and estimating the system’s output.In this article,the temporal variation of the system is described by constructing pattern category variables,which are non-deterministic variables.Since pattern category variables have statistical attributes but not operational attributes,operational attributes are assigned to them by posterior probability density,and a method for analyzing their motion laws using probability density evolution is proposed.Furthermore,a data-driven form of pattern motion probabilistic density evolution prediction method is designed by combining pseudo partial derivative(PPD),achieving prediction of the probability density satisfying the system’s output uncertainty.Based on this,the final prediction estimation of the system’s output value is realized by minimum variance unbiased estimation.Finally,a corresponding PPD estimation algorithm is designed using an extended state observer(ESO)to estimate the parameters to be estimated in the proposed prediction method.The effectiveness of the parameter estimation algorithm and prediction method is demonstrated through theoretical analysis,and the accuracy of the algorithm is verified by two numerical simulation examples.

Visualising data distributions with kernel density estimation and reduced chi-squared statistic

The application of frequency distribution statistics to data provides objective means to assess the nature of the data distribution and viability of numerical models that are used to visualize and interpret data.Two commonly used tools are the kernel density estimation and reduced chi-squared statistic used in combination with a weighted mean.Due to the wide applicability of these tools,we present a Java-based computer application called KDX to facilitate the visualization of data and the utilization of these numerical tools.

Probability distribution of wind power volatility based on the moving average method and improved nonparametric kernel density estimation

In the process of large-scale,grid-connected wind power operations,it is important to establish an accurate probability distribution model for wind farm fluctuations.In this study,a wind power fluctuation modeling method is proposed based on the method of moving average and adaptive nonparametric kernel density estimation(NPKDE)method.Firstly,the method of moving average is used to reduce the fluctuation of the sampling wind power component,and the probability characteristics of the modeling are then determined based on the NPKDE.Secondly,the model is improved adaptively,and is then solved by using constraint-order optimization.The simulation results show that this method has a better accuracy and applicability compared with the modeling method based on traditional parameter estimation,and solves the local adaptation problem of traditional NPKDE.

Identification of crash hotspots using kernel density estimation and kriging methods:a comparison

This paper presents a study aimed at comparing the outcome of two geostatistical-based approaches, namely kernel density estimation （KDE） and kriging, for identifying crash hotspots in a road network. Aiming at locating high-risk locations for potential intervention, hotspot identification is an integral component of any comprehensive road safety management programs. A case study was conducted with historical crash data collected between 2003 and 2007 in the Hennepin County of Min- nesota, U.S. The two methods were evaluated on the basis of a prediction accuracy index （PAI） and a comparison in hotspot ranking. It was found that, based on the PAI measure, the kriging method outperformed the KDE method in its ability to detect hotspots, for all four tested groups of crash data with different times of day. Further- more, the lists of hotspots identified by the two methods were found to be moderately different, indicating the im- portance of selecting the right geostatistical method for hotspot identification. Notwithstanding the fact that the comparison study presented herein is limited to one case study, the findings have shown the promising perspective of the kriging technique for road safety analysis.

Robust state of charge estimation of lithium-ion battery via mixture kernel mean p-power error loss LSTM with heap-based-optimizer

The state of charge(SOC)estimation of lithium-ion battery is an important function in the battery management system(BMS)of electric vehicles.The long short term memory(LSTM)model can be employed for SOC estimation,which is capable of estimating the future changing states of a nonlinear system.Since the BMS usually works under complicated operating conditions,i.e the real measurement data used for model training may be corrupted by non-Gaussian noise,and thus the performance of the original LSTM with the mean square error(MSE)loss may deteriorate.Therefore,a novel LSTM with mixture kernel mean p-power error(MKMPE)loss,called MKMPE-LSTM,is developed by using the MKMPE loss to replace the MSE as the learning criterion in LSTM framework,which can achieve robust SOC estimation under the measurement data contaminated with non-Gaussian noises(or outliers)because of the MKMPE containing the p-order moments of the error distribution.In addition,a meta-heuristic algorithm,called heap-based-optimizer(HBO),is employed to optimize the hyper-parameters(mainly including learning rate,number of hidden layer neuron and value of p in MKMPE)of the proposed MKMPE-LSTM model to further improve its flexibility and generalization performance,and a novel hybrid model(HBO-MKMPE-LSTM)is established for SOC estimation under non-Gaussian noise cases.Finally,several tests are performed under various cases through a benchmark to evaluate the performance of the proposed HBO-MKMPE-LSTM model,and the results demonstrate that the proposed hybrid method can provide a good robustness and accuracy under different non-Gaussian measurement noises,and the SOC estimation results in terms of mean square error(MSE),root MSE(RMSE),mean absolute relative error(MARE),and determination coefficient R2are less than 0.05%,3%,3%,and above 99.8%at 25℃,respectively.

Kernel density estimation and marginalized-particle based probability hypothesis density filter for multi-target tracking

In order to improve the performance of the probability hypothesis density(PHD) algorithm based particle filter(PF) in terms of number estimation and states extraction of multiple targets, a new probability hypothesis density filter algorithm based on marginalized particle and kernel density estimation is proposed, which utilizes the idea of marginalized particle filter to enhance the estimating performance of the PHD. The state variables are decomposed into linear and non-linear parts. The particle filter is adopted to predict and estimate the nonlinear states of multi-target after dimensionality reduction, while the Kalman filter is applied to estimate the linear parts under linear Gaussian condition. Embedding the information of the linear states into the estimated nonlinear states helps to reduce the estimating variance and improve the accuracy of target number estimation. The meanshift kernel density estimation, being of the inherent nature of searching peak value via an adaptive gradient ascent iteration, is introduced to cluster particles and extract target states, which is independent of the target number and can converge to the local peak position of the PHD distribution while avoiding the errors due to the inaccuracy in modeling and parameters estimation. Experiments show that the proposed algorithm can obtain higher tracking accuracy when using fewer sampling particles and is of lower computational complexity compared with the PF-PHD.

Kernel Density Estimation of Tropical Cyclone Frequencies in the North Atlantic Basin

Previous research has identified specific areas of frequent tropical cyclone activity in the North Atlantic basin. This study examines long-term and decadal spatio-temporal patterns of Atlantic tropical cyclone frequencies from 1944 to 2009, and analyzes categorical and decadal centroid patterns using kernel density estimation (KDE) and centrographic statistics. Results corroborate previous research which has suggested that the Bermuda-Azores anticyclone plays an integral role in the direction of tropical cyclone tracks. Other teleconnections such as the North Atlantic Oscillation (NAO) may also have an impact on tropical cyclone tracks, but at a different temporal resolution. Results expand on existing knowledge of the spatial trends of tropical cyclones based on storm category and time through the use of spatial statistics. Overall, location of peak frequency varies by tropical cyclone category, with stronger storms being more concentrated in narrow regions of the southern Caribbean Sea and Gulf of Mexico, while weaker storms occur in a much larger area that encompasses much of the Caribbean Sea, Gulf of Mexico, and Atlantic Ocean off of the east coast of the United States. Additionally, the decadal centroids of tropical cyclone tracks have oscillated over a large area of the Atlantic Ocean for much of recorded history. Data collected since 1944 can be analyzed confidently to reveal these patterns.

Identifying Vehicular Crash High Risk Locations along Highways via Spatial Autocorrelation Indices and Kernel Density Estimation

Identifying vehicular crash high risk locations along highways is important for understanding the causes of vehicle crashes and to determine effective countermeasures based on the analysis. This paper presents a GIS approach to examine the spatial patterns of vehicle crashes and determines if they are spatially clustered, dispersed, or random. Moran’s I and Getis-Ord Gi* statistic are employed to examine spatial patterns, clusters mapping of vehicle crash data, and to generate high risk locations along highways. Kernel Density Estimation (KDE) is used to generate crash concentration maps that show the road density of crashes. The proposed approach is evaluated using the 2013 vehicle crash data in the state of Indiana. Results show that the approach is efficient and reliable in identifying vehicle crash hot spots and unsafe road locations.

AN EFFECTIVE IMAGE RETRIEVAL METHOD BASED ON KERNEL DENSITY ESTIMATION OF COLLAGE ERROR AND MOMENT INVARIANTS

In this paper, we propose a new method that combines collage error in fractal domain and Hu moment invariants for image retrieval with a statistical method - variable bandwidth Kernel Density Estimation (KDE). The proposed method is called CHK (KDE of Collage error and Hu moment) and it is tested on the Vistex texture database with 640 natural images. Experimental results show that the Average Retrieval Rate (ARR) can reach into 78.18%, which demonstrates that the proposed method performs better than the one with parameters respectively as well as the commonly used histogram method both on retrieval rate and retrieval time.

Diversity Sampling Based Kernel Density Estimation for Background Modeling

A novel diversity-sampling based nonparametric multi-modal background model is proposed. Using the samples having more popular and various intensity values in the training sequence, a nonparametric model is built for background subtraction. According to the related intensifies, different weights are given to the distinct samples in kernel density estimation. This avoids repeated computation using all samples, and makes computation more efficient in the evaluation phase. Experimental results show the validity of the diversity- sampling scheme and robustness of the proposed model in moving objects segmentation. The proposed algorithm can be used in outdoor surveillance systems.

Multivariate Statistical Process Monitoring of an Industrial Polypropylene Catalyzer Reactor with Component Analysis and Kernel Density Estimation

Data-driven tools,such as principal component analysis(PCA)and independent component analysis (ICA)have been applied to different benchmarks as process monitoring methods.The difference between the two methods is that the components of PCA are still dependent while ICA has no orthogonality constraint and its latent variables are independent.Process monitoring with PCA often supposes that process data or principal components is Gaussian distribution.However,this kind of constraint cannot be satisfied by several practical processes.To ex- tend the use of PCA,a nonparametric method is added to PCA to overcome the difficulty,and kernel density esti- mation(KDE)is rather a good choice.Though ICA is based on non-Gaussian distribution information,KDE can help in the close monitoring of the data.Methods,such as PCA,ICA,PCA with KDE(KPCA),and ICA with KDE (KICA),are demonstrated and compared by applying them to a practical industrial Spheripol craft polypropylene catalyzer reactor instead of a laboratory emulator.

Asymptotic normality of error density estimator in stationary and explosive autoregressive models

In this paper,we consider the limit distribution of the error density function estima-tor in the rst-order autoregressive models with negatively associated and positively associated random errors.Under mild regularity assumptions,some asymptotic normality results of the residual density estimator are obtained when the autoregressive models are stationary process and explosive process.In order to illustrate these results,some simulations such as con dence intervals and mean integrated square errors are provided in this paper.It shows that the residual density estimator can replace the density\estimator"which contains errors.

Improved Logistic Regression Algorithm Based on Kernel Density Estimation for Multi-Classification with Non-Equilibrium Samples

Logistic regression is often used to solve linear binary classification problems such as machine vision,speech recognition,and handwriting recognition.However,it usually fails to solve certain nonlinear multi-classification problem,such as problem with non-equilibrium samples.Many scholars have proposed some methods,such as neural network,least square support vector machine,AdaBoost meta-algorithm,etc.These methods essentially belong to machine learning categories.In this work,based on the probability theory and statistical principle,we propose an improved logistic regression algorithm based on kernel density estimation for solving nonlinear multi-classification.We have compared our approach with other methods using non-equilibrium samples,the results show that our approach guarantees sample integrity and achieves superior classification.

Multiple model PHD filter for tracking sharply maneuvering targets using recursive RANSAC based adaptive birth estimation

An algorithm to track multiple sharply maneuvering targets without prior knowledge about new target birth is proposed. These targets are capable of achieving sharp maneuvers within a short period of time, such as drones and agile missiles.The probability hypothesis density (PHD) filter, which propagates only the first-order statistical moment of the full target posterior, has been shown to be a computationally efficient solution to multitarget tracking problems. However, the standard PHD filter operates on the single dynamic model and requires prior information about target birth distribution, which leads to many limitations in terms of practical applications. In this paper,we introduce a nonzero mean, white noise turn rate dynamic model and generalize jump Markov systems to multitarget case to accommodate sharply maneuvering dynamics. Moreover, to adaptively estimate newborn targets’information, a measurement-driven method based on the recursive random sampling consensus (RANSAC) algorithm is proposed. Simulation results demonstrate that the proposed method achieves significant improvement in tracking multiple sharply maneuvering targets with adaptive birth estimation.

Density Estimation Using Gumbel Kernel Estimator

In this article, our proposed kernel estimator, named as Gumbel kernel, which broadened the class of non-negative, asymmetric kernel density estimators. Such kernel estimator can be used in nonparametric estimation of the probability density function (pdf). When the density functions have limited bounded support on [0, ∞) and they are liberated of boundary bias, always non-negative and obtain the optimal rate of convergence for the mean integrated squared error (MISE). The bias, variance and the optimal bandwidth of the proposed estimators are investigated on theoretical grounds as well as on simulation basis. Further, the applicability of the proposed estimator is compared to Weibull kernel estimator, where performance of newly proposed kernel is outstanding.

Performance Evaluation of Various Functions for Kernel Density Estimation

There have been vast amount of studies on background modeling to detect moving objects. Two recent reviews[1,2] showed that kernel density estimation(KDE) method and Gaussian mixture model(GMM) perform about equally best among possible background models. For KDE, the selection of kernel functions and their bandwidths greatly influence the performance. There were few attempts to compare the adequacy of functions for KDE. In this paper, we evaluate the performance of various functions for KDE. Functions tested include almost everyone cited in the literature and a new function, Laplacian of Gaussian(LoG) is also introduced for comparison. All tests were done on real videos with vary-ing background dynamics and results were analyzed both qualitatively and quantitatively. Effect of different bandwidths was also investigated.

MODERATE DEVIATIONS AND LARGEDE VIATIONS FOR A TEST OF SYMMETRY BASED ON KERNEL DENSITY ESTIMATOR

Let fn be a non-parametric kernel density estimator based on a kernel function K. and a sequence of independent and identically distributed random variables taking values in R. The goal of this article is to prove moderate deviations and large deviations for the statistic sup ｜fn（x） - fn（-x） ｜.

Kohn-Sham Density Matrix and the Kernel Energy Method

The kernel energy method(KEM) has been shown to provide fast and accurate molecular energy calculations for molecules at their equilibrium geometries.KEM breaks a molecule into smaller subsets,called kernels,for the purposes of calculation.The results from the kernels are summed according to an expression characteristic of KEM to obtain the full molecule energy.A generalization of the kernel expansion to density matrices provides the full molecule density matrix and orbitals.In this study,the kernel expansion for the density matrix is examined in the context of density functional theory(DFT) Kohn-Sham(KS) calculations.A kernel expansion for the one-body density matrix analogous to the kernel expansion for energy is defined,and is then converted into a normalizedprojector by using the Clinton algorithm.Such normalized projectors are factorizable into linear combination of atomic orbitals(LCAO) matrices that deliver full-molecule Kohn-Sham molecular orbitals in the atomic orbital basis.Both straightforward KEM energies and energies from a normalized,idempotent density matrix obtained from a density matrix kernel expansion to which the Clinton algorithm has been applied are compared to reference energies obtained from calculations on the full system without any kernel expansion.Calculations were performed both for a simple proof-of-concept system consisting of three atoms in a linear configuration and for a water cluster consisting of twelve water molecules.In the case of the proof-of-concept system,calculations were performed using the STO-3 G and6-31 G(d,p) bases over a range of atomic separations,some very far from equilibrium.The water cluster was calculated in the 6-31 G(d,p) basis at an equilibrium geometry.The normalized projector density energies are more accurate than the straightforward KEM energy results in nearly all cases.In the case of the water cluster,the energy of the normalized projector is approximately four times more accurate than the straightforward KEM energy result.The KS density matrices of this study are applicable to quantum crystallography.