• Korean Journal of Remote Sensing
• /
• v.7 no.1
• /
• pp.13-27
• /
• 1991

DEM(digital elevation map) is a very useful information in various applications. In this paper, we have studied on the terrain matching algorithm using the DEM, which was proposed by Rodriguez and Aggarwal(1990) for an aircraft navigation system. We evaluated its performance using syntactic images. Cliff maps and critical points are used for the reduction of computation time and information size to be processed. The computer simulation shows that though the computational complexity is high, the technique is efficient even to noisy images.

• Bulletin of the Korean Chemical Society
• /
• v.12 no.3
• /
• pp.322-328
• /
• 1991

We have studied a characterization method of accurate size of spherical particles by fitting experimental light scattering profile to the rigorous theoretical scattering function. An efficient software has been developed for computation of the theoretical scattering function and regression analysis. A light scattering instrument has been built and the necessary data acquisition and analysis are carried out by use of a personal computer with an emphasis on the reduction of analysis and time aiming that this study will be extended toward a development of a practical particle sizing apparatus. The performance of the instrument and the software has been evaluated with latex spheres and found to be satisfactory.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.4
• /
• pp.188-194
• /
• 2014

V2I(Vehicular to Infrastructure) is a one kind of communication systems which is used between the base stations and mobile objects. In V2I communication system, it is difficult to obtain the desired communication performance. Beamforming technology is to find the optimal path. and it can be improved the communication performance. MUSIC algorithm can be estimated the direction of arrival. The directional vector of received signals and the eigenvector has orthogonal property. MUSIC algorithm uses this property. In V2I communication environment, real time optimal path is changed. By the high computational complexity of the MUSIC algorithm, the optimal path estimation error is generated. In this paper, we propose a method of computation reduction algorithm for MUSIC algorithm.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.40 no.4
• /
• pp.373-379
• /
• 2016

It is known that it is expedient to represent the distribution of the properties of a bone with complex heterogeneity as B-spline volume functions. For B-spline-based representation, the pixel values of CT images are interpolated by B-spline volume functions. However, the CT images of a bone are three-dimensional and very large, and hence a large amount of memory and long computation time for the interpolation are required. In this study, a method for resolving these problems is proposed. In the proposed method, the B-spline volume interpolation problem is simplified by using the uniformity of pixel spacing of the image and the properties of B-spline basis functions. This results in a reduction in computation time and the amount of memory used. The proposed method was implemented and it was verified that the computation time and the amount of memory used were reduced.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.6
• /
• pp.568-574
• /
• 2020

In this paper, we propose a method to reduce the square root computation having high computation complexity in Canny edge detection algorithm using image processing. The proposed method is to reduce the number of operation calculating gradient magnitude using pixel's continuity using make a specific pattern instead of square root computation in gradient magnitude calculating operation. Using various test images and changing number of hole pixels, we can check for calculate match rate about 97% for one hole, and 94%, 90%, 88% when the number of hole is increased and measure decreasing computation time about 0.2ms for one hole, and 0.398ms, 0.6ms, 0.8ms when the number of hole is increased. Through this method, we expect to implement low power embedded vision system through high accuracy and a reduced operation number using two-hole pixels.

• Progress in Medical Physics
• /
• v.16 no.3
• /
• pp.138-147
• /
• 2005

The Monte Carlo method cannot have been used for routine treatment planning because of heavy time consumption for the acceptable accuracy. Since calculation time is proportional to particle histories, we can save time by decreasing the number of histories. However, a small number of histories can cause serious uncertainties. In this study, we proposed Monte Carlo dose computation time and uncertainty reduction method using specially designed filters and adaptive denoising process. Proposed algorithm was applied to 6 MV photon and 21 MeV electron dose calculations in homogeneous and heterogeneous phantoms. Filtering time was negligible comparing to Monte Carlo simulation time. The accuracy was improved dramatically in all situations and the simulation of 1 $\%$ to 10$\%$ number of histories of benchmark in photon and electron dose calculation showed the most beneficial result. The empirical reduction of necessary histories was about a factor of ten to fifty from the result.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.6
• /
• pp.1127-1137
• /
• 2022

Cryptographic analysis and decryption technology utilizing the parallel operation of GPU has been studied in the direction of shortening the computation time of the password analysis system. These studies focus on optimizing the code to improve the speed of cryptographic analysis operations on a single GPU or simply increasing the number of GPUs to enhance parallel operations. However, using a large number of GPUs without optimization for data transmission causes longer data transmission latency than using a single GPU and increases the overall computation time of the cryptographic analysis system. In this paper, we investigate GPUDirect RDMA and related technologies for high-performance data processing in deep learning or HPC research fields in GPU clustering environments. In addition, we present a method of designing a high-performance cryptanalysis system using the relevant technologies. Furthermore, based on the suggested system topology, we present a method of implementing a cryptanalysis system using password cracking and GPU reduction. Finally, the performance evaluation results are presented according to demonstration of high-performance technology is applied to the implemented cryptanalysis system, and the expected effects of the proposed system design are shown.

• Journal of the Korean Statistical Society
• /
• v.35 no.3
• /
• pp.281-303
• /
• 2006

In an earlier work, we investigated the problem of using linear programming to bound performance measures in a discrete time Jackson network. There it was assumed that the system evolution is controlled by the early arrival scheme. This assumption implies that the system can't be modelled by a Markov chain. This problem was resolved and performance bounds were calculated. In the present work, we use a modification of the early arrival scheme (without corrupting it) in order to make the system evolves as a Markov chain. This modification enables us to obtain explicit expressions for certain moments that could not be calculated explicitly in the pure early arrival scheme setting. Moreover, this feature implies a reduction in the linear program size as well as the computation time. In addition, we obtained tighter bounds than those appeared before due to the new setting.

• Proceedings of the KIEE Conference
• /
• 1999.07a
• /
• pp.226-228
• /
• 1999

This paper presents an efficient analysis method using time-stepping finite element method for electric machines driven by pulse width modulation (PWM) inverter. In the method, the value of time-step is changed according to the PWM logic of inverter, and the calculation time can be reduced while maintaining analysis accuracy. Using the method, the dynamic characteristics of a permanent magnet linear synchronous motor (PMLSM) driven by PWM inverter are analyzed.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.93-96
• /
• 2022

DTW can eliminate gaps between sequences of different lengths and find out the similarity of patterns, but due to the time and space complexity, it requires a high computational cost on large datasets. In this paper, we propose a DDTW algorithm that not only reduces computational costs but also has no error in the results. In addition, the algorithm complexity of DTW and DDTW is compared by measuring the computational time according to the length of the sequence. Simulation results show a noticeable reduction in computational time in DDTW compared to DTW.