• Communications for Statistical Applications and Methods
• /
• v.21 no.2
• /
• pp.115-124
• /
• 2014

In this paper we derive a Berry-Esseen type bound for the kernel density estimator of a random left truncated model, in which each datum (Y) is randomly left truncated and is sampled if $Y{\geq}T$, where T is the truncation random variable with an unknown distribution. This unknown distribution is estimated with the Lynden-Bell estimator. In particular the normal approximation rate, by choice of the bandwidth, is shown to be close to $n^{-1/6}$ modulo logarithmic term. We have also investigated this normal approximation rate via a simulation study.

• Journal of IKEEE
• /
• v.13 no.4
• /
• pp.1-7
• /
• 2009

A video segmentation algorithm, which can extract objects even with non-stationary backgrounds, is proposed in this work. The proposed algorithm is composed of three steps. First, we perform an initial segmentation interactively to build the probability density functions of colors per each macro block via kernel density estimation. Then, for each subsequent frame, we construct a coherence strip, which is likely to contain the object contour, by exploiting spatio-temporal correlations. Finally, we perform the segmentation by minimizing an energy function composed of color, coherence, and smoothness terms. Experimental results on various test sequences show that the proposed algorithm provides accurate segmentation results.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.36 no.5
• /
• pp.335-341
• /
• 2018

The KDE (Kernel Density Estimation) technique in GIS (Geographic Information System) has been widely used as a method for determining whether a phenomenon occurring in space forms clusters. Most human-generated events such as traffic accidents and retail stores are distributed according to a road network. Even if events on forward and rear roads have short Euclidean distances, network distances may increase and the correlation between them may be low. Therefore, the NKDE (Network-based KDE) technique has been proposed and applied to the urban space where a road network has been developed. KDE is being studied in the field of business GIS, but there is a limit to the microscopic analysis of economic activity along a road. In this study, the NKDE technique is applied to the analysis of urban phenomena such as the density of shops rather than traffic accidents that occur on roads. The results of the NKDE technique are also compared to pedestrian networks and road centerline networks. The results show that applying NKDE to microscopic trade area analysis can yield relatively accurate results. In addition, it was found that pedestrian network data that can consider the movement of actual pedestrians are necessary for accurate trade area analysis using NKDE.

• Journal of Korea Multimedia Society
• /
• v.13 no.4
• /
• pp.535-546
• /
• 2010

Digital images have undesired color casts due to various illumination conditions and intrinsic characteristics of cameras. Since the color casts in the images deteriorate performance of color representations, color correction is required for further analysis of images. In this paper, an algorithm for detection and removal of color casts is presented. The proposed algorithm consists of four steps: retrieving similar image using color by correlation, extraction of near neutral color regions, kernel density estimation, and removal of color casts. Ambiguities in near neutral color regions are excluded based on kernel density estimation by the color by correlation algorithm. The method determines whether there are color casts by chromaticity distributions in near neutral color regions, and removes color casts for color constancy. Experimental results suggest that the proposed method outperforms the gray world algorithm and the color by correlation algorithm.

• Journal of IKEEE
• /
• v.28 no.1
• /
• pp.6-13
• /
• 2024

This paper proposes an approach to detect abnormal data in automotive controller area network (CAN) using an unsupervised learning model, i.e. autoencoder and Gaussian kernel density estimation function. The proposed autoencoder model is trained with only message ID of CAN data frames. Afterwards, by employing the Gaussian kernel density estimation function, it effectively detects abnormal data based on the trained model characterized by the optimally determined number of frames and a loss threshold. It was verified and evaluated using four types of attack data, i.e. DoS attacks, gear spoofing attacks, RPM spoofing attacks, and fuzzy attacks. Compared with conventional unsupervised learning-based models, it has achieved over 99% detection performance across all evaluation metrics.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.3
• /
• pp.705-712
• /
• 2005

Entropy is the basic concept of information theory. It is well defined for random varibles with known probability density function(pdf). For given data with unknown pdf, entropy should be estimated. Usually, estimation of entropy is based on the approximations. In this paper, we consider a kernel based approximation and compare it to the cumulant approximation method for several distributions. Monte carlo simulation for various sample size is conducted.

• Journal for History of Mathematics
• /
• v.17 no.2
• /
• pp.15-20
• /
• 2004

We investigate the unbiasedness and consistency as the statistical properties of density estimators. We show histogram, kernel density estimation, and local adaptive smoothing as density smoothing in this paper. Also, the early and recent research on nonparametric density estimation is described and discussed.

• Communications for Statistical Applications and Methods
• /
• v.2 no.2
• /
• pp.231-242
• /
• 1995

In this paper we consider kernel type estimator of the spectral density at a point in the analysis of stationary time series data. The kernel entails choice of smoothing parameter called bandwidth. A data-based bandwidth choice is proposed, and it is obtained by solving an equation similar to Sheather(1986) which relates to the probability density estimation. A Monte Carlo study is done. It reveals that the spectral density estimates using the data-based bandwidths show comparatively good performance.

• Journal of the Korean Statistical Society
• /
• v.20 no.1
• /
• pp.29-43
• /
• 1991

Two data-based bandwidth selectors which are optimal in the sense that they achieve n$\^$-$\frac{1}{2}$/ rate of convergence in kernel density estimation are proposed. The proposed bandwidth selectors are constructed by modifying Park and Marron's plug-in method. The first modification is taking Taylor expansion of the mean integrated squared error to two more terms than in the case of plug-in method. The second is estimating more accurately the functionals of the unknown density appeared in the minimizer of the expansion by using higher order kernels. The proposed bandwidth selectors were proved to be optimal in terms of convergence rate. According to small-sample Monte Carlo studies, the proposed bandwidth selectors showed better performance than all the other bandwidth selectors considered in the simulation.

• Proceedings of the Korean Statistical Society Conference
• /
• 2002.05a
• /
• pp.1-5
• /
• 2002

We consider the problem of optimal bandwidth choice for nonparametric classification, based on kernel density estimators, where the problem of interest is distinguishing between two univariate distributions. When the densities intersect at a single point, optimal bandwidth choice depends on curvatures of the densities at that point. The problem of empirical bandwidth selection and classifying data in the tails of a distribution are also addressed.