• Title/Summary/Keyword: Model matching

Search Result 1,365, Processing Time 0.029 seconds

Eigenvalue and Frequency Response Analyses of a Hard Disk Drive Actuator Using Reduced Finite Element Models (축소된 유한요소모델을 이용한 하드디스크 구동부의 고유치 및 주파수응답 해석)

  • Han, Jeong-Sam
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.31 no.5
    • /
    • pp.541-549
    • /
    • 2007
  • In the case of control for mechanical systems, it is highly useful to be able to provide a compact model of the mechanical system to control engineers using the smallest number of state variables, while still providing an accurate model. The reduced mechanical model can then be inserted into the complete system models and used for extended system-level dynamic simulation. In this paper, moment-matching based model order reductions (MOR) using Krylov subspaces, which reduce the number of degrees of freedom of an original finite element model via the Arnoldi process, are presented to study the eigenvalue and frequency response problems of a HDD actuator and suspension system.

Matching Conditions for Predicting the Random Effects in ANOVA Models

  • Chang, In-Hong
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2006.04a
    • /
    • pp.1-6
    • /
    • 2006
  • We consider the issue of Bayesian prediction of the unobservable random effects, And we characterize priors that ensure approximate frequentist validity of posterior quantiles of unobservable random effects. Finally we show that the probability matching criteria for prediction of unobservable random effects in one-way random ANOVA model.

  • PDF

Noninformative Priors for the Ratio of the Failure Rates in Exponential Model

  • Cho, Jang-Sik;Baek, Sung-Uk
    • Journal of the Korean Data and Information Science Society
    • /
    • v.13 no.2
    • /
    • pp.217-226
    • /
    • 2002
  • In this paper, we derive noninformative priors for the ratio of failure rates in exponential model. A class of priors is found by matching the coverage probabilities of one-sided Baysian credible interval with the corresponding frequentist coverage probabilities. And we prove that the noninformative prior matches the alternative coverage probabilities and is a HPD matching prior up to the second order. Finally, we provide simulated freqentist coverage probabilities under the derived noninformative prior for small samples.

  • PDF

Efficient Calculation of a Step Discontinuity for Shielded-Microstrip using Vector Finite Element (VFEM) and Mode Matching Method

  • Kim, Young-Tae;Park, Jun-Seok;Kim, Hyeong-Seok
    • KIEE International Transactions on Electrophysics and Applications
    • /
    • v.2C no.5
    • /
    • pp.268-272
    • /
    • 2002
  • In this paper, we proposed a procedure to analyze a shielded-microstrip step discontinuity using the mode matching method (MMM) combined with the vector finite element method (VFEM), which is used to find the equivalent waveguide-model for a microstrip. In order to calculate the effective-widths and -dielectric permittivity of the equivalent waveguide-model corresponding shielded-microstrip, the propagation constant and characteristic impedance are calculated from the VFEM. MMM is then applied to find the scattering parameter in the planar waveguide. This technique makes it possible to take advantage of the high accuracy of the VFEM as well as the high efficiency of the MMM.

Velocity Matching Algorithm Using Robust H$_2$Filter (강인한 H$_2$필터를 이용한 속도정합 알고리즘)

  • Yang, Cheol-Kwan;Shim, Duk-Sun;Park, Chan-Gook
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.7 no.4
    • /
    • pp.362-368
    • /
    • 2001
  • We study on the velocity matching algorithm for transfer alignment of inertial navigation system(INS) using a robust H$_2$ filter. We suggest an uncertainty model and a discrete robust H$_2$filter for INS and apply the suggested robust H$_2$ filter to the uncertainty model. The discrete robust H$_2$filter is shown by simulation to have better performance time and accuracy than Kalman filter.

  • PDF

A Corner Matching Algorithm with Uncertainty Handling Capability

  • Lee, Kil-jae;Zeungnam Bien
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1997.11a
    • /
    • pp.228-233
    • /
    • 1997
  • An efficient corner matching algorithm is developed to minimize the amount of calculation. To reduce the amount of calculation, all available information from a corner detector is used to make model. This information has uncertainties due to discretization noise and geometric distortion, and this is represented by fuzzy rule base which can represent and handle the uncertainties. Form fuzzy inference procedure, a matched segment list is extracted, and resulted segment list is used to calculate the transformation between object of model and scene. To reduce the false hypotheses, a vote and re-vote method is developed. Also an auto tuning scheme of the fuzzy rule base is developed to find out the uncertainties of features from recognized results automatically. To show the effectiveness of the developed algorithm, experiments are conducted for images of real electronic components.

  • PDF

Image Feature Point Selection Method Using Nearest Neighbor Distance Ratio Matching (최인접 거리 비율 정합을 이용한 영상 특징점 선택 방법)

  • Lee, Jun-Woo;Jeong, Jea-Hyup;Kang, Jong-Wook;Na, Sang-Il;Jeong, Dong-Seok
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.12
    • /
    • pp.124-130
    • /
    • 2012
  • In this paper, we propose a feature point selection method for MPEG CDVS CE-7 which is processing on International Standard task. Among a large number of extracted feature points, more important feature points which is used in image matching should be selected for the compactness of image descriptor. The proposed method is that remove the feature point in the extraction phase which is filtered by nearest neighbor distance ratio matching in the matching phase. We can avoid the waste of the feature point and employ additional feature points by the proposed method. The experimental results show that our proposed method can obtain true positive rate improvement about 2.3% in pair-wise matching test compared with Test Model.

A Study on Determination of the Matching Size of IKONOS Stereo Imagery (IKONOS 스테레오 영상의 매칭사이즈 결정연구)

  • Lee, Hyo-Seong;Ahn, Ki-Weon;Lee, Chang-No;Seo, Doo-Cheon
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2007.04a
    • /
    • pp.201-205
    • /
    • 2007
  • In the post-Cold War era, acquisition technique of high-resolution satellite imagery (HRSI) has begun to commercialize. IKONOS-2 satellite imaging data is supplied for the first time in the 21st century. Many researchers testified mapping possibility of the HRSI data instead of aerial photography. It is easy to renew and automate a topographical map because HRSI not only can be more taken widely and periodically than aerial photography, but also can be directly supplied as digital image. In this study matching size of IKONOS Geo-level stereo image is presented lot production of digital elevation model (DEM). We applied area based matching method using correlation coefficient of pixel brightness value between the two images. After matching line (where "matching line" implies straight line that is approximated to complex non-linear epipolar geometry) is established by exterior orientation parameters (EOPs) to minimize search area, the matching is tarried out based on this line. The experiment on matching size is performed according to land cover property, which is divided off into four areas (water, urban land, forest land and agricultural land). In each of the test areas, window size for the highest correlation coefficient is selected as propel size for matching. As the results of experiment, the proper size was selected as $123{\times}123$ pixels window, $13{\times}13$ pixels window, $129{\times}129$ pixels window and $81{\times}81$ pixels window in the water area, urban land, forest land and agricultural land, respectively. Of course, determination of the matching size by the correlation coefficient may be not absolute appraisal method. Optimum matching size using the geometric accuracy therefore, will be presented by the further work.

  • PDF

Visualization Tool of Distortion-Free Time-Series Matching (왜곡 제거 시계열 매칭의 시각화 도구)

  • Moon, Seongwoo;Lee, Sanghun;Kim, Bum-Soo;Moon, Yang-Sae
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.4 no.9
    • /
    • pp.377-384
    • /
    • 2015
  • In this paper we propose a visualization tool for distortion-free time-series matching. Supporting distortion-free is a very important factor in time-series matching to get more accurate matching results. In this paper, we visualize the result of time-series matching, which removes various time-series distortions such as noise, offset translation, amplitude scaling, and linear trend by using moving average, normalization, linear detrending transformations, respectively. The proposed visualization tool works as a client-server model. The client sends a user-selected time-series, of which distortions are removed, to the server and visualizes the matching results. The server efficiently performs the distortion-free time-series matching on the multi-dimensional R*-tree index. By visualizing the matching result as five different charts, we can more easily and more intuitively understand the matching result.

Real-time Hausdorff Matching Algorithm for Tracking of Moving Object (이동물체 추적을 위한 실시간 Hausdorff 정합 알고리즘)

  • Jeon, Chun;Lee, Ju-Sin
    • The KIPS Transactions:PartB
    • /
    • v.9B no.6
    • /
    • pp.707-714
    • /
    • 2002
  • This paper presents a real-time Hausdorff matching algorithm for tracking of moving object acquired from an active camera. The proposed method uses the edge image of object as its model and uses Hausdorff distance as the cost function to identify hypothesis with the model. To enable real-time processing, a high speed approach to calculate Hausdorff distance and half cross matching method to improve performance of existing search methods are also presented. the experimental results demonstrate that the proposed method can accurately track moving object in real-time.