• 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.

• Korean Journal of Remote Sensing
• /
• v.26 no.3
• /
• pp.325-333
• /
• 2010

Image registration involves overlapping images of an identical region and assigning the data into one coordinate system. Image registration has proved important in remote sensing, enabling registered satellite imagery to be used in various applications such as image fusion, change detection and the generation of digital maps. The image descriptor, which extracts matching points from each image, is necessary for automatic registration of remotely sensed data. Using contrast enhancement algorithms such as histogram equalization and image stretching, the normalized data are applied to the image descriptor. Drawing on the different spectral characteristics of high resolution satellite imagery based on sensor type and acquisition date, the applied normalization method can be used to change the results of matching interest point descriptors. In this paper, the matching points by scale invariant feature transformation (SIFT) are extracted using various contrast enhancement algorithms and injection of Gaussian noise. The results of the extracted matching points are compared with the number of correct matching points and matching rates for each point.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.1
• /
• pp.115-123
• /
• 2011

In this paper, we develop the noninformative priors for stress-strength reliability from the Pareto distributions. We develop the matching priors and the reference priors. It turns out that the second order matching prior does not match the alternative coverage probabilities, and is not a highest posterior density matching or a cumelative distribution function matching priors. Also we reveal that the one-at-a-time reference prior and Jeffreys' prior are the second order matching prior. We show that the proposed reference prior matches the target coverage probabilities in a frequentist sense through simulation study, and an example is given.

• The Journal of Society for e-Business Studies
• /
• v.8 no.3
• /
• pp.117-130
• /
• 2003

It is not unusual to observe that there Is a great amount of redundant or inconsistent data even within an e-business system such as CRM(Customer Relationship Management) system. This problem becomes aggravate when we construct a system of which information are gathered from different sources. Data quality management is indeed needed to avoid any possible redundant or inconsistent data in such information system. A data quality process, in general, consists of three phases: data cleaning (scrubbing), matching, and integration phase. In this paper, we introduce and categorize data quality operators for each phase. Then, we describe our distance function used in the matching phase, and present a matching algorithm PRIMAL (a PRactical Matching Algorithm). And finally, we present a related work and future research.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.1
• /
• pp.23-28
• /
• 2013

The process of a feature matching for two different spatial data sets is similar to the process of classification as a binary class such as matching or non-matching. In this paper, we calculated a threshold by applying an equal error rate (EER) which is widely used in biometrics that classification is a main topic into spatial data sets. In a process of discriminating what's a matching or what's not, a precision and a recall is changed and a trade-off appears between these indexes because the number of matching pairs is changed when a threshold is changed progressively. This trade-off point is EER, that is, threshold. To the result of applying this method into training data, a threshold is estimated at 0.802 of a value of shape similarity. By applying the estimated threshold into test data, F-measure that is a evaluation index of matching method is highly value, 0.940. Therefore we confirmed that an accurate threshold is calculated by EER without person intervention and this is appropriate to matching different spatial data sets.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.2
• /
• pp.565-575
• /
• 2016

In this paper, we develop the noninformative priors for the linear combinations of means in the exponential distributions. We develop the matching priors and the reference priors. The matching priors, the reference prior and Jeffreys' prior for the linear combinations of means are developed. It turns out that the reference prior and Jeffreys' prior are not a matching prior. We show that the proposed matching prior matches the target coverage probabilities much more accurately than the reference prior and Jeffreys' prior in a frequentist sense through simulation study, and an example based on real data is given.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.4
• /
• pp.833-841
• /
• 2012

In this paper, we develop the noninformative priors for the ratio of the scale parameters in the half logistic distributions. We develop the first and second order matching priors. It turns out that the second order matching prior matches the alternative coverage probabilities, and is a highest posterior density matching prior. Also we reveal that the one-at-a-time reference prior and Jeffreys' prior are the second order matching prior. We show 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.

• Communications for Statistical Applications and Methods
• /
• v.30 no.1
• /
• pp.1-19
• /
• 2023

Observational data with missing or incomplete data are common in biomedical research. Multiple imputation is an effective approach to handle missing data with the ability to decrease bias while increasing statistical power and efficiency. In recent years propensity score (PS) matching has been increasingly used in observational studies to estimate treatment effect as it can reduce confounding due to measured baseline covariates. In this paper, we describe in detail approaches to competing risk analysis in the setting of incomplete observational data when using PS matching. First, we used multiple imputation to impute several missing variables simultaneously, then conducted propensity-score matching to match statin-exposed patients with those unexposed. Afterwards, we assessed the effect of statin exposure on the risk of heart failure-related hospitalizations or emergency visits by estimating both relative and absolute effects. Collectively, we provided a general methodological framework to assess treatment effect in incomplete observational data. In addition, we presented a practical approach to produce overall cumulative incidence function (CIF) based on estimates from multiple imputed and PS-matched samples.

• Journal of Cadastre & Land InformatiX
• /
• v.44 no.1
• /
• pp.127-138
• /
• 2014

It can be effective to extract and apply the updated information from the newly updated map data for updating road data of topographic map. In this study, update target data and update reference data are overlaid and the update objects are explored using network matching technique. And the network objects are classified into five matching and update cases and the update processes for each case are applied to the test data. For this study, road centerline data of digital topographic map is used as an update target data and road data of Korean Address Information System is used as an update reference data. The buffer-based network matching method is applied to the two data and the matching and update cases are classified after calculating the overlaid ratio of length. The newly updated road centerline data of digital topographic map is generated from the application of update process for each case. As a result, the update information can be extracted from the different map dataset and applied to the road network data updating.

• Journal of the Korean Society of Safety
• /
• v.37 no.1
• /
• pp.41-48
• /
• 2022

Bridge engineering documents have essential contents that must be referenced continuously throughout a structure's entire life cycle, but research related to the quality of the contents is still lacking. XML schema matching is an excellent technique to improve the quality of stored data; however, it takes excessive computing time when applied to documents with many contents and a deep hierarchical structure, such as bridge engineering documents. Moreover, it requires a manual parametric study for matching elements' weight factors, maintaining a high matching accuracy. This study proposes an efficient weight-factor determination method based on an artificial neural network (ANN) model using the simplified XML schema-matching method proposed in a previous research to reduce the computing time. The ANN model was generated and verified using 580 data of document properties, weight factors, and matching accuracy. The proposed ANN-based schema-matching method showed superiority in terms of accuracy and efficiency compared with the previous study on XML schema matching for bridge engineering documents.