• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.4
• /
• pp.521-526
• /
• 2012

The performance of arrow from a manufacturing process depends on arrow's trajectory(archer's paradox) and intensity of an impact points. Especially, when conducting a shooting experiment over and over in the same experiment condition, the intensity of impact point is an objective standard to judge the performance of the arrow. However, the analysis method for the impact point is not enough, a previous research of the arrow's performance has been focused on a skill to optimize a manufacturing variables(feathers of an arrow, barb of an arrow, arrow's shaft, weight, external diameter, spine). In this paper, We propose measurement system of arrow's impact point with Mamdani fuzzy inference system and similarity of polygon for automation of impact point's measurement. Measuring the impact point data of the arrow moving with a high speed(approximately 275km/h) by using line laser and photo diode array, then the measured data are mapped to arrow's impact point with fuzzy inference and similarity of polygon.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.2
• /
• pp.153-162
• /
• 2012

In this paper, we propose a new shape similarity measure for M:N polygon pairs regardless of different object cardinalities in the pairs. The proposed method compares the projections of two shape functions onto Zernike polynomial basis functions, where the shape functions were obtained from each overall region of objects, thus not being affected by the cardinalities of object pairs. Moments with low-order basis functions describe global shape properties and those with high-order basis functions describe local shape properties. Therefore several moments up to a certain order where the original shapes were similarly reconstructed can efficiently describe the shape properties thus be used for shape comparison. The proposed method was applied for the building objects in the New address digital map and a car navigation map of Seoul area. Comparing to an overlapping ratio method, the proposed method's similarity is more robust to object cardinality.

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

This paper proposes a matching algorithm to find corresponding polygon feature sets between heterogeneous digital maps. The algorithm finds corresponding sets in terms of optimizing their shape similarities based on the assumption that the feature sets describing the same entities in the real world are represented in similar shapes. Then, by using a binary code, it is represented that a polygon feature is chosen for constituting a corresponding set or not. These codes are combined into a binary string as a candidate solution of the matching problem. Starting from initial candidate solutions, a genetic algorithm iteratively optimizes the candidate solutions until it meets a termination condition. Finally, it presents the solution with the highest similarity. The proposed method is applied for the topographical and cadastral maps of an urban region in Suwon, Korea to find corresponding polygon feature sets for block areas, and the results show its feasibility. The results were assessed with manual detection results, and showed overall accuracy of 0.946.

• Korean Journal of Remote Sensing
• /
• v.37 no.4
• /
• pp.763-776
• /
• 2021

This paper introduces a method of selecting priority update areas for subdivided land cover maps by training orthoimages and serial cadastral maps in a deep learning model. For the experiment, orthoimages and serial cadastral maps were obtained from the National Spatial Data Infrastructure Portal. Based on the VGG-16 model, 51,470 images were trained on 33 subdivided classifications within the experimental area and an accuracy evaluation was conducted. The overall accuracy was 61.42%. In addition, using the differences in the classification prediction probability of the misclassified polygon and the cosine similarity that numerically expresses the similarity of the land category features with the original subdivided land cover class, the cases were classified and the areas in which the boundary setting was incorrect and in which the image itself was determined to have a problem were identified as the priority update polygons that should be checked by operators.

• Structural Engineering and Mechanics
• /
• v.70 no.2
• /
• pp.153-168
• /
• 2019

In this paper, energy absorption characteristics of circular windowed tubes with different section shapes (circular, ellipse, square, hexagon, polygon and pentagon) are investigated numerically and experimentally. The tube possesses the same material, thickness, height, volume and average cross sectional area which are subjected under axial and oblique quasi-static loading conditions. Numerical model was constructed with FE code ABAQUS/Explicit, the obtained outcome of simulation is in good matching with the experimental data. The energy absorbed, specific energy absorption, crash force efficiency, peak and mean loads along with the collapse modes with their initiation point of simple and windowed tubes were evaluated. The technique for order of preference by similarity ideal solution (TOPSIS) approach was employed for assessing their overall crushing performances. The obtained results confirm that efficacy of crash force indicators have improved by introducing windows and tubes with pentagonal and circular windows achieves the maximum ranking about 0.528 and 0.517, it clearly reveals the above are best window shapes.

• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.1
• /
• pp.89-98
• /
• 2016

In this paper, we proposed an automated areal feature matching method based on geometric similarity without user intervention and is applied into areal features of many-to-many relation, for confusion of spatial data-sets of different scale and updating cycle. Firstly, areal feature(node) that a value of inclusion function is more than 0.4 was connected as an edge in adjacency matrix and candidate corresponding areal features included many-to-many relation was identified by multiplication of adjacency matrix. For geometrical matching, these multiple candidates corresponding areal features were transformed into an aggregated polygon as a convex hull generated by a curve-fitting algorithm. Secondly, we defined matching criteria to measure geometrical quality, and these criteria were changed into normalized values, similarity, by similarity function. Next, shape similarity is defined as a weighted linear combination of these similarities and weights which are calculated by Criteria Importance Through Intercriteria Correlation(CRITIC) method. Finally, in training data, we identified Equal Error Rate(EER) which is trade-off value in a plot of precision versus recall for all threshold values(PR curve) as a threshold and decided if these candidate pairs are corresponding pairs or not. To the result of applying the proposed method in a digital topographic map and a base map of address system(KAIS), we confirmed that some many-to-many areal features were mis-detected in visual evaluation and precision, recall and F-Measure was highly 0.951, 0.906, 0.928, respectively in statistical evaluation. These means that accuracy of the automated matching between different spatial data-sets by the proposed method is highly. However, we should do a research on an inclusion function and a detail matching criterion to exactly quantify many-to-many areal features in future.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2412-2420
• /
• 1997

An algorithm for detecting dominant points on a digital contour is proposed. The algorithm detects the dominant points from the given contour with the given number of points as a constraint condition. on the basis of the principle of the top-down approach. The dominant points are detected by minimizing the object function that presents the similarity between the given contour and the approximated polygon drawn by connecting the dominant points of candicate. The penalty multiplier method is applied to minimize the augmented Lagrangean function which is made by adding the penalty of the constraint condition to the object function. On the minimization, a local searching method by the partial problem division is considered, and it is clarified that the reasonable solution is obtained by the method. The proposed algorithm has a merit that the dominant points can be detected exactly and stably even for the digital contour composed of multiple-scale features and the similar contours, because it detects them on considering the property of a whole figure of the given contour. It is confirmed that the proposed algorithm is more excellent than other previously proposed algorithms by the comparison and the evaluation through the experiment on suing typical digital curves.

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.362-371
• /
• 2003

In this paper, we propose an optimal interest point extraction method to support shape-base image classification and indexing for image database by applying a dynamic threshold that reflects the characteristics of the shape contour. The threshold is determined dynamically by comparing the contour length ratio of the original shape and the approximated polygon while the algorithm is running. Because our algorithm considers the characteristics of the shape contour, it can minimize the number of interest points. For n points of the contour, the proposed algorithm has O(nlogn) computational cost on an average to extract the number of m optimal interest points. Experiments were performed on the 70 synthetic shapes of 7 different contour types and 1100 fish shapes. It shows the average optimization ratio up to 0.92 and has 14% improvement, compared to the fixed threshold method. The shape features extracted from our proposed method can be used for shape-based image classification, indexing, and similarity search via normalization.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1692-1700
• /
• 2009

This paper proposes the direction distribution of surface normal vectors as a feature descriptor of three-dimensional models. Proposed the feature descriptor handles rotation invariance using a principal component analysis(PCA) method, and performs mesh simplification to make it robust and nonsensitive against noise addition. Our method picks samples for the distribution of normal vectors to be proportional to the area of each polygon, applies weight to the normal vectors, and applies interpolation to enhance discrimination so that the information on the surface with less area may be less reflected on composing a feature descriptor. This research measures similarity between models with a L1-norm in the probability density histogram where the distances of feature descriptors are normalized. Experimental results have shown that the proposed method has improved the retrieval performance described in an average normalized modified retrieval rank(ANMRR) by about 17.2% and the retrieval performance described in a quantitative discrimination scale by 9.6%~17.5% as compared to the existing method.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.33 no.1
• /
• pp.45-52
• /
• 2015

The interoperability of multi-source data has become more important due to various digital maps, produced from public institutions and enterprises. In this study, the automatic matching algorithm of multi-source building data using hierarchical matching was proposed. At first, we divide digital maps into blocks and perform the primary geometric registration of buildings with the ICP algorithm. Then, corresponding building pairs were determined by evaluating the similarity of overlap area, and the matching threshold value of similarity was automatically derived by the Otsu binary thresholding. After the first matching, we extracted error matching candidates buildings which are similar with threshold value to conduct the secondary ICP matching and to make a matching decision using turning angle function analysis. For the evaluation, the proposed method was applied to representative public digital maps, road name address map and digital topographic map 2.0. As a result, the F measures of matching and non-matching buildings increased by 2% and 17%, respectively. Therefore, the proposed method is efficient for the matching of building polygons from multi-source digital maps.