• Journal of applied mathematics & informatics
• /
• 제33권1_2호
• /
• pp.203-210
• /
• 2015

We consider fractional Brownian motion and FARIMA process with Gaussian innovations and show that the suitably scaled distributions of the FARIMA processes converge to fractional Brownian motion in the sense of finite dimensional distributions. We figure out ACF function and estimate the self-similarity parameter H of FARIMA(0, d, 0) by using R/S method. Finally, we display power spectrum density of FARIMA process.

• International Journal of CAD/CAM
• /
• 제9권1호
• /
• pp.31-36
• /
• 2010

3D point data acquired from laser scan or stereo vision can be quite noisy. A preprocessing step is often needed before a surface reconstruction algorithm can be applied. In this paper, we propose a nonparametric approach for noisy point data preprocessing. In particular, we proposed an anisotropic kernel based nonparametric density estimation method for outlier removal, and a hill-climbing line search approach for projecting data points onto the real surface boundary. Our approach is simple, robust and efficient. We demonstrate our method on both real and synthetic point datasets.

• Journal of the Korean Data and Information Science Society
• /
• 제14권2호
• /
• pp.247-255
• /
• 2003

Hypothesis testing for the equality of two distributions were considered. Nonparametric kernel density estimates were used for testing equality of distributions. Cross-validatory choice of bandwidth was used in the kernel density estimation. Sampling distribution of considered test statistic were developed by resampling method, called the bootstrap. Small sample Monte Carlo simulation were conducted. Empirical power of considered tests were compared for variety distributions.

• Journal of the Korean Data and Information Science Society
• /
• 제16권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 of the Korean Data and Information Science Society
• /
• 제23권4호
• /
• pp.765-775
• /
• 2012

교차타당성은 커널추정량의 평활모수인 띠폭의 선택 방법으로 흔히 활용되고 있다. 연속인 확률밀도함수의 커널추정량의 띠폭 선택으로 널리 쓰이는 교차타당성 방법으로는 최대가능도교차타당성과 더불어 최소제곱교차타당성과 편의교차타당성이 있다. 확률밀도함수가 하나의 불연속점을 가질 때, Huh (2012)는 불연속점 추정을 위한 커널추정량의 띠폭 선택으로 최대가능도교차타당성을 이용한 방법을 제시하였다. 본 연구에서는 Huh (2012)에 의해 최대가능도교차타당성으로 제안된 띠폭선택의 방법과 같이 한쪽방향커널함수를 이용한 최소제곱교차타당성과 편의교차타당성으로 띠폭 선택 방법을 제시하고, 이들 띠폭 선택 방법들과 Huh (2012)의 최대가능도교차타당성을 이용한 띠폭 선택 방법을 모의실험을 통하여 비교연구 하고자 한다.

• 한국지능시스템학회논문지
• /
• 제19권3호
• /
• pp.311-316
• /
• 2009

본 논문에서는 파티클 필터(Particle Filter)를 사용한 모바일 감시 로봇을 위한 실시간 움직임 추정 알고리즘을 제안한다. 파티클 필터는 몬테카를로(Monte Carlo) 샘플링 방법을 기반으로 사전분포확률(Prior distribution probability)와 사후분포확률(Posterior distribution probability)을 가지는 베이지안 조건 확률 모델(Bayesian conditional probabilities model)을 사용하는 방법이다. 그러나 대부분의 파티클 필터에서는 초기 확률밀도(Prior probability density)를 임의로 정의하여 사용하지만, 본 논문에서는 Sum of Absolute Difference (SAD)를 이용하여 초기 확률밀도를 구하고, 이를 파티클 필터에 적용하여 모바일 감시 로봇 환경에서 임의로 움직이는 물체를 강인하게 실시간으로 추정하고 추적하는 시스템을 구현하였다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제13권3호
• /
• pp.186-199
• /
• 2013

We pose pattern classification as a density estimation problem where we consider mixtures of generative models under partially labeled data setups. Unlike traditional approaches that estimate density everywhere in data space, we focus on the density along the decision boundary that can yield more discriminative models with superior classification performance. We extend our earlier work on the recursive estimation method for discriminative mixture models to semi-supervised learning setups where some of the data points lack class labels. Our model exploits the mixture structure in the functional gradient framework: it searches for the base mixture component model in a greedy fashion, maximizing the conditional class likelihoods for the labeled data and at the same time minimizing the uncertainty of class label prediction for unlabeled data points. The objective can be effectively imposed as individual mixture component learning on weighted data, hence our mixture learning typically becomes highly efficient for popular base generative models like Gaussians or hidden Markov models. Moreover, apart from the expectation-maximization algorithm, the proposed recursive estimation has several advantages including the lack of need for a pre-determined mixture order and robustness to the choice of initial parameters. We demonstrate the benefits of the proposed approach on a comprehensive set of evaluations consisting of diverse time-series classification problems in semi-supervised scenarios.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권12호
• /
• pp.6009-6027
• /
• 2019

Support vector machine (SVM) classifiers have been widely used for object detection. These methods usually locate the object by finding the region with maximal score in an image. With bag-of-features representation, the SVM score of an image region can be written as the sum of its inside feature-weights. As a result, the searching process can be executed efficiently by using strategies such as branch-and-bound. However, the feature-weight derived by optimizing region classification cannot really reveal the category knowledge of a feature-point, which could cause bad localization. In this paper, we represent a region in an image by a collection of local feature-points and determine the object by the region with the maximum posterior probability of belonging to the object class. Based on the Bayes' theorem and Naive-Bayes assumptions, the posterior probability is reformulated as the sum of feature-scores. The feature-score is manifested in the form of the logarithm of a probability ratio. Instead of estimating the numerator and denominator probabilities separately, we readily employ the density ratio estimation techniques directly, and overcome the above limitation. Experiments on a car dataset and PASCAL VOC 2007 dataset validated the effectiveness of our method compared to the baselines. In addition, the performance can be further improved by taking advantage of the recently developed deep convolutional neural network features.

• 한국음향학회지
• /
• 제13권4호
• /
• pp.20-31
• /
• 1994

다중 정현파의 주파수를 추정하는 최우도(ML) 방법은 주파수 추정에 정밀도를 보여주고 있으나, 최우도 함수가 주파수 추정에 쓰이는 경우 고도의 비선형성 때문에 추정에 많은 희생을 요구하고 있다. 본 논문에서는 최우도 방법의 비선형성을 개선하기 위해, 신호속에 포함된 정현 주파수의 추정을 용이하게 할 수 있는 단순화된 최우도 방법을 제시한다. 이 새로운 주파수 추정 방법을 백색 또는 칼라 잡음의 보기들에 적용하고, Monte-carlo 시뮬레이션을 실행하여 통계적 평균값, 평균 제곱근 및 상대 바이어스를 기존의 가장 우수한 방법인 MFBLP 방법과 비교한다. 또한 스펙트럼 파우어 밀도와 단위 원에서의 주파수 위치를 그림을 통하여 나타낸다.

• Structural Engineering and Mechanics
• /
• 제68권1호
• /
• pp.39-51
• /
• 2018

In this study, a frequency domain model updating method is presented using power spectral density (PSD) data. It uses the sensitivity of PSD function with respect to the unknown structural parameters through a decomposed form of transfer function. The stiffness parameters are captured with high accuracy through solving the sensitivity equations utilizing the least square approach. Using numerically noise polluted data, the model updating results of a truss model prove robustness of the method against measurement and mass modelling errors. Results prove the capabilities of the method for parameter estimation using highly noise polluted data of low ranges of excitation frequency.