• 한국데이터정보과학회:학술대회논문집
• /
• 2005.10a
• /
• pp.27-34
• /
• 2005

We consider the problem of estimating the system reliability noninformative priors when both stress and strength follow generalized gamma distributions. We first derive Jeffreys' prior, group ordering reference priors, and matching priors. We investigate the propriety of posterior distributions and provide marginal posterior distributions under those noninformative priors. We also examine whether the reference priors satisfy the probability matching criterion.

• Journal of the Korean Statistical Society
• /
• v.35 no.3
• /
• pp.225-238
• /
• 2006

This paper considers noninformative priors for the scale parameter of exponential distribution when the data are collected in step stress accelerated life tests. We find the Jeffreys' and reference priors for this model and show that the reference prior satisfies first order matching criterion. Also, we show that there exists no second order matching prior in this problem. Some simulation results are given and we perform Bayesian analysis for proposed priors using some data.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.1-10
• /
• 2005

In this Paper, we propose a new block matching a1gorithm that extracts motion vectors from consecutive range data. The proposed method defines a matching metric that integrates intensity, hue, and range. Our algorithm begins matching with a small matching template. If the matching degree is not good enough, we slightly expand the size of a matching template and then repeat the matching process until our matching criterion is satisfied or the predetermined maximum size has been reached. As the iteration proceeds, we adaptively adjust weights of the matching metric by considering the importance of each feature. In the experiments, we show that our block matching approach can work as a promising solution by comparing the proposed method with previously known method in terms of performance.

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

In this paper, we develop the noninformative priors for the common intraclass correlation coefficient when independent samples drawn from multivariate normal populations. We derive the first and second order matching priors. We reveal that the second order matching prior dose not match alternative coverage probabilities up to the second order and is not a HPD matching prior. It turns out that among all of the reference priors, one-at-a-time reference prior satisfies a second order matching criterion. Our simulation study indicates that one-at-a-time reference prior performs better than the other reference priors in terms of matching the target coverage probabilities in a frequentist sense.

• Journal of the Korean Statistical Society
• /
• v.32 no.3
• /
• pp.271-288
• /
• 2003

In this paper, when the variance of the normal distribution is related to the mean, we develop noninformative priors such as matching priors and reference priors. We prove that the second order matching prior matches alternative coverage probabilities up to the same order and also it is a HPD matching prior. It turns out that one-at-a-time reference prior satisfies a second order matching criterion. Then using these noninformative priors, we develop a Bayesian test procedure for the equality of the means and variances of two independent normal distributions using fractional Bayes factor. Some simulation study is performed, and a real data example is also provided.

• The Journal of Korea Robotics Society
• /
• v.17 no.3
• /
• pp.373-380
• /
• 2022

This paper considers a method of fast correspondence matching for iterative closest point (ICP) algorithm. In robotics, the ICP algorithm and its variants have been widely used for pose estimation by finding the translation and rotation that best align two point clouds. In computational perspectives, the main difficulty is to find the correspondence point on the reference point cloud to each observed point. Jump-table-based correspondence matching is one of the methods for reducing computation time. This paper proposes a method that corrects errors in an existing jump-table-based correspondence matching algorithm. The criterion activating the use of jump-table is modified so that the correspondence matching can be applied to the situations, such as point-cloud registration problems with highly curved surfaces, for which the existing correspondence-matching method is non-applicable. For demonstration, both hardware and simulation experiments are performed. In a hardware experiment using Hokuyo-10LX LiDAR sensor, our new algorithm shows 100% correspondence matching accuracy and 88% decrease in computation time. Using the F1TENTH simulator, the proposed algorithm is tested for an autonomous driving scenario with 2D range-bearing point cloud data and also shows 100% correspondence matching accuracy.

• 한국데이터정보과학회:학술대회논문집
• /
• 2005.04a
• /
• pp.135-144
• /
• 2005

In this paper, we develop the noninformative priors for the exponential models when the parameter of interest is the difference of two means. We develop the first and second order matching priors. We reveal that the second order matching priors do not exist. It turns out that Jeffreys' prior does not satisfy a first order matching criterion. The Bayesian credible intervals based on the first order matching meet the frequentist target coverage probabilities much better than the frequentist intervals of Jeffreys' prior.

• Communications for Statistical Applications and Methods
• /
• v.14 no.2
• /
• pp.431-442
• /
• 2007

In this paper, we develop the noninformative priors when the parameter of interest is the difference between quantiles of two exponential distributions. We want to develop the first and second order probability matching priors. But we prove that the second order probability matching prior does not exist. It turns out that Jeffreys' prior does not satisfy the first order matching criterion. The Bayesian credible intervals based on the first order probability matching prior meet the frequentist target coverage probabilities much better than the frequentist intervals of Jeffreys' prior. Some simulation and real example will be given.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.4
• /
• pp.1067-1078
• /
• 2005

In this paper, we develop the noninformative priors for the exponential models when the parameter of interest is the difference of two means. We develop the first and second order matching priors. We reveal that the second order matching priors do not exist. It turns out that Jeffreys' prior does not satisfy the first order matching criterion. The Bayesian credible intervals based on the first order matching meet the frequentist target coverage probabilities much better than the frequentist intervals of Jeffreys' prior.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.1
• /
• pp.171-178
• /
• 2013

In this paper, we develop noninformative priors for the generalized Pareto distribution when the parameter of interest is the shape parameter. We developed the first order and the second order matching priors.We revealed that the second order matching prior does not exist. It turns out that the reference prior satisfies a first order matching criterion, but Jeffrey's prior is not a first order matching prior. Some simulation study is performed and a real example is given.