• Journal of the Korean Statistical Society
• /
• 제31권2호
• /
• pp.261-276
• /
• 2002

Probability density or its derivatives may have a discontinuity/change point at an unknown location. We propose a method of estimating the location and the jump size of the discontinuity point based on kernel type density or density derivatives estimators with one-sided equivalent kernels. The rates of convergence of the proposed estimators are derived, and the finite-sample performances of the methods are illustrated by simulated examples.

• Journal of the Korean Data and Information Science Society
• /
• 제17권1호
• /
• pp.213-220
• /
• 2006

Since Beran (1977) developed the minimum Hellinger distance estimation, this method has been a popular topic in the field of robust estimation. In the process of defining a distance, a kernel density estimator has been widely used as a density estimator. In this article, however, we show that a combination of a kernel density estimator and an empirical density could result a smaller bias of the minimum Hellinger distance estimator than using just a kernel density estimator for a location parameter.

• Journal of the Korean Statistical Society
• /
• 제27권1호
• /
• pp.91-100
• /
• 1998

A method of estimating probability density using regression tools is presented here. It is based on equal-length binning and locally weighted approximate likelihood for bin counts. The method is particularly useful for densities with bounded supports, where it automatically corrects edge effects without using boundary kernels.

• Journal of the Korean Data and Information Science Society
• /
• 제3권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
• /
• 제7권1호
• /
• pp.13-22
• /
• 2000

We consider local likelihood method with a smoothed version of the model density in stead of an original model density. For simplicity a model is assumed as the log-linear density then we were able to show that the proposed local density estimator is less affected by changes among observations but its bias increases little bit more than that of the currently used local density estimator. Hence if we use the existing method and the proposed method in a proper way we would derive the local density estimator fitting the data in a better way.

• 한국정보처리학회논문지
• /
• 제6권3호
• /
• pp.766-772
• /
• 1999

With the increase of portable system and high-density IC, power consumption of VLSI circuits is very important factor in design process. Power estimation is required in order to estimate the power consumption. A simple and correct solution of power estimation is to use circuit simulation. But it is very time consuming and inefficient way. Probabilistic method has been proposed to overcome this problem. Transition density using probability was an efficient method to estimate power consumption using BDD and Boolean difference. But it is difficult to build the BDD and compute complex Boolean difference. In this paper, we proposed Propowest. Propowest is building a digraph of circuit, and easy and fast in computing transition density by using modified COP algorithm. Propowest provides an efficient way for power estimation.

• 정보처리학회논문지B
• /
• 제13B권1호
• /
• pp.27-34
• /
• 2006

본 연구에서는 엔트로피를 이용한 독립성분분석(ICA : Independent Component Analysis)에서 점수함수(score function)를 생성하는 알고리즘을 제안한다. 점수함수를 생성하기 위해서 원 신호(original signals)에 대한 확률밀도함수의 추정이 반드시 필요하고 밀도함수가 미분 가능해야 한다. 따라서 원 신호에 따른 적응적인 점수 함수를 유도할 수 있도록 커널 기반의 밀도추정(kernel density estimation)방법을 사용하였으며, 보다 빠른 밀도 추정 계산을 위해서 식의 형태를 컨볼루션(convolution) 변환 한 후, 컨볼루션을 빠르게 계산할 수 있는 FFT(Fast Fourier Transform) 알고리즘을 이용하였다. 제안한 점수함수 생성 방법은 원 신호에 확률밀도분포와 추정된 신호의 확률밀도 분포의 오차를 줄이는 역할을 한다 실험 결과, 암묵신호분리(blind source separation)문제에서 기존의 Extended Infomax 알고리즘과 Fixed Point ICA 보다 원 신호와 유사한 밀도함수를 추정하였고, 분리된 신호의 신호대잡음비등(SNR)에 있어서 향상된 성능을 얻을 수 있었다.

• 한국경영과학회지
• /
• 제38권1호
• /
• pp.201-216
• /
• 2013

Diffusion is a basic mathematical tool for modern financial engineering. The theory of the estimation methods for diffusion models is an important topic of the financial engineering. Many researches have been tried to apply the likelihood estimation method for estimating diffusion models. However, the likelihood estimation method for diffusion is complicated and needs much amount of computing. In this paper we develop the estimation methods which are simple enough to be compared to the Euler approximation method, and efficient enough statistically to be compared to the likelihood estimation method. We devise pseudo-likelihood and propose the maximum pseudo-likelihood estimation methods. The pseudo-likelihoods are obtained by approximating the transition density with normal distributions. The means and the variances of the distributions are obtained from the delta expansion suggested by Lee, Song and Lee (2012). We compare the newly suggested estimators with other existing estimators by simulation study. From the simulation study we find the maximum pseudo-likelihood estimator has very similar properties with the maximum likelihood estimator. Also the maximum pseudo-likelihood estimator is easy to apply to general diffusion models, and can be obtained by simple numerical steps.

• Communications for Statistical Applications and Methods
• /
• 제17권3호
• /
• pp.451-457
• /
• 2010

This paper considers the problem of nonparametric deconvolution density estimation when sample observa-tions are contaminated by double exponentially distributed errors. Three different deconvolution density estima-tors are introduced: a weighted kernel density estimator, a kernel density estimator based on the support vector regression method in a RKHS, and a classical kernel density estimator. The performance of these deconvolution density estimators is compared by means of a simulation study.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권9호
• /
• pp.2170-2190
• /
• 2012

There are nowadays strong demands for intelligent surveillance systems, which can infer or understand more complex behavior. The application of crowd density estimation methods could lead to a better understanding of crowd behavior, improved design of the built environment, and increased pedestrian safety. In this paper, we propose a new crowd density estimation method, which aims at estimating not only a moving crowd, but also a stationary crowd, using images captured from surveillance cameras situated in various public locations. The crowd density of the moving people is measured, based on the moving area during a specified time period. The moving area is defined as the area where the magnitude of the accumulated optical flow exceeds a predefined threshold. In contrast, the stationary crowd density is estimated from the coarseness of textures, under the assumption that each person can be regarded as a textural unit. A multilayer neural network is designed, to classify crowd density levels into 5 classes. Finally, the proposed method is experimented with PETS 2009 and the platform of Gangnam subway station image sequences.