• Journal of the Korean Data and Information Science Society
• /
• 제26권1호
• /
• pp.243-253
• /
• 2015

In this paper, we develop the noninformative priors for the common shape parameter of several inverse Gaussian distributions. Specially, we want to develop noninformative priors which satisfy certain objective criterion. The probability matching priors and reference priors of the common shape parameter will be developed. It turns out that the second order matching prior does not exist. The reference priors satisfy the first order matching criterion, but Jeffrey's prior is not the first order matching prior. We showed that the proposed reference prior matches the target coverage probabilities in a frequentist sense through simulation study, and an example based on real data is given.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 G
• /
• pp.2225-2227
• /
• 1998

An efficient stereo matching method with variable matching weights is proposed. The edge segment-based stereo matching has been shown to be efficient method. The method includes 5 matching factor with different weights. The ordinary matching weights are not always adequate for every image. Employing different weight sets depending on the complexity shows better matching performance. In this paper, an evaluation criterion for complexity is suggested and the experimental results with the proposed method is shown.

• Journal of the Korean Data and Information Science Society
• /
• 제24권6호
• /
• pp.1521-1529
• /
• 2013

In this paper, we develop noninformative priors for the generalized Pareto distribution when the scale parameter is of interest. We developed the rst 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 and Jeffrey's prior do not satisfy a first order matching criterion, and Jeffreys' prior, the reference prior and the matching prior are different. Some simulation study is performed and a real example is given.

• 품질경영학회지
• /
• 제45권4호
• /
• pp.829-846
• /
• 2017

Purpose: This paper compares the effectiveness of typical selective assembly criteria and suggests the most promising one. Based on the result of a computer simulation, the key issues of selective assembly are examined and the best criterion is recommended from the effectiveness perspective. Methods: Using JAVA program, production of ten thousand units for each pair of components are simulated for selective assembly of the two types. And the number of mismatching and the fraction nonconforming for each criterion are determined. Results: The best match criterion appeared to be most promising from the perspectives of both mismatching and nonconforming problems. Its effectiveness appears to be also good even when the precision of one component is different from that of the other. Conclusion: For designing an optimal method for selective assembly, the best match criterion is recommendable as the base criterion.

• 한국산학기술학회논문지
• /
• 제14권4호
• /
• pp.1951-1956
• /
• 2013

랜덤 순서로 발생된 심볼 열을 기반으로 하는 확률 분포 매칭 타입의 알고리듬들은 그 성능 기준이 바이어스된 신호에 대한 변수를 지니고 있지 않아서 바이어스된 충격성 잡음 하에서는 제한된 성능을 나타낸다. 이 논문에서는 바이어스된 충격성 잡음을 이겨내기 위한 수정된 성능기준을 제안하고, 증강된 필터구조와 랜덤 심볼 열을 사용하는 확률 분포 매칭 방법에 기초한 블라인드 알고리듬을 제안하였다. 시뮬레이션 결과로부터 제안된 성능기준에 의해 만들어진 제안된 알고리듬이 바이어스된 강한 충격성 잡음에 대해 동요됨이 없이 탁월한 수렴성능을 보였다.

• Journal of the Korean Data and Information Science Society
• /
• 제18권1호
• /
• pp.247-257
• /
• 2007

In this paper, we develop the noninformative priors for the common shape parameter in the gamma distributions. We develop the matching priors and reveal that the second order matching prior does not exist. It turns out that the one-at-a-time reference prior and the two group reference prior satisfy a first order probability matching criterion. Some simulation study is peformed.

• Journal of the Korean Data and Information Science Society
• /
• 제22권6호
• /
• pp.1241-1250
• /
• 2011

In this paper, we develop noninformative priors for the log-normal distributions when the parameter of interest is the common mean. We developed Jeffreys' prior, th reference priors and the first order matching priors. It turns out that the reference prior and Jeffreys' prior do not satisfy a first order matching criterion, and Jeffreys' pri the reference prior and the first order matching prior are different. Some simulation study is performed and a real example is given.

• 한국멀티미디어학회논문지
• /
• 제16권4호
• /
• pp.411-417
• /
• 2013

In this paper, we proposed a fast detection method of copy-move forgery image based on low frequency coefficients of the DCT coefficients. We proposed a new matching criterion of copy-moved forgery image detection (MCD) using discrete cosine transform. For each $8{\times}8$ pixel block, the DCT transform is calculated. Our algorithm uses low frequency four (DC, 3 AC coefficient) and six coefficients (DC, 5 AC coefficients) of DCT per $8{\times}8$ pixel block. Our algorithm worked block matching for DCT coefficients of the $8{\times}8$ pixel block is slid by one pixel along the image from the upper left corner to the lower right corner. Our algorithm can reduce computational complexity more than conventional copy moved forgery detection algorithms.

• Journal of the Korean Statistical Society
• /
• 제33권2호
• /
• pp.203-218
• /
• 2004

In this paper, we develop the matching priors and the reference priors for linear combination of the means under the normal populations with equal variances. We prove that the matching priors are actually the second order matching priors and reveal that the second order matching priors match alternative coverage probabilities up to the second order (Mukerjee and Reid, 1999) and also, are HPD matching priors. 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. We compute Bayesian credible intervals for linear combination of the means based on the reference priors.

• 한국통계학회:학술대회논문집
• /
• 한국통계학회 2003년도 추계 학술발표회 논문집
• /
• pp.15-19
• /
• 2003

In this paper, we develop the Jeffreys' prior, reference priors and the probability matching priors for the intraclass correlation coefficient of a symmetric normal distribution. We next verify propriety of posterior distributions under those noninformative priors. We examine whether reference priors satisfy the probability matching criterion.