• Journal of Sensor Science and Technology
• /
• v.20 no.3
• /
• pp.178-186
• /
• 2011

Line tracking is a well defined method of mobile robot navigation. It is simple in concept, technically easy to implement, and already employed in many industrial sites. Among several different line tracking methods, magnetic sensing is widely used in practice. In comparison, vision-based tracking is less popular due mainly to its sensitivity to surrounding conditions such as brightness and floor characteristics although vision is the most powerful robotic sensing capability. In this paper, a vision-based robust path line detection technique is proposed for the navigation of a mobile robot assuming uncontrollable surrounding conditions. The technique proposed has four processing steps; color space transformation, pixel-level line sensing, block-level line sensing, and robot navigation control. This technique effectively uses hue and saturation color values in the line sensing so to be insensitive to the brightness variation. Line finding in block-level makes not only the technique immune from the error of line pixel detection but also the robot control easy. The proposed technique was tested with a real mobile robot and proved its effectiveness.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.1
• /
• pp.18-24
• /
• 2009

This paper proposes an analytical method of evaluating the maximum error by modeling the exact tool path for the tool traverse singular region in five-axis machining. It is known that the NC data from the inverse kinematics transformation of 5-axis machining can generate singular positions where incoherent movements of the rotary axes can appear. These lead to unexpected errors and abrupt operations, resulting in scoring on the machined surface. To resolve this problem, previous methods have calculated several tool positions during a singular operation, using inverse kinematics equations to predict tool trajectory and approximate the maximum error. This type of numerical approach, configuring the tool trajectory, requires much computation time to obtain a sufficient number of tool positions in a region. We have derived an analytical equation for the tool trajectory in a singular area by modeling the tool operation into a linear and a nonlinear part that is a general form of the tool trajectory in the singular area and that is suitable for all types of five-axis machine tools. In addition, we have evaluated the maximum tool-path error exactly, using our analytical model. Our algorithm can be used to modify NC data, making the operation smoother and bringing any errors to within tolerance.

• Journal of the Korea Computer Graphics Society
• /
• v.26 no.3
• /
• pp.31-37
• /
• 2020

Identification of the mandibular canal path in Computed Tomography (CT) scans is important in dental implantology. Typically, prior to the implant planning, dentists find a sagittal plane where the mandibular canal path is maximally observed, to manually identify the mandibular canal. However, this is time-consuming and requires extensive experience. In this paper, we propose a deep-learning-based framework to detect the desired sagittal plane automatically. This is accomplished by utilizing two main techniques: 1) a modified version of the iterative transformation network (ITN) method for obtaining initial planes, and 2) a fine searching method based on a convolutional neural network (CNN) classifier for detecting the desirable sagittal plane. This combination of techniques facilitates accurate plane detection, which is a limitation of the stand-alone ITN method. We have tested on a number of CT datasets to demonstrate that the proposed method can achieve more satisfactory results compared to the ITN method. This allows dentists to identify the mandibular canal path efficiently, providing a foundation for future research into more efficient, automatic mandibular canal detection methods.

• Spatial Information Research
• /
• v.20 no.2
• /
• pp.117-127
• /
• 2012

The purpose of this study is to develop the auto-building algorithm of the Geometric Network Model(GNM), a topology model including geometric information because of the need to reflect the features' geometric characteristic into the topology model, which is for development of indoor 3D virtual model enabling queries. As the critical algorithm, the Straight Medial Axis Transformation(SMAT) algorithm is proposed in order to automatically extract the medial axis of features. The SMAT algorithm is generalized from the existing S-MAT algorithm and a range of target features where applicable is extended from simple polygons to weakly simple polygons which mean the polygons containing the inner ring inside. The GNM built automatically is finally printed out as the .csv file for easy access and w ide application in other systems. This auto-building algorithm of the GNM is available for plenty of cases such as finding a shortest path, guiding a route in emergency situation, and semantic analysis.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.33 no.2
• /
• pp.145-152
• /
• 2009

SGBEM(Symmetric Galerkin Boundary Element Method)-FEM alternating method has been proposed by Nikishkov, Park and Atluri. In the proposed method, arbitrarily shaped three-dimensional crack problems can be solved by alternating between the crack solution in an infinite body and the finite element solution without a crack. In the previous study, the SGBEM-FEM alternating method was extended further in order to solve elastic-plastic crack problems and to obtain elastic-plastic stress fields. For the elastic-plastic analysis the algorithm developed by Nikishkov et al. is used after modification. In the algorithm, the initial stress method is used to obtain elastic-plastic stress and strain fields. In this paper, elastic-plastic J integrals for three-dimensional cracks are obtained using the method. For that purpose, accurate values of displacement gradients and stresses are necessary on an integration path. In order to improve the accuracy of stress near crack surfaces, coordinate transformation and partitioning of integration domain are used. The coordinate transformation produces a transformation Jacobian, which cancels the singularity of the integrand. Using the developed program, simple three-dimensional crack problems are solved and elastic and elastic-plastic J integrals are obtained. The obtained J integrals are compared with the values obtained using a handbook solution. It is noted that J integrals obtained from the alternating method are close to the values from the handbook.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.727-740
• /
• 2006

Schema matching is important as a prerequisite to the transformation of XML documents. This paper presents a schema matching method for the transformation of XML documents. The proposed method consists of two steps: preliminary matching relationships between leaf nodes in the two XML schemas are computed based on proposed ontology and leaf node similarity, and final matchings are extracted based on a proposed path similarity. Particularly, for a sophisticated schema matching, the proposed ontology is incrementally updated by users' feedback. furthermore, since the ontology can describe various relationships between concepts, the proposed method can compute complex matchings as well as simple matchings. Experimental results with schemas used in various domains show that the proposed method is superior to previous works, resulting in a precision of 97% and a recall of 83 % on the average. Furthermore, the dynamic ontology increased by 9 percent overall.

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

In this paper, we propose a 3D automated measuring system which measures the mandibular movements and the reference plane of the jaw movements. In diagnosis and treatment of the malocclusions, it is necessary to estimate the mandibular movements and the reference plane of the jaw movements. The proposed system is configured with double stereo-cameras, PC, two moving pattern plates(MPPs), two fixed pattern plates(FPPs) and one orbital marker. The virtual pattern plate is applied to calculate the homogeneous transformation matrices which describe the coordinates systems of the FPP and MPP with respect to the world coordinates system. To estimate the parameters of the hinge axis, the Euler's theorem is applied. The hinge axis points are intersections between the FPPs and the hinge axis. The coordinates of a hinge axis point with respect to the MPP coordinates system are set up to fixed value. And then, the paths of the jaw movement can be calculated by applying the homogeneous transformation matrix to fixed hinge axis point. To examine the accuracy of the measurements, experiments of measuring the hinge axis points and floating paths of them are performed using the jaw motion simulator. As results, the measurement errors of the hinge axis points are within reasonable boundary, and the floating paths are very similar to the simulator's moving path.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.21 no.2
• /
• pp.123-130
• /
• 1985

This paper was conducted for the purpose of evaluating the accuracy of the observed time difference in Loran-C when the ground wave propagated on the surface included both land sea. The time difference of X and Y station in North East Pacific Chain GRI 5970 was measured at 25 points in Cheju areas. The results obtained are as follows: (1) The errors of time difference for M-X pair are increased when the Loran-C wave propagates above 500m heights of Hanla mountain on propagation path between the observed point and master or X, Y slave station. (2) The errors of time difference for M-X pair are able to decrease by way of correction for the propagation velocity and the geodetic datum, but errors of the time difference for M-Y pair very irregularly because irregular terrain include in propagation path from X station and propagation path from Y station is twice longer than X station. (3) It is confirmed that accuracy of Loran-C fix can elevate by the way of all correction for a geodetic datum transformation, the propagation velocity with refractive index of radio wave and the propagation velocity over land.

• Nuclear Engineering and Technology
• /
• v.56 no.4
• /
• pp.1153-1164
• /
• 2024

In recent years, unmanned ground vehicles (UGVs) have been used to search for lost or stolen radioactive sources to avoid radiation exposure for operators. To achieve autonomous localization of radioactive sources, the UGVs must have the ability to automatically determine the next radiation measurement location instead of following a predefined path. Also, the radiation field of radioactive sources has to be reconstructed or inverted utilizing discrete measurements to obtain the radiation intensity distribution in the area of interest. In this study, we propose an effective source localization framework and method, in which UGVs are able to autonomously explore in the radiation area to determine the location of radioactive sources through an iterative process: path planning, radiation field reconstruction and estimation of source location. In the search process, the next radiation measurement point of the UGVs is fully predicted by the design path planning algorithm. After obtaining the measurement points and their radiation measurements, the radiation field of radioactive sources is reconstructed by the Gaussian process regression (GPR) model based on machine learning method. Based on the reconstructed radiation field, the locations of radioactive sources can be determined by the peak analysis method. The proposed method is verified through extensive simulation experiments, and the real source localization experiment on a Cs-137 point source shows that the proposed method can accurately locate the radioactive source with an error of approximately 0.30 m. The experimental results reveal the important practicality of our proposed method for source autonomous localization tasks.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.949-952
• /
• 2005

We propose the hardwired distributed arithmetic which is applied to multiple constant multiplications and the fixed data path in the inner product of fixed coefficient as a result of variable radix-2 multi-bit coding. Variable radix-2 multi-bit coding is to reduce the partial product in constant multiplication and minimize the number of addition and shifts. At results, this procedure reduces the number of partial products that the required multiplication timing is shortened, whereas the area reduced relative to the DA architecture. Also, this architecture shows the best performance for DCT/IDCT and DWT architecture in the point of area reduction up to 20% from reducing the partial products up to 40% maximally.