• Korean Journal of Clinical Laboratory Science
• /
• v.45 no.4
• /
• pp.170-179
• /
• 2013

There is a correct way to avoid any sequale in the central motor area during neurosurgery procedures. A clear way to find the circumference of the central sulcus, central motor, and sensory areas by giving cortical electrical stimulation to the central motor area immediate after surgery is proposed. Looking at patients who underwent brain surgery September 2009 to July 2013, the central sulcus and speech areas around the central area of the brain was investigated, using the practices of either a localized brain map check or a direct cortical electrical stimulation test. Brain maps localized around the surgical site through functional movement or speech areas were identified. Accurate tests done during surgery without damage to motor neurons or after surgery were conducted smoothly. Although successful brain map test localization can be accomplished, there are some factors that can interfere. The following phenomena can reverse the phase: (1) the first sensory / motor in the case of patients severe nerve damage; (2) placement of the electrode on top of the vessel; (3) presence of a brain tumor near the brain cortex; (4) use of anesthesia if patient cooperation is difficult; and (5) location of the electrode position and stimulus is inappropriate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.3
• /
• pp.576-585
• /
• 2014

Collecting and utilizing have a huge amount of personal data have caused severe security issues such as leakage of personal information. Several encryption algorithms for collected personal information have been widely adopted to prevent such problems. In this paper, a novel algorithm based on MapReduce is proposed for encrypting such private information. Furthermore, test environment has been built for the performance verification of the distributed encryption processing method. As the result of the test, average time efficiency has improved to 15.3% compare to encryption processing of token server and 3.13% compare to parallel processing.

• Journal of KIBIM
• /
• v.11 no.4
• /
• pp.1-9
• /
• 2021

Comparing to general scanning data, the 3D digital map for large construction sites and complex buildings consists of millions of points. The large construction site needs to be scanned multiple times by drone photogrammetry or terrestrial laser scanner (TLS) survey. The scanned point cloud data are required to be registrated with high resolution and high point density. Unlike the registration of 2D data, the matrix of translation and rotation are used for registration of 3D point cloud data. Archiving high accuracy with 3D point cloud data is not easy due to 3D Cartesian coordinate system. Therefore, in this study, iterative closest point (ICP) registration method for improve accuracy of 3D digital map was employed by different overlap ratio on 3D digital maps. This study conducted the accuracy test using different overlap ratios of two digital maps from 10% to 100%. The results of the accuracy test presented the optimal overlap ratios for an ICP registration method on digital maps.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.3
• /
• pp.747-752
• /
• 2013

It's known that one could use a fixed loxodromic or parabolic element in $M(\bar{\mathbb{R}}^n)$ as a test map to test the discreteness of a non-elementary M$\ddot{o}$bius group G. In this paper, we discuss the discreteness of G by using a fixed elliptic element.

• Journal of Biomedical Engineering Research
• /
• v.8 no.2
• /
• pp.205-214
• /
• 1987

In this paper, a mathmatical model for the purpose of QRS detection is considered in the case of the occurence of nonoverlappjng pulse-shaped waveforms corrupted with white noise. The number of waveform, the arrival times, amplitudes, and widths of QRS complexes are regarded as random variables. The joint MAP estimation of all the unknown Quantities consists of linear filtering followed by an optimization procedure. Because the optimization procedure is time-consuming, this procedure is modified so that a threshold test is obtained.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.408-411
• /
• 1993

In this paper, we propose the Fuzzy Neural Controller with a Self-Organizing Map based on the fuzzy relation neuron. The fuzzy ndes expressing the input-output relation of the system are obtained by using the fuzzy relation neuron and updated automatically by means of the generalized delta rule. Also, the proposed method has a capability to express the knowledge acquired from the input-output data in form of fuzzy inferences rules. The learning algorithm of this fuzzy relation neuron is described. The effectiveness of the proposed fuzzy neural controller is illustrated by applying it to a number of test data sets.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.703-706
• /
• 2003

Yield enhancement in semiconductor fabrication is important. It is ideal to prevent all the failures. However, when a failure occurs, it is important to quickly specify the cause stage and take countermeasure. The automatic method of failure pattern extraction from fail bit map provides reduced time to analysis and facilitates yield enhancement. This paper describes the techniques to automatically classifies a failure pattern using a fail bit map, a new simple schema which facilitates the failure analysis.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1992-1995
• /
• 2003

An adaptive active contour algorithm which shows stable object tracking performance under the moving or deformable environments, is proposed. In order to cope with local deformation of the object, an energy map is generated from the difference of the consecutive images and a new energy function based on the energy map is presented. The algorithm is evaluated on a set of artificial and real images to verify the efficiencies and test results show the stable tracking performance for the moving objects.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.30 no.1
• /
• pp.1-10
• /
• 2002

The purpose of this article is to examine land use change in the fringe area of a metropolitan city through multi-temporal data analysis. Change detection has been regarded as one of the most important applications for utilization of remotely sensed imageries. Conventionally, two images were used for change detection, and Arithmetic calculators were generally used on the process. Meanwhile, multi-temporal change detection for a large number of images has been carried out. In this paper, a digital land-use map and three Landsat TM data were utilized for the multi-temporal change detection Each urban area map was extracted as a base map on the process of multi-temporal change detection. Each urban area map was converted to bit image by using boolean logic. Various urban change types could be obtained by stacking the urban area maps derived from the multi-temporal data using Geographic Information System(GIS). Urban change type map was created by using the process of piling up the bit images. Then the urban change type map was compared with each land cover map for the change detection. Dalseo-gu of Daegu city and Hwawon-eup of Dalsung-gun, the fringe area of Daegu Metropolitan city, were selected for the test area of this multi-temporal change detection method. The districts are adjacent to each other. Dalseo-gu has been developed for 30 yeais and so a large area of paddy land has been changed into a built-up area. Hwawon-eup, near by Dalseo-gu, has been influenced by the urbanization of Dalseo-gu. From 1972 to 1999, 3,507.9ha of agricultural area has been changed into other land uses, while 72.7ha of forest area has been altered. This agricultural area was designated as a 'Semi-agricultural area'by the National landuse Management Law. And it was easy for the preserved area to be changed into a built-up area once it would be included as urban area. Finally, the method of treatment and management of the preserved area needs to be changed to prevent the destruction of paddy land by urban sprawl on the urban fringe.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.228-237
• /
• 2007

displacement mapping enables us to add realistic details to polygonal meshes without changing geometry. We present a real-time artifacts-free inverse displacement mapping method. In each pixel, we construct a ray and trace the ray through the displacement map to find an intersection. To skip empty regions safely, we traverse the image pyramid of displacement map in top-down order. Furthermore, when the displacement map is enlarged, intersection with bilinear interpolated displacement map can be found. When the displacement map is at distance, our method supports mipmap-like prefiltering to enhance image quality and speed. Experimental results show that our method can produce correct images even at grazing view angles. Rendering speed of a test scene is over hundreds of frames per second and the influence of resolution of displacement map to rendering speed is little. Our method is simple enough to be added to existing virtual reality systems easily.