β-divergence loss for the kernel density estimation with bias reduced

In this paper,we investigate the problem of estimating the probability density function.The kernel density estimation with bias reduced is nowadays a standard technique in explorative data analysis,there is still a big dispute on how to assess the quality of the estimate and which choice of bandwidth is optimal.This framework examines the most important bandwidth selection methods for kernel density estimation in the context of with bias reduction.Normal reference,least squares cross-validation,biased cross-validation andβ-divergence loss methods are described and expressions are presented.In order to assess the performance of our various bandwidth selectors,numerical simulations and environmental data are carried out.

Consistency of the <i>φ</i>-Divergence Based Change Point Estimator

This paper utilizes a change-point estimator based on the φ-divergence. Since we seek a near perfect translation to reality, then locations of parameter change within a finite set of data have to be accounted for since the assumption of stationary model is too restrictive especially for long time series. The estimator is shown to be consistent through asymptotic theory and finally proven through simulations. The estimator is applied to the generalized Pareto distribution to estimate changes in the scale and shape parameters.

Limit Distribution of the φ-Divergence Based Change Point Estimator

The assumption of stationarity is too restrictive especially for long time series. This paper studies the change point problem through a change point estimator based on the φ-divergence which provides a rich set of distance like measures between pairs of distributions. The change point problem is considered in the following sub-fields: the problem of divergence estimation, testing for the homogeneity between two samples as well as estimating the time of change. The asymptotic distribution of the change point estimator is estimated by the limiting distribution of a stochastic process within given bounds through asymptotic theory surrounding the likelihood theory. The distribution is found to converge to that of a standardized Brownian bridge process.

Deep Learning-Based Robust Morphed Face Authentication Framework for Online Systems

The amalgamation of artificial intelligence(AI)with various areas has been in the picture for the past few years.AI has enhanced the functioning of several services,such as accomplishing better budgets,automating multiple tasks,and data-driven decision-making.Conducting hassle-free polling has been one of them.However,at the onset of the coronavirus in 2020,almost all worldly affairs occurred online,and many sectors switched to digital mode.This allows attackers to find security loopholes in digital systems and exploit them for their lucrative business.This paper proposes a three-layered deep learning(DL)-based authentication framework to develop a secure online polling system.It provides a novel way to overcome security breaches during the face identity(ID)recognition and verification process for online polling systems.This verification is done by training a pixel-2-pixel Pix2pix generative adversarial network(GAN)for face image reconstruction to remove facial objects present(if any).Furthermore,image-to-image matching is done by implementing the Siamese network and comparing the result of various metrics executed on feature embeddings to obtain the outcome,thus checking the electorate credentials.