• Journal of Korean Society of Disaster and Security
• /
• v.12 no.3
• /
• pp.13-24
• /
• 2019

The concept of shape similarity has been applied to verify the accuracy of the SIND model, the real-time prediction model for disaster risk. However, the CRITIC method, one of the most widely used in geometric methodology, is definitely limited to apply to complex shape such as hazard map for coastal disaster. Therefore, we suggested the modified CRITIC method of which we added the shape factors such as RCCI and TF to consider complicated shapes. The matching pairs were manually divided into exact-matching pairs and mis-matching pairs to evaluate the applicability of the new method for shape similarity into hazard maps for storm surges. And the shape similarity of each matching pair was calculated by changing the weights of each shape factor and criteria. Newly proposed methodology and the calculated weights were applied to the objects of the existent hazard map and the results from SIND model. About 90% of exact-matching pairs had the shape similarity of 0.5 or higher, and about 70% of mis-matching pairs were it below 0.5. As future works, if we would calibrate narrowly and adjust carefully multi-objects corresponding to one object, it would be expected that the shape similarity of the exact-matching pairs will increase overall while it of the mis-matching pairs will decrease.

• The Korean Journal of Applied Statistics
• /
• v.25 no.6
• /
• pp.1027-1036
• /
• 2012

Among various biometrics recognition systems, statistical fingerprint recognition matching methods are considered using minutiae on fingerprints. We define similarity distance measures based on the coordinate and angle of the minutiae, and suggest a fingerprint recognition model following statistical distributions. We could obtain confidence intervals of similarity distance for the same and different persons, and optimal thresholds to minimize two kinds of error rates for distance distributions. It is found that the two confidence intervals of the same and different persons are not overlapped and that the optimal threshold locates between two confidence intervals. Hence an alternative statistical matching method can be suggested by using nonoverlapped confidence intervals and optimal thresholds obtained from the distributions of similarity distances.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.98.2-98
• /
• 2002

$\textbullet$ Omnidirectional feature matching $\textbullet$ SVD-based matching algorithm $\textbullet$ Using SSD instead of the zero-mean correlation $\textbullet$ The similarity with the Gaussian weighted $\textbullet$ Low computational cost $\textbullet$ It describes the similarity of the matched pairs in omnidirectional images.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.26 no.5
• /
• pp.609-615
• /
• 2016

Measuring similarity between two signals is a key element of the location template matching (LTM) method which is one of impact source localization technique. As a measure of similarity, the correlation coefficient is most widely used, and the group delay based method is recently proposed to improve the accuracy of finding the impact source. In practice, the LTM method assumes that the similarity between two signals decreases as the distance between two corresponding impact points increases, where the distance between two neighboring impact points defines the grid spacing. In this paper, it is shown that this assumption is not always true but the correlation coefficients fluctuate forming a main robe and many side robes as the distance between two neighboring impact points increases. On the other hand, the standard deviation of group delay sharply increases with a small increase of the grid spacing. These are demonstrated by using a simple cantilever beam. Based on these findings, an optimal way of implementing the LTM method may be suggested by combining the correlation coefficient and the group delay based approaches.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1482-1485
• /
• 2005

An equivalent schema matching among several different source schemas is very important for information integration or mining on the XML based World Wide Web. Finding most similar source schema corresponding mediated schema is a major bottleneck because of the arbitrary nesting property and hierarchical structures of XML DTD schemas. It is complex and both very labor intensive and error prune job. In this paper, we present the first complex matching of XML schema, i.e. XML DTD, inlining two dimensional DTD graph into flat feature values. The proposed method captures not only schematic information but also integrity constraints information of DTD to match different structured DTD. We show the integrity constraints based hierarchical schema matching is more semantic than the schema matching only to use schematic information and stored data.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.1
• /
• pp.32-36
• /
• 2003

An equivalent schema matching among several different source schemas is very important for information integration or mining on the XML based World Wide Web. Finding most similar source schema corresponding mediated schema is a major bottleneck because of the arbitrary nesting property and hierarchical structures of XML DTD schemas. It is complex and both very labor intensive and error prune job. In this paper, we present the first complex matching of XML schema, i.e. XML DTD. The proposed method captures not only schematic information but also integrity constraints information of DTD to match different structured DTD. We show the integrity constraints based hierarchical schema matching is more semantic than the schema matching only to use schematic information and stored data.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.2
• /
• pp.113-121
• /
• 2011

In this paper, we proposed the method automatically to match areal feature based on similarity using spatial information. For this, we extracted candidate matching pairs intersected between two different spatial datasets, and then measured a shape similarity, which is calculated by an weight sum method of each matching criterion automatically derived from CRITIC method. In this time, matching pairs were selected when similarity is more than a threshold determined by outliers detection of adjusted boxplot from training data. After applying this method to two distinct spatial datasets: a digital topographic map and street-name address base map, we conformed that buildings were matched, that shape is similar and a large area is overlaid in visual evaluation, and F-Measure is highly 0.932 in statistical evaluation.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.129-137
• /
• 2004

This paper presents a signature verification method that uses Gabor filter in computing similarity between signatures. In computing similarity to compare two on-line signatures, the temporal relationship between two signatures should be computed in advance. However, conventional point matching method using DP(dynamic programming) matching consumes much computation. In this paper, we propose a fast method for computing the temporal relationship between two on-line signatures by using the phase output of Gabor Inter applied on the on-line signature signals. Two similarity measures are defined in the method: Temporal Similarity and Temporally Arranged Feature Profile Similarity. With the proposed method, Ive could compare signatures 30 times faster than conventional method using DP matching.

• Journal of Broadcast Engineering
• /
• v.7 no.2
• /
• pp.136-144
• /
• 2002

In this paper, a novel approach that makes use of both shape and color information to retrieve character images in terms of similarity distance from a large-capacity image database or from a streaming image database, in particular, character image logo or trademark. In order to combine both features of completely different characteristics bipartite matching has been employed in computing similarity distance, The proposed method turned out to bealso very effective in matching natural object or human-drawn images whose shape varies substantially.

• International Journal of Contents
• /
• v.9 no.2
• /
• pp.1-7
• /
• 2013

This paper proposes an efficient matching algorithm based on ASIFT (Affine Scale-Invariant Feature Transform) which is fully invariant to affine transformation. In our approach, we proposed a method of reducing similar measure matching cost and the number of outliers. First, we combined the Manhattan and Chessboard metrics replacing the Euclidean metric by a linear combination for measuring the similarity of keypoints. These two metrics are simple but really efficient. Using our method the computation time for matching step was saved and also the number of correct matches was increased. By applying an Optimized Random Sampling Algorithm (ORSA), we can remove most of the outlier matches to make the result meaningful. This method was experimented on various combinations of affine transform. The experimental result shows that our method is superior to SIFT and ASIFT.