• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.408-413
• /
• 2005

A new methodology for discrete non-Gaussian probability density estimation is investigated in this paper based on a dynamic Bayesian network (DBN) and kernel functions. The estimator consists of a DBN in which the transition distribution is represented with kernel functions. The estimator parameters are determined through a recursive learning algorithm according to the maximum likelihood (ML) scheme. A discrete-type Poisson distribution is generated in a simulation experiment to evaluate the proposed method. In addition, an unknown probability density generated by nonlinear transformation of a Poisson random variable is simulated. Computer simulations numerically demonstrate that the method successfully estimates the unknown probability distribution function (PDF).

• International Journal of Control, Automation, and Systems
• /
• v.6 no.1
• /
• pp.109-118
• /
• 2008

We present two estimators for discrete non-Gaussian and nonstationary probability density estimation based on a dynamic Bayesian network (DBN). The first estimator is for off line computation and consists of a DBN whose transition distribution is represented in terms of kernel functions. The estimator parameters are the weights and shifts of the kernel functions. The parameters are determined through a recursive learning algorithm using maximum likelihood (ML) estimation. The second estimator is a DBN whose parameters form the transition probabilities. We use an asymptotically convergent, recursive, on-line algorithm to update the parameters using observation data. The DBN calculates the state probabilities using the estimated parameters. We provide examples that demonstrate the usefulness and simplicity of the two proposed estimators.

• The Pure and Applied Mathematics
• /
• v.1 no.1
• /
• pp.19-24
• /
• 1994

Let P be a probability measure on the real line with Lebesque-density f. The usual estimator of the distribution function (≡df) of P for the sample $\chi$$_1$,…, $\chi$$\_$n/ is the empirical df: F$\_$n/(t)=(equation omitted). But this estimator does not take into account the smoothness of F, that is, the existence of a density f. Therefore, one should expect that an estimator which is better adapted to this situation beats the empirical df with respect to a reasonable measure of performance.(omitted)

• Proceedings of the KIEE Conference
• /
• 1995.11a
• /
• pp.146-148
• /
• 1995

A CFAR algorithm for weibull clutter is discussed. The Maximum a posteriori(MAP) estimator for two parameters(skewness and scale) of the weibull clutter is proposed, assuming the probability density function of skewness parameter is known. And proposed MAP estimator is compared with the Maximum likelihood(ML) estimator. Using this MAP estimator, we can design CFAR detector which is shown to have smaller CFAR loss than ML CFAR detector by the statistical simulation method.

• Communications for Statistical Applications and Methods
• /
• v.15 no.6
• /
• pp.939-946
• /
• 2008

In this paper the support vector method is presented for the probability density function estimation when the sample observations are contaminated with random noise. The performance of the procedure is compared to kernel density estimates by the simulation study.

• Journal of the Korean Data and Information Science Society
• /
• v.3 no.1
• /
• pp.17-24
• /
• 1992

The problem of estimating symmetric probability density with high kurtosis is considered. Such densities are often estimated poorly by a global bandwidth kernel estimation since good estimation of the peak of the distribution leads to unsatisfactory estimation of the tails and vice versa. In this paper, we propose a transformation technique before using a global bandwidth kernel estimator. Performance of density estimator based on proposed transformation is investigated through simulation study. It is observed that our method offers a substantial improvement for the densities with high kurtosis. However, its performance is a little worse than that of ordinary kernel estimator in the situation where the kurtosis is not high.

• Communications for Statistical Applications and Methods
• /
• v.6 no.3
• /
• pp.729-748
• /
• 1999

In this paper we present combined estimator of capture-recapture and line transect model using bivariate detection function and detection probability according to objects being in cluster population. Here bivariate detection function use distance and cluster size. The simulation shows that combined estimator approaches the more true value the larger size parameter. Therefore this estimator using the bivariate detection function is more efficient in estimate the population size and density by size parameter.

• Communications for Statistical Applications and Methods
• /
• v.18 no.2
• /
• pp.245-255
• /
• 2011

There are two nonparametric methods that use empirical distribution functions and probability density estimators for the test of the distribution change of data. In this paper we investigate the two methods precisely and summarize the results of previous research. We assume several probability models to make a simulation study of the change point analysis and to examine the finite sample behavior of the two methods. Empirical powers are compared to verify which is better for each model.

• Journal of Information Processing Systems
• /
• v.16 no.1
• /
• pp.145-154
• /
• 2020

Maximum likelihood (ML) is the best estimator asymptotically as the number of training samples approaches infinity. This paper deduces an adaptive algorithm for blind signal processing problem based on gradient optimization criterion. A parametric density model is introduced through a parameterized generalized distribution family in ML framework. After specifying a limited number of parameters, the density of specific original signal can be approximated automatically by the constructed density function. Consequently, signal separation can be conducted without any prior information about the probability density of the desired original signal. Simulations on classical biomedical signals confirm the performance of the deduced technique.

• Journal of the Korean Statistical Society
• /
• v.34 no.1
• /
• pp.49-60
• /
• 2005

In this paper we introduce a nonparametric method for estimating the probability density function of detection distances in line transect sampling. The estimator is obtained using a frequency histogram density estimation method. The asymptotic properties of the proposed estimator are derived and compared with those of the kernel estimator under the assumption that the data collected satisfy the shoulder condition. We found that the asymptotic mean square error (AMSE) of the two estimators have about the same convergence rate. The formula for the optimal histogram bin width is derived which minimizes AMSE. Moreover, the performances of the corresponding k-nearest-neighbor estimators are studied through simulation techniques. In the absence of our knowledge whether the shoulder condition is valid or not a new semi-parametric model is suggested to fit the line transect data. The performances of the proposed two estimators are studied and compared with some existing nonparametric and semiparametric estimators using simulation techniques. The results demonstrate the superiority of the new estimators in most cases considered.