• The Bulletin of The Korean Astronomical Society
• /
• v.44 no.1
• /
• pp.58.4-58.4
• /
• 2019

We present the application of the Point Spread Function (PSF) deconvolution method to the astronomical Integral Field Unit (IFU) Spectroscopy data focus on the restoration of the galaxy kinematics. We apply the Lucy-Richardson deconvolution algorithm to the 2D image at each wavelength slice. We make a set of mock IFU data which resemble the IFU observation to the model galaxies with a diverse combination of surface brightness profile, S/N, line-of-sight geometry and Line-Of-Sight Velocity Distribution (LOSVD). Using the mock IFU data, we demonstrate that the algorithm can effectively recover the stellar kinematics of the galaxy. We also show that lambda_R_e, the proxy of the spin parameter can be correctly measured from the deconvolved IFU data. Implementation of the algorithm to the actual SDSS-IV MaNGA IFU survey data exhibits the noticeable difference on the 2D LOSVD, geometry, lambda_R_e. The algorithm can be applied to any other regular-grid IFS data to extract the PSF-deconvolved spatial information.

• Proceedings of the KSR Conference
• /
• 2004.06a
• /
• pp.1321-1324
• /
• 2004

Unbalanced systems, such as distribution systems, have difficulties in fault locations due to single-phase laterals and loads. In this paper, a novel fault location algorithm is suggested for a line to line faults using inverse theorem of matrix on electric power lines. The fault location for balanced systems has been studied using the current distribution factor, by a conventional symmetrical transformation, but that for unbalanced systems has not been investigated due to their high complexity The proposed algorithms overcome the limit of the conventional algorithm using the conventional symmetrical transformation, which requires the balanced system and are applicable to any electric power system but are particularly useful for unbalanced distribution systems. The simulation results oriented by the real distribution system are presented to show its effectiveness and accuracy.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2333-2335
• /
• 1998

Recently, the development of computer achieves a system which is similar to the mechanics of human visual system. The 3D measurement using monocular vision system must be achieved a camera calibration. So far, the camera calibration technique required reference target in a scene. But, these methods are inefficient because they have many calculation procedures and difficulties in analysis. Therefore, this paper proposes a native method that without reference target in a scene. We use the grid type frame with different line widths. This method uses vanishing point concept that possess a rotation parameter of the camera and perspective ration that perfect each line widths into a image. We confirmed accuracy of calibration parameter estimation through experiment on the algorithm with a grid paper with different line widths.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.177-180
• /
• 2005

Three dimensional shaded images are standard visualization method for CAD models on the computer screen. Therefore, much of the effort in the visualization of CAD models has been focused on how conveniently and realistically CAD models can be displayed on the screen. However, shaded 3D CAD data images captured from the screen may not be suitable for some application areas. Technical document, either in the paper or electronic form, can more clearly describe the shape and annotate parts of the model by using projected 2D line drawing format viewed from a user defined view direction. This paper describes an efficient method for generating such a 2D line drawing data in the vector format. The algorithm is composed of silhouette line detection, hidden line removal and cleaning processes.

• KIISE Transactions on Computing Practices
• /
• v.23 no.2
• /
• pp.110-115
• /
• 2017

We propose a new indoor positioning algorithm named Cut-off algorithm. This algorithm cuts off candidates of beacons and reference points in advance, before looking for K neighbor reference points which are guessed to be closest to the user's actual location. The algorithm consists of two phases: off-line phase, and on-line phase. In the off-line phase, RSSI and UUID data from beacons are gathered at reference points placed in the indoor environment, and construct a fingerprint map of the data. In the on-line phase, the map is reduced to a smaller one according to the RSSI data of beacons received from the user's device. The nearest K reference points are selected using the reduced map, which are used for estimating user's location. In both phases, relative ranks of the peak signals received from each beacon are used, which smoothen the fluctuations of the signals. The algorithm is shown to be more efficient in terms of accuracy and estimating time.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.1
• /
• pp.12-21
• /
• 2003

In this paper, we propose an on-line scheduling algorithm with the goal of maximizing the total reward of IRIS (Increasing Reward with Increasing Service) real-time tasks that have reward functions and arrive dynamically into the system. We focus on enhancing the performance of scheduling algorithm, which W.: based on the following two main ideas. First, we show that the problem to maximize the total reward of dynamic tasks can also be solved by the problem to find minimum of maximum derivatives of reward functions. Secondly, we observed that only a few of scheduled tasks are serviced until a new task arrives, and the rest tasks are rescheduled with the new task. Based on our observation, the Proposed algorithm doesn't schedules all tasks in the system at every scheduling print, but a part of tasks. The performance of the proposed algorithm is verified through the simulations for various cases. The simulation result showed that the computational complexity of proposed algorithm is$O(N_2)$ in the worst case which is equal to those of the previous algorithms, but close to O(N) on the average.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.385-388
• /
• 2002

In this paper, a new signature verification method is proposed. In the proposed method, on-line signature features are decomposed into multi-level signals by using the discrete wavelet transform, and then they are verified using the adaptive algorithm in time-frequency domain. Through computer simulations, the effectiveness of the proposed method is examined.

• Proceedings of the KIEE Conference
• /
• 1989.11a
• /
• pp.484-487
• /
• 1989

A fast stereo algorithm for 3D depth estimation is presented. We propose an on-line stereo matching technique, by which the flows of stereo image signals are dynamically controlled to satisfy the matching condition of intensity functionals. The disparity is rapidly estimated from the control of. the signal flows and 3D depth is determined from the disparity.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.43 no.4
• /
• pp.586-593
• /
• 1994

This paper suggests the algorithm for on-line efficiency control of permancent magnet synchronous motors driving the electric vehicles. The existance of unigue d-axis current is verified, which generates the maximum efficiency at operating points of motor. Using the Fibonacci search method, d-axis current converges to the minimization of inverter input power, and to prevent the variation of motor speed in process of the efficiency control, the voltage decoupled control strategy is introduced. Through the experiments, the effects of an efficiency control algorithm are verified.

• Proceedings of the KSR Conference
• /
• 1998.11a
• /
• pp.137-143
• /
• 1998

Numerical simulation is conducted to clarify the heat transfer and fluid flow characteristics of traction motor for electric car SIMPLE algorithm based on finite volume method is used to make linear algebra equation. The governing equations are solved by TDMA(TriDiagonal Matrix Algorithm) with line-by-line method and block correction. From the results of simulation, the characteristics of cooling pattern is strongly affected by the size of hole in stator core. In the case of high rotational speed of rotor, temperature difference along the axial direction is more decreased than that of low rotational speed.