• The Journal of Information Technology
• /
• v.3 no.1
• /
• pp.117-124
• /
• 2000

This paper proposes a new heuristic algorithm of a low power hardware allocation for Design Automation. The proposed algorithm works on scheduled input graph and allocates functional units, interconnections and registers by considering interdependency between operations and storage elements in each control step, in order to share registers and interconnections connected to functional units, as much as possible. The low power factor of the capacitance is reduced during the allocation. As the resource number reduce maximal . This paper shows the effectiveness of the algorithm by comparing experiments of existing system of the non low power.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2331-2334
• /
• 2003

Generally, skin color information has been widely used at the face region extraction step of the face region recognition process. But many experimental results show that they are very sensitive to the given threshold range which is used to extract the face regions at the input image. In this paper, we propose a face region extraction algorithm based on an adaptive range decision for skin color. First we extract the pixels which are regarded as the candidate skin color pixels by using the given range for skin color extraction. Then, the ratio between the total pixels and the extracted pixels is calculated. According to the ratio, we adaptively decide the range of the skin color and extract face region. From the experiment results for the various images, the proposed algorithm shows more accurate results than the conventional algorithm.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1991.10a
• /
• pp.69-72
• /
• 1991

This paper proposes an efficient algorithm that constructs 3 dimensional solid object from orthographic views. The 3D object construction algorithm inputs vertices and edges information of 3 orthogonal views, generates 2 dimensional surfaces of input views, 3 dimensional possible vertices, possible edges and possible surfaces, compares 2 dimensional projections of 3 dimensional possible surface with two dimensional surfaces from orthogonal views and then determines the solution. This algorithm has been proved to be efficient in reducing the time taken and is useful for CAD system, 3 dimensional scene analysis system and object modellings for 3D graphics. The algorithm has been implemented in C language on the IBM PC/AT.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1193-1200
• /
• 2000

A network topology has been an important factor for an efficient network management, but data collection for the network configuration has been done manually or semi automatically by a network administrator or an expert. Requirements to generate an intro-domain network topology ar usually either all IP addresses with subne $t^ernet mask or the network identification of all IP addresses. The amounts of traffic are generally high in the semi-automatic system due to using large number of low-level protocols and commands to get rather simple data. In this paper, we propose an algorithm which can be executed with only publicly available input. It can find all IP addresses as well as the network boundary of an intra-domain by using an intelligent method developed in this algorithm. The collected data will be used to draw a network map automatically by using a proposed network topology generation algorithm.hm.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1255-1262
• /
• 2000

This paper proposes a hardware allocation and binding algorithm for ASIC Design. The proposed algorithm works on schedules input graph and simultaneously allocates and binds functional units, interconnections and registers by considering interdependency between operations and storage elements in each control step, in order to share registers and interconnections connected to functional units, as much as possible. Especially, he register allocation is executes the allocation optimal using graph coloring. This paper shows the effectiveness of the algorithm by comparing experiments to determine number of functional unit and register in advance or to separate executing allocation and binding of existing system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12A
• /
• pp.1133-1137
• /
• 2008

Sphere decoding is considered as one of the most promising methods for multiple-input multiple-output (MIMO) detection. This paper proposes a novel 2-level-search sphere decoding algorithm. In the proposed algorithm, symbol detection is concurrently performed on two levels of the tree search, which helps avoid discarding good candidates at early stages. Simulation results demonstrate the good performance of the proposed algorithm in terms of bit-error-rate (BER).

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.2
• /
• pp.121-129
• /
• 2000

The fuzzy-based SAM algorithm is proposed in this thesis to reduce the idle time. to recover call truncation fast when it is handed off and to last frequency acquisition in the mobile communications. It has additive and adaptive elements. Its weight values are generated not by feedback but by input conversion values. The initial expectation value is defined and forwardㆍbackward searching is executed 4o produce the expectation value of one chip. The fuzzy-based SAM algorithm is applied to the demodulator in CDMA system, and the synchronization time is measured. Synchronization time of PN code is 1.678$\mu\textrm{s}$ by SAM algorithm. It is 993 times faster than time of the conventional systems, 1.667$\mu\textrm{s}$.

• Journal of the Semiconductor & Display Technology
• /
• v.15 no.2
• /
• pp.43-48
• /
• 2016

In this paper, we propose a traffic light detection and recognition (TLDR) algorithm in the daytime. The proposed algorithm utilizes the color and shape information for the TLDR. At first, a traffic light is detected and recognized based on its shape information. Then, the color range of the detected traffic light is investigated in HSV color space. The input data of the proposed TLDR algorithm is the color image captured using the black box camera during driving. Our simulations demonstrate that the proposed algorithm can achieve a high detection and recognition performance for the images including traffic lights.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.2
• /
• pp.195-205
• /
• 2005

In decision tree analysis, C4.5 and CART algorithm have some problems of computational complexity and bias on variable selection. But QUEST algorithm solves these problems by dividing the step of variable selection and split point selection. When input variables are continuous, QUEST algorithm uses ANOVA F-test under the assumption of normality and homogeneity of variances. In this paper, we investigate the influence of violation of normality assumption and effect of the transformation of variables in the QUEST algorithm. In the simulation study, we obtained the empirical powers of variable selection and the empirical bias of variable selection after transformation of variables having various type of underlying distributions.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.3060-3062
• /
• 2000

A fast optimal path planning algorithm using the analog Cellular Nonlinear Circuits (CNC) is proposed. The proposed algorithm compute the optimal path using subgoal-based dynamic programming algorithm. In the algorithm, the optimal paths are computed regardless of the distance between the initial and the goal position. It begins to find subgoals starting from the initial position when the output of the initial cell becomes nonzero value. The suboal is set as the initial position to find the next subgoal until the final goal is reached. Simulations have been done considering the imprecise hardware fabrication and the limitation of the magnitude of input value.