• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.9
• /
• pp.401-410
• /
• 2016

3D registration is a computer vision technique of aligning multi-view range images with respect to a reference coordinate system. Various 3D registration algorithms have been introduced in the past few decades. Iterative Closest Point (ICP) is one of the widely used 3D registration algorithms, where various modifications are available nowadays. In the ICP-based algorithms, the closest points are considered as the corresponding points. However, this assumption fails to find matching points accurately when the initial pose between point clouds is not sufficiently close. In this paper, we propose a new method to solve this problem using the 6D distance (3D color space and 3D Euclidean distances). Moreover, a color segmentation-based adaptive sampling technique is used to reduce the computational time and improve the registration accuracy. Several experiments are performed to evaluate the proposed method. Experimental results show that the proposed method yields better performance compared to the conventional methods.

• Structural Engineering and Mechanics
• /
• v.57 no.2
• /
• pp.327-355
• /
• 2016

A new analytical derivation of the elastodynamic point load solutions for an isotropic multi-layered half-space is presented by means of the precise integration method (PIM) and the approach of dual vector. The time-harmonic external load is prescribed either on the external boundary or in the interior of the solid medium. Starting with the axisymmetric governing motion equations in a cylindrical coordinate system, a second order ordinary differential matrix equation can be gained by making use of the Hankel integral transform. Employing the technique of dual vector, the second order ordinary differential matrix equation can be simplified into a first-order one. The approach of PIM is implemented to obtain the solutions of the ordinary differential matrix equation in the Hankel integral transform domain. The PIM is a highly accurate algorithm to solve sets of first-order ordinary differential equations and any desired accuracy of the dynamic point load solutions can be achieved. The numerical simulation is based on algebraic matrix operation. As a result, the computational effort is reduced to a great extent and the computation is unconditionally stable. Selected numerical trials are given to validate the accuracy and applicability of the proposed approach. More examples are discussed to portray the dependence of the load-displacement response on the isotropic parameters of the multi-layered media, the depth of external load and the frequency of excitation.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.31 no.4
• /
• pp.207-213
• /
• 2018

This paper investigates applicability of Microsoft $Kinect^{(R)}$, RGB-depth camera, to implement a 3D image and spatial information for sensing a target. The relationship between the image of the Kinect camera and the pixel coordinate system is formulated. The calibration of the camera provides the depth and RGB information of the target. The intrinsic parameters are calculated through a checker board experiment and focal length, principal point, and distortion coefficient are obtained. The extrinsic parameters regarding the relationship between the two Kinect cameras consist of rotational matrix and translational vector. The spatial images of 2D projection space are converted to a 3D images, resulting on spatial information on the basis of the depth and RGB information. The measurement is verified through comparison with the length and location of the 2D images of the target structure.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.384-394
• /
• 2004

Recently, to relieve the performance degradation caused by the bottleneck between CPU and main memory, cache conscious multi-dimensional index structures have been proposed. The ultimate goal of them is to reduce the space for entries so as to widen index trees and minimize the number of cache misses. The existing index structures can be classified into two approaches according to their entry reduction methods. One approach is to compress MBR keys by quantizing coordinate values to the fixed number of bits. The other approach is to store only the sides of minimum bounding regions (MBRs) that are different from their parents partially. In this paper, we propose a new index structure that exploits the properties of the both techniques. Then, we investigate the existing multi-dimensional index structures for main memory database system through experiments under the various work loads. We perform various experiments to show that our approach outperforms others.

• Nuclear Engineering and Technology
• /
• v.54 no.10
• /
• pp.3855-3863
• /
• 2022

An evaluation of the radiation shielding performance of high-Z-particle-loaded polylactic acid (PLA) composite materials was pursued. Specimens were produced via fused deposition modeling (FDM) using copper-PLA, steel-PLA, and BaSO₄-PLA composite filaments containing 82.7, 75.2, and 44.6 wt% particulate phase contents, respectively, and were tested under broad-band flash x-ray conditions at the Sandia National Laboratories HERMES III facility. The experimental results for the mass attenuation coefficients of the composites were found to be in good agreement with GEANT4 simulations carried out using the same exposure conditions and an atomistic mixture as a model for the composite materials. Further simulation studies, focusing on the Cu-PLA composite system, were used to explore a shield design parameter space (in this case, defined by Cu-particle loading and shield areal density) to assess performance under both high-energy photon and electron fluxes over an incident energy range of 0.5-15 MeV. Based on these results, a method is proposed that can assist in the visualization and isolation of shield parameter coordinate sets that optimize performance under targeted radiation characteristics (type, energy). For electron flux shielding, an empirical relationship was found between areal density (AD), electron energy (E), composition and performance. In cases where ${\frac{E}{AD}}{\geq}2MeV{\bullet}cm{\bullet}g^{-1}$, a shield composed of >85 wt% Cu results in optimal performance. In contrast, a shield composed of <10 wt% Cu is anticipated to perform best against electron irradiation when ${\frac{E}{AD}}<2MeV{\bullet}cm{\bullet}g^{-1}$.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.48 no.2
• /
• pp.135-146
• /
• 2020

To define an interface in a conventional level-set method, an analytical function must be revealed for an interfacial geometry. However, it is not always possible to define a functional form of level sets when interfaces become complex in a Cartesian coordinate system. To overcome this difficulty, we have developed a new level-set formalism that discriminates the interior from the exterior of a CAD modeled interface by parameterizing the stereolithography (STL) file format. The work outlined here confirms the accuracy and scalability of the hydrodynamic reactive solver that utilizes the new level set concept through a series of tests. In particular, the complex interaction between shock and geometrical confinements towards deflagration-to-detonation transition is numerically investigated. Also, a process of flame spreading and damages caused by point source detonation in a real-sized plant facility have been simulated to confirm the validity of the new method built for reactive hydrodynamic simulation in any complex three-dimensional geometries.

• Journal of the Korean Society for information Management
• /
• v.40 no.1
• /
• pp.121-148
• /
• 2023

The purpose of this study is to propose a scholarly paper recommendation system based on metadata attribute similarity with excellent performance. This study suggests a scholarly paper recommendation method that combines techniques from two sub-fields of Library and Information Science, namely metadata use in Information Organization and co-citation analysis, author bibliographic coupling, co-occurrence frequency, and cosine similarity in Bibliometrics. To conduct experiments, a total of 9,643 paper metadata related to "inequality" and "divide" were collected and refined to derive relative coordinate values between author, keyword, and title attributes using cosine similarity. The study then conducted experiments to select weight conditions and dimension numbers that resulted in a good performance. The results were presented and evaluated by users, and based on this, the study conducted discussions centered on the research questions through reference node and recommendation combination characteristic analysis, conjoint analysis, and results from comparative analysis. Overall, the study showed that the performance was excellent when author-related attributes were used alone or in combination with title-related attributes. If the technique proposed in this study is utilized and a wide range of samples are secured, it could help improve the performance of recommendation techniques not only in the field of literature recommendation in information services but also in various other fields in society.

• Journal of the Korean Academy of Esthetic Dentistry
• /
• v.32 no.2
• /
• pp.54-68
• /
• 2023

Treatment planning of edentulous patient with digital method is materialized by designing the surgical guide. When designing the surgical guide, we first implement the shape of the final prosthesis in the virtual space and then materialize the implantation plan based on this. However, it is challenging to make surgical guides for edentulous patients as their lack of both the reference for the arrangement of teeth and interocclusal relationship makes it hard to envision the shape of the final prosthesis. If there exists good partial or complete dentures or residual teeth, its teeth arrangement can be used as a reference for the virtual final prosthesis and the subsequent surgical guide. If such a reference is absent or unsatisfactory, a process of manufacturing a complete denture for diagnostic purposes and verifying it on patient's mouth is necessary and use it as a new reference for the virtual final prosthesis. But even if a surgical guide is produced through the reference from the thorough reflection of the virtual final prosthesis, when we use it in the surgical field, the intraoral condition of the patient may make the implants deviated from planned in the surgical guide. In the worst case, if the positioning of the surgical guide on the mouth is incorrect, it can lead to a catastrophic error that displaces all the implant, in which case the guided surgery would be much worse than the non-guided one. In this article, we will discuss how to obtain references of tooth arrangements in a timely manner and align or register them into a unified coordinate system in digital space, and also introduce how to transfer such an implantation plan from the virtual world into the patient's mouth of real world with minimum error. And lastly, I would like to express my opinion on the establishment of a rational and systematic protocol of guided surgery of the edentulous patients.

• Korean Journal of Construction Engineering and Management
• /
• v.24 no.2
• /
• pp.13-23
• /
• 2023

Unlike building construction projects, where the activity is repeatedly carried out in a limited area, civil engineering projects such as roads and railroads are carried out in a linear type in a horizontal working space over several tens of kilometers. Each activity is managed with a station number that has a unit of distance from the starting point to the end point. For this reason, since the work location information of the activity is a major management factor, the Gantt chart system that expresses only schedule information may have limitations. In this study, authors propose a method for constructing a linear schedule chart that can simultaneously express schedule information indicating the start and finish dates and location information indicating the start and end positions of each activity, and develop a system for generating a linear schedule chart. In the study, the coordinate axes of the linear schedule chart consisted of distance and date values on the X and Y axes, respectively, and each activity was expressed as a symbol that can infer the type of work to increase the visibility of the linear schedule chart compared to the simple bar chart method. The linear schedule chart generation system was reviewed for practical applicability by utilizing the actual schedule data of bridge structures in a railroad project.

• Journal of Intelligence and Information Systems
• /
• v.17 no.1
• /
• pp.111-125
• /
• 2011

Clustering is a process of grouping similar or relevant documents into a cluster and assigning a meaningful concept to the cluster. By this process, clustering facilitates fast and correct search for the relevant documents by narrowing down the range of searching only to the collection of documents belonging to related clusters. For effective clustering, techniques are required for identifying similar documents and grouping them into a cluster, and discovering a concept that is most relevant to the cluster. One of the problems often appearing in this context is the detection of a complex concept that overlaps with several simple concepts at the same hierarchical level. Previous clustering methods were unable to identify and represent a complex concept that belongs to several different clusters at the same level in the concept hierarchy, and also could not validate the semantic hierarchical relationship between a complex concept and each of simple concepts. In order to solve these problems, this paper proposes a new clustering method that identifies and represents complex concepts efficiently. We developed the Hierarchical Overlapping Clustering (HOC) algorithm that modified the traditional Agglomerative Hierarchical Clustering algorithm to allow overlapped clusters at the same level in the concept hierarchy. The HOC algorithm represents the clustering result not by a tree but by a lattice to detect complex concepts. We developed a system that employs the HOC algorithm to carry out the goal of complex concept detection. This system operates in three phases; 1) the preprocessing of documents, 2) the clustering using the HOC algorithm, and 3) the validation of semantic hierarchical relationships among the concepts in the lattice obtained as a result of clustering. The preprocessing phase represents the documents as x-y coordinate values in a 2-dimensional space by considering the weights of terms appearing in the documents. First, it goes through some refinement process by applying stopwords removal and stemming to extract index terms. Then, each index term is assigned a TF-IDF weight value and the x-y coordinate value for each document is determined by combining the TF-IDF values of the terms in it. The clustering phase uses the HOC algorithm in which the similarity between the documents is calculated by applying the Euclidean distance method. Initially, a cluster is generated for each document by grouping those documents that are closest to it. Then, the distance between any two clusters is measured, grouping the closest clusters as a new cluster. This process is repeated until the root cluster is generated. In the validation phase, the feature selection method is applied to validate the appropriateness of the cluster concepts built by the HOC algorithm to see if they have meaningful hierarchical relationships. Feature selection is a method of extracting key features from a document by identifying and assigning weight values to important and representative terms in the document. In order to correctly select key features, a method is needed to determine how each term contributes to the class of the document. Among several methods achieving this goal, this paper adopted the $x^2$�� statistics, which measures the dependency degree of a term t to a class c, and represents the relationship between t and c by a numerical value. To demonstrate the effectiveness of the HOC algorithm, a series of performance evaluation is carried out by using a well-known Reuter-21578 news collection. The result of performance evaluation showed that the HOC algorithm greatly contributes to detecting and producing complex concepts by generating the concept hierarchy in a lattice structure.