• Title/Summary/Keyword: matching criterion

Search Result 85, Processing Time 0.022 seconds

On Second Order Probability Matching Criterion in the One-Way Random Effect Model

  • Kim, Dal Ho;Kang, Sang Gil;Lee, Woo Dong
    • Communications for Statistical Applications and Methods
    • /
    • v.8 no.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.

  • PDF

Noninformative Priors for the Common Scale Parameter in the Inverse Gaussian Distributions

  • Kang, Sang-Gil
    • Journal of the Korean Data and Information Science Society
    • /
    • v.15 no.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.

  • PDF

Bayesian Analysis for the Ratio of Variance Components

  • Kang, Sang-Gil
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.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.

  • PDF

An Adaptive Bit-reduced Mean Absolute Difference Criterion for Block-Matching Algorithm and Its VlSI Implementation (블럭 정합 알고리즘을 위한 적응적 비트 축소 MAD 정합 기준과 VLSI 구현)

  • Oh, Hwang-Seok;Baek, Yun-Ju;Lee, Heung-Kyu
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.5
    • /
    • pp.543-550
    • /
    • 2000
  • An adaptive bit-reduced mean absolute difference (ABRMAD) is presented as a criterion for the block-matching algorithm (BMA) to reduce the complexity of the VLSI Implementation and to improve the processing time. The ABRMAD uses the lower pixel resolution of the significant bits instead of full resolution pixel values to estimate the motion vector (MV) by examining the pixels Ina block. Simulation results show that the 4-bit ABRMAD has competitive mean square error (MSE)results and a half less hardware complexity than the MAD criterion, It has also better characteristics in terms of both MSE performance and hardware complexity than the Minimax criterion and has better MSE performance than the difference pixel counting(DPC), binary block-matching with edge-map(BBME), and bit-plane matching(BPM) with the same number of bits.

  • PDF

Constrained One-Bit Transform based Motion Estimation using Extension of Matching Error Criterion (정합 오차 기준을 확장한 제한된 1비트 변환 알고리즘 기반의 움직임 예측)

  • Lee, Sanggu;Jeong, Jechang
    • Journal of Broadcast Engineering
    • /
    • v.18 no.5
    • /
    • pp.730-737
    • /
    • 2013
  • In this paper, Constrained One-Bit Transform (C1BT) based motion estimation using extension of matching error criterion is proposed. C1BT based motion estimation algorithm exploiting Number of Non-Matching Points (NNMP) instead of Sum of Absolute Differences (SAD) that used in the Full Search Algorithm (FSA) facilitates hardware implementation and significantly reduces computational complexity. However, the accuracy of motion estimation is decreased. To improve inaccurate motion estimation, this algorithm based motion estimation extending matching error criterion of C1BT is proposed in this paper. Experimental results show that proposed algorithm has better performance compared with the conventional algorithm in terms of Peak-Signal-to-Noise-Ratio (PSNR).

Reference Priors in a Two-Way Mixed-Effects Analysis of Variance Model

  • Chang, In-Hong;Kim, Byung-Hwee
    • Journal of the Korean Data and Information Science Society
    • /
    • v.13 no.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.

  • PDF

D$^*$Model Matching Control System for Four Wheel Steering

  • Asara, Naoki;Osa, Yasuhiro;Uchikado, Shigeru;Kanai, Kimio
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • 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.

  • PDF

Fast Hierarchical Block Matching Algorithm by Adaptively Using Spatial Correlation of Motion Field (운동영역의 상관성을 선택적으로 이용한 고속 움직임 추정 기법)

  • 임경원;송병철;나종범
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1996.06a
    • /
    • 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.

  • PDF

Comparative Study on the Measures of Similarity for the Location Template Matching(LTM) Method (Location Template Matching(LTM) 방법에 사용되는 유사성 척도들의 비교 연구)

  • Shin, Kihong
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.24 no.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.

Comparative Study on the Measures of Similarity for the Location Template Matching (LTM) Method (Location Template Matching(LTM) 방법에 사용되는 유사성 척도들의 비교 연구)

  • Shin, Kihong
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2014.04a
    • /
    • 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.

  • PDF