• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.673-675
• /
• 2003

The image restoration algorithm for microwave imaging radiometer is proposed. A blind deconvolution method was proposed. A point spread function was identified and three deconvolution schemes were employed, Wiener filtering, Lucy- Richardson deconvolution, and Maximum Likelihood blind deconvolution. The experimental data is illustrated with restored image.

• Journal of applied mathematics & informatics
• /
• v.40 no.3_4
• /
• pp.515-530
• /
• 2022

A factor graph and belief propagation can be used for finding stochastic values of link weights in biological networks. However it is not easy to follow the process of use and so we presented the process with a toy network of three nodes in our prior work. We extend this work more generally and present numerical example for a network of 100 nodes.

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

A potential field method for solving the problem of path planning based on global and local information for a mobile robot moving among a set of stationary obstacles is described. The concept of various method used path planning is used design a planning strategy. A real human living area is constructed by many moving and imminence obstacles. Home service mobile robot must avoid many obstacles instantly. A path that safe and attraction towards the goal is chosen. The potential function depends on distance from the goal and heuristic function relies on surrounding environments. Three additional combined methods are proposed to apply to human living area, calibration robots position by measured surrounding environment and adapted home service robots. In this work, we proposed the application of various path planning theory to real area, human living. First, we consider potential field method. Potential field method is attractive method, but that method has great problem called local minimum. So we proposed intermediate point in real area. Intermediate point was set in doorframe and between walls there is connect other room or other area. Intermediate point is very efficiency in computing path. That point is able to smaller area, area divided by intermediate point line. The important idea is intermediate point is permanent point until destruction house or apartment house. Second step is move robot with sensing on front of mobile robot. With sensing, mobile robot recognize obstacle and judge moving obstacle. If mobile robot is reach the intermediate point, robot sensing the surround of point. Mobile robot has data about intermediate point, so mobile robot is able to calibration robots position and direction. Third, we gave uncertainty to robot and obstacles. Because, mobile robot was motion and sensing ability is not enough to control. Robot and obstacle have uncertainty. So, mobile robot planed safe path planning to collision free. Finally, escape local minimum, that has possibility occur robot do not work. Local minimum problem solved by virtual obstacle method. Next is some supposition in real living area.

• IE interfaces
• /
• v.13 no.3
• /
• pp.471-478
• /
• 2000

One of the most important problems encountered by parcel transportation firms or LTL (Less-than-truckload) firms is the planning of daily linehaul operations. The transportation firm's goal is to determine the most efficient way to move all freight from its originating terminal to its destination terminal after each shipment is picked up from the shipping dock. The purpose of this study is to design a transportation system and develop an efficient scheduling algorithm for linehaul operations carrying small amount of shipment. This paper presents three approaches for efficient linehaul operations. The first approach examines drivers using the roundtrips which start from a terminal, visit several terminals, and return to the starting terminal. The second approach uses a freight assembly center where drivers take freight for a number of destination terminals which they then swap for freight for their starting terminal. The third approach is similar to the second approach in that it uses a transshipment point like a freight assembly terminal for shipment, but it has several transshipment points since each shipment may have a different transshipment point. In this study, we developed a mathematical formulation and algorithm for each approach. The experimental results using data of a LTL firm show that the third approach is more efficient than the other two. Mileage and overnight stays of the third approach are reduced by 10% and 30%, respectively.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.1
• /
• pp.80-89
• /
• 2013

This paper presents an efficient approach for solving economic dispatch (ED) problems with nonconvex cost functions using a 'Mean-Variance Optimization (MVO)' algorithm with Kuhn-Tucker condition and swap process. The aim of the ED problem, one of the most important activities in power system operation and planning, is to determine the optimal combination of power outputs of all generating units so as to meet the required load demand at minimum operating cost while satisfying system equality and inequality constraints. This paper applies Kuhn-Tucker condition and swap process to a MVO algorithm to improve a global minimum searching capability. The proposed MVO is applied to three different nonconvex ED problems with valve-point effects, prohibited operating zones, transmission network losses, and multi-fuels with valve-point effects. Additionally, it is applied to the large-scale power system of Korea. The results are compared with those of the state-of-the-art methods as well.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.10
• /
• pp.1402-1411
• /
• 2014

In this paper, the Maximum Power Point Tracking(MPPT) control of the small scale wind power generation system with a three-phase diode rectifier and the grid-connected inverter is studied. Without the need for the converter circuits to control speed of the generator, it is economical and the structure is simple. Compared with existing systems, it can be to reduce the power semiconductor switches and passive elements, and to implement the MPPT control with only DC-Link voltage control of the grid-connected inverter. In order to allow MPPT control without the characteristic information of the wind turbine, the P&O algorithm is applied, and these are verified by the simulation and experiment.

• Investigative Magnetic Resonance Imaging
• /
• v.15 no.1
• /
• pp.57-66
• /
• 2011

Purpose : A new inhomogeneity correction method based on two-point Dixon sequence is proposed to obtain water and fat images at 0.35T, low field magnetic resonance imaging (MRI) system. Materials and Methods : Joint phase-magnitude density function (JPMF) is obtained from the in-phase and out-of-phase images by the two-point Dixon method. The range of the water signal is adjusted from the JPMF, and 3D inhomogeneity map is obtained from the phase of corresponding water volume. The 3D inhomogeneity map is used to correct the inhomogeneity field iteratively. Results : The proposed water-fat imaging method was successfully applied to various organs. The proposed 3D inhomogeneity correction algorithm provides good performances in overall multi-slice images. Conclusion : The proposed water-fat separation method using JPMF is robust to field inhomogeneity. Three dimensional inhomogeneity map and the iterative inhomogeneity correction algorithm improve water and fat imaging substantially.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.4 no.4
• /
• pp.180-189
• /
• 2009

Currently, most automobile companies are interested in research on intelligent autonomous vehicle. They are mainly focused on driver's intelligent assistant and driver replacement. In order to develop an autonomous vehicle, lateral and longitudinal control is necessary. This paper presents a lateral and longitudinal control system for autonomous vehicle that has only mono-vision camera. For lane detection, we present a new lane detection algorithm using clothoid parabolic road model. The proposed algorithm in compared with three other methods such as virtual line method, gradient method and hough transform method, in terms of lane detection ratio. For adaptive control, we apply a vanishing point estimation to fuzzy control. In order to improve handling and stability of the vehicle, the modeling errors between steering angle and predicted vanishing point are controlled to be minimized. So, we established a fuzzy rule of membership functions of inputs (vanishing point and differential vanishing point) and output (steering angle). For simulation, we developed 1/8 size robot (equipped with mono-vision system) of the actual vehicle and tested it in the athletics track of 400 meter. Through the test, we prove that our proposed method outperforms 98 % in terms of detection rate in normal condition. Compared with virtual line method, gradient method and hough transform method, our method also has good performance in the case of clear, fog and rain weather.

• Honam Mathematical Journal
• /
• v.36 no.4
• /
• pp.787-794
• /
• 2014

We prove three convex hull theorems on triangles and circles. Given a triangle ${\triangle}$ and a point p, let ${\triangle}^{\prime}$ be the triangle each of whose vertices is the intersection of the orthogonal line from p to an extended edge of ${\triangle}$. Let ${\triangle}^{{\prime}{\prime}}$ be the triangle whose vertices are the centers of three circles, each passing through p and two other vertices of ${\triangle}$. The first theorem characterizes when $p{\in}{\triangle}$ via a distance duality. The triangle algorithm in [1] utilizes a general version of this theorem to solve the convex hull membership problem in any dimension. The second theorem proves $p{\in}{\triangle}$ if and only if $p{\in}{\triangle}^{\prime}$. These are used to prove the third: Suppose p be does not lie on any extended edge of ${\triangle}$. Then $p{\in}{\triangle}$ if and only if $p{\in}{\triangle}^{{\prime{\prime}}$.

• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.235-244
• /
• 2012

In this paper, we solve the three-dimensional biharmonic equation with Dirichlet boundary conditions of second kind using the full multigrid (FMG) algorithm. We derive a finite difference approximations for the biharmonic equation on a 18 point compact stencil. The unknown solution and its second derivatives are carried as unknowns at grid points. In the multigrid methods, we use a fourth order interpolation to producing a new intermediate unknown functions values on a finer grid, and the full weighting restriction operators to calculating the residuals at coarse grid points. A set of test problems gives excellent results.