• Communications for Statistical Applications and Methods
• /
• 제8권1호
• /
• pp.29-37
• /
• 2001

In this paper, we consider the second order probability matching criterion for the ratio of the variance components under the one-way random effect model. It turns out that among all of the reference priors given in Ye(1994), the only one reference prior satisfies the second order matching criterion. Similar results are also obtained for the intraclass correlation as well.

• Journal of the Korean Data and Information Science Society
• /
• 제15권4호
• /
• pp.981-992
• /
• 2004

In this paper, we develop the noninformative priors for the common scale parameter in the inverse gaussian distributions. We developed the first and second order matching priors. Next we revealed that the second order matching prior satisfies a HPD matching criterion. Also we showed that the second order matching prior matches alternative coverage probabilities up to the second order. It turns out that the one-at-a-time reference prior satisfies a second order matching criterion. Some simulation study is performed.

• Journal of the Korean Data and Information Science Society
• /
• 제17권2호
• /
• pp.559-568
• /
• 2006

In this paper, we develop the noninformative priors for the linear mixed models when the parameter of interest is the ratio of variance components. We developed the first and second order matching priors. We reveal that the one-at-a-time reference prior satisfies the second order matching criterion. It turns out that the two group reference prior satisfies a first order matching criterion, but Jeffreys' prior is not first order matching prior. Some simulation study is performed.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제27권5호
• /
• pp.543-550
• /
• 2000

블럭 정합 알고리즘의 VLSI 구현시 복잡도를 줄이고, 수행 속도를 높이기 위하여 새로운 정합 기준인 적응적 비트 축소 MAD(adaptive bit-reduced mean absolute difference:ABRMAD)를 제안한다. ABRMAD는 기존의 MAD에서 화소의 모든 비트를 비교하는 대신, 화소를 구성하는 중요한 비트만을 고려하여 축소된 화소 값을 비교하여 움직임 벡터를 찾는다. 실험을 통하여, 제안한 정합 기준은 기존의 MAD 정합 기준에 비하여 낮은 하드웨어 복잡도를 가지면서 MSE(mean square error) 측면에서 유사한 성능을 가짐을 보인다. 또한 기존의 비트 수 축소형 정합 기준인 DPC(difference pixel counting), BBME(binary-matching with edge-map), 그리고 BPM(bit-plane matching)과 비교하여 같은 수의 비트를 사용하였을 경우 좋은 MSE 성능을 가짐을 보인다.

• 방송공학회논문지
• /
• 제18권5호
• /
• pp.730-737
• /
• 2013

본 논문은 정합 오차 기준을 확장한 제한된 1비트 변환 (Constrained One-Bit Transform : C1BT) 기반의 움직임 예측 알고리즘을 제안하였다. 제한된 1비트 변환 기반의 움직임 예측 알고리즘에서는 정합 오차 기준으로 기존의 움직임 예측 방법인 전역 탐색 알고리즘 (Full Search Algorithm: FSA)에서 사용되는 SAD (Sum of Absolute Differences) 대신 NNMP (Number of Non-Matching Points)를 사용하여 하드웨어 구현을 용이하게 하고 연산량을 크게 줄였으나 움직임 예측의 정확도를 감소시켰다. 이 점을 개선하고자 이 논문에서는 제한된 1비트 변환의 정합 오차 기준을 확장하여 움직임 예측의 정확도를 높이는 알고리즘을 제안하였고 이는 기존의 알고리즘과 비교한 결과 PSNR (Peak Signal to Nosie Ratio) 측면에서 더 우수한 성능을 보였다.

• Journal of the Korean Data and Information Science Society
• /
• 제13권2호
• /
• pp.317-328
• /
• 2002

We first derive group ordering reference priors in a two-way mixed-effects analysis of variance (ANOVA) model. We show that posterior distributions are proper and provide marginal posterior distributions under reference priors. We also examine whether the reference priors satisfy the probability matching criterion. Finally, the reference prior satisfying the probability matching criterion is shown to be good in the sense of frequentist coverage probability of the posterior quantile.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.670-674
• /
• 2005

$D^*$ criterion is defined as a reference of the handling quality and ride comfortableness for lateral-directional automobile motion. However it is generally difficult to obtain the satisfied handling quality and ride comfortableness based on $D^*$ criterion by conventional two wheel steering system. In this study, a design method of model matching control system is proposed to obtain the satisfied $D^*$ response of 4 Wheel Steering.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1996년도 학술대회
• /
• pp.217-220
• /
• 1996

This paper describes a new hierarchial block matching algorithm especially appropriate for a large search area. The proposed algorithm consists of higher level search for an initial motion vector estimate by using a new matching criterion over the evenly subsampled search points, and lower level search for the final motion vector refinement. In the higher level matching criterion, mean absolute differences at the search points (or motion vector candidates) similar to motion vectors of causally neighboring blocks, are weighted properly so that these points can have a higher chance to being selected. The proposed algorithm outperforms existing hierarchical block matching algorithms, and its computational regularity makes hardware implementation simple.

• 한국소음진동공학회논문집
• /
• 제24권4호
• /
• pp.310-316
• /
• 2014

The location template matching(LTM) method is a technique of identifying an impact location on a structure, and requires a certain measure of similarity between two time signals. In general, the correlation coefficient is widely used as the measure of similarity, while the group delay based method is recently proposed to improve the accuracy of the impact localization. Another possible measure is the frequency response assurance criterion(FRAC), though this has not been applied yet. In this paper, these three different measures of similarity are examined comparatively by using experimental data in order to understand the properties of these measures of similarity. The comparative study shows that the correlation coefficient and the FRAC give almost the same information while the group delay based method gives the shape oriented information that is best suitable for the location template matching method.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2014년도 춘계학술대회 논문집
• /
• pp.506-511
• /
• 2014

The location template matching (LTM) method is a technique of identifying an impact location on a structure, and requires a certain measure of similarity between two time signals. In general, the correlation coefficient is widely used as the measure of similarity, while the group delay based method is recently proposed to improve the accuracy of the impact localization. Another possible measure is the frequency response assurance criterion (FRAC), though this has not been applied yet. In this paper, these three different measures of similarity are examined comparatively by using experimental data in order to understand the properties of these measures of similarity. The comparative study shows that the correlation coefficient and the FRAC give almost the same information while the group delay based method gives the shape oriented information that is best suitable for the location template matching method.