• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(4)
• /
• pp.77-80
• /
• 2000

In this paper, we present a new automatic thresholding algorithm based on maximum entropy of two-dimensional pixel histogram. While most of the previous algorithms select thresholds depending only on the histogram of gray level itself in the image, the presented algorithm considers 2D relational histogram of gray levels of two adjacent pixels in the image. Thus, the new algorithm tends to leave salient edge features on the image after thresholding. The experimental results show the good performance of the presented algorithm.

• 전자공학회논문지B
• /
• 제31B권7호
• /
• pp.66-75
• /
• 1994

In this paper, we present a new GPC algorithm for plants with known disturbances. Also, based on the above algorithm unidirectional and bidirectional predictive controllers have been proposed concerning plants with input couplings between subprocesses. These predictive control algorithms can be applied to many industrial processes as a multiloop controllers. Simulation results show that the proposed algorithm has improved performance and computing time compared to conventional GPC algorithm.

• 대한산업공학회지
• /
• 제12권1호
• /
• pp.133-138
• /
• 1986

In this paper, we are modeling the problem of the reliability evaluation in the network with delay. The triconnected decomposition and factoring algorithm for the network reliability, known as the most efficient algorithm, does not work in this constrained problem. So, we propose some ideas that reduce the above constrained problem to the general network reliability problem. We also present an algorithm for the reliability evaluation in the network with delay based on these ideas.

• 한국경영과학회지
• /
• 제19권2호
• /
• pp.177-198
• /
• 1994

We consider an algorithm for the Crew Scheduling Problem (CSP) based on the Transportation Problem approach. The main flows of the algorithm are arranged in three steps. First we propose a heuristic algorithm of the greedy principle to obtain an initial feasible solution. Secondary we present a method of formulating CSP into a Modified Transportation Problem format. Lastly the procedures of network search to get the optimal solution are presented. This algorithm can be applied to the general GSP and also to most combinatorial problems like the Vehicle Routing Problems. The computational results show that the large size CSP's could be tackled.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.964-967
• /
• 1996

In this paper, we present a fuzzy-sliding controller design using genetic algorithm. We can suppress chattering and enhance the robustness of controlled system by using this controller and do that genetic algorithm can easily find out a nearly optimal fuzzy rule performance of this controller is tested by simulation of car system with two pole.

• 대한전자공학회논문지
• /
• 제26권11호
• /
• pp.1850-1856
• /
• 1989

For determining motion/structure of a 3-D rigid object from point correspondences over two perspective views, a linear algorithm was developed in Refs. 3 and 4. This algorithm fails when the 3-D points under observation satisfy certain geometrical constraints, as demonstrated in Refs. 7 and 8. In the present paper, we show that the linear algorithm can be resurrected in these degenerate cases by adding additional lower order polynomial constraints to original equations.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.129.1-129
• /
• 2001

In this paper, we present an approach for matching images from finding interesting points and applying new image interpolation algorithm. New algorithms are developed that automatically align the input images match them and reconstruct 3-D surfaces. The interpolation algorithm is designed to cope with simple shapes. The proposed image interpolation algorithm generate a rotation image about vertical axes by an any angle from 4 base images. Each base image that was obtained from CCD camera has an angle difference of 90$^{\circ}$ The proposed image interpolation algorithm use the geometric analysis of image and depth information.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• pp.995-998
• /
• 2002

In this paper, we present a fast algorithm for hand gesture recognition of a human from an image by using the directivity information of the fingers. To implement a fast recognition system, we applied the morphological shape decomposition. A proposed gesture recognition algorithm has been tested on the 300 ${\times}$ 256 digital images. Our experiments using image acquired image camera have shown that the proposed hand gesture recognition algorithm is effective.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(2)
• /
• pp.113-116
• /
• 2001

In this paper we present a new hierarchical layout object extraction algorithm, which is based on rectangles rather than edges. The original layout data is modeled as instances connected by wires. Each polygon shape is divided into a set of rectangles and the instances and wires are extracted and recognized from those rectangles together with their connection and size information. We have applied the algorithm to actual layouts. Experiments on several standard cell library demonstrate the effectiveness of the algorithm.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.943-946
• /
• 1999

In this paper, we present a new clock routing algorithm which minimizes total wirelength under any given path-length skew bound. The algorithm onstructs a bounded-skew tree(BST) in two steps:(ⅰ) a bottom-up phase to construct a binary tree of shortest-distance feasible regions which represent the loci of possible placements of clock entry points, and (ⅱ) a top-down phase to determine the exact locations of clock entry points. Experimental results show that our clock routing algorithm, named BST/DME, can produce a set of solutions with skew and wirelength trade-off.