• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.2
• /
• pp.114-125
• /
• 1998

In this study, for the first time, we propose the ADI(Adaptive De-Interlacing) algorithm, which improves visually and subjectively, horizontal and vertical edges on the image processed by the ELA (Edge Based Line Average) method. The proposed ADI algorithm enlargesthe window size to 5*3 in order to utilize the feature of the continuity of edges, and the adaptive interpolator is employed to decide adaptiely horizontal, diagonal, and vertical edges. Based on the results of the compter simulation, it is confimed that the new ADI algorithm improve the PSNR by 0.5dB in the Lena image with 512*512 size and by 0.4dB in the sequence image of a salesman, respectively. For the horizontal and vertial edges on the still and salesman sequence images, the proposed ADI algorithm has better visulal improvement than the conventional ELA algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.1
• /
• pp.7-12
• /
• 2013

This paper proposed the optimal algorithm of grinding system and the method to realize it. The optimal function was proposed in order to design the optimal grinding process. DE(Differential Evolution) algorithm was used to obtain the selective optimal function. The realization of algorithm was implemented by LabView software used widely at industrial field and the proposed algorithm was verified for through computer simulation. The result of the proposed algorithm can be used for the guide line of the grinding process.

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

This paper presents the steering control algorithm of an up and down motion robot using a quaternion. The up and down motion robot is to be moved on an irregular floor that can inevitably result in the errors of both position and orientation. Especially the orientation error should be compensated every work in order to adjust the misaligned values of current orientation to those commanded values. In this paper, we propose a new steering control algorithm between the two values by using a quaternion with spherical cubic interpolation. The proposed algorithm is shown to be effective in terms of vibration when compared to a conventional simple compensation without interpolation, by using $MATLAB^{(R)}$ and $VisualNastran4D^{(R)}$

• Journal of Electrical Engineering and Technology
• /
• v.8 no.5
• /
• pp.1012-1020
• /
• 2013

In this work, Self-adaptive Differential Evolutionary (SaDE) algorithm is proposed to solve Optimal Location and Size of Capacitor (OLSC) problem in radial distribution networks. To obtain the SaDE algorithm, two improvements have been applied on control parameters of mutation and crossover operators. To expand the study, three load conditions have been considered, i.e., constant, varying and effective loads. Objective function is introduced for the load conditions. The annual cost is fitness of problem, in addition to this cost, CPU time, voltage profile, active power loss and total installed capacitor banks and their related costs have been used for comparisons. To confirm the ability of each improvements of SaDE, the improvements are studied both in separate and simultaneous conditions. To verify the effectiveness of the proposed algorithm, it is tested on IEEE 10-bus and 34-bus radial distribution networks and compared with other approaches.

• The KIPS Transactions:PartC
• /
• v.18C no.5
• /
• pp.287-292
• /
• 2011

Using an expanded DES key, we suggest a block cipher algorithm to generate and to use a variable P box. We also present an efficient way for the implementation of variable P box at each round. Using counter examples on Differential Cryptanalysis(DC) and Linear Cryptanalysis(LC), we show that the suggested algorithm is strong enough to overcome those attacks. Compared with the real key bits of triple DES(3DES), the new algorithm is much safer in the points of the exhaustive attack. The results of computer simulations show that the new algorithm is almost 3 times faster than 3DES regarding the cipher process time.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.7
• /
• pp.89-96
• /
• 2002

In this paper, the ADI(Adaptive De-interlacing) algorithm is proposed, which improves visually and subjectively horizontal and vertical edges of the image processed by the ELA(Edge Line-based Average) method. This paper also proposes a VLSI architecture for the proposed algorithm and the architecture designed through the full custom CMOS layout process. The proposed algorithm is verified using C and Matlab and implemented using $0.6{\mu}m$ 2-poly 3-metal CMOS standard libraries. For the circuit and logic simulation, Cadence tool is used.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.46-59
• /
• 2004

In this paper, we present two algorithms for efficiently aggregating link state information needed for quality-of-service (QoS) routing. In these algorithms, each edge node in a group is mapped onto a node of a shufflenet or a node of a de Bruijn graph. By this mapping, the number of links for which state information is maintained becomes aN (a is an integer, N is the number of edge nodes) which is significantly smaller than N2 in the full-mesh approach. Our algorithms also can support asymmetric link state parameters which are common in practice, while many previous algorithms such as the spanning tree approach can be applied only to networks with symmetric link state parameters. Experimental results show that the performance of our shufflenet algorithm is close to that of the full-mesh approach in terms of the accuracy of bandwidth and delay information, with only a much smaller amount of information. On the other hand, although it is not as good as the shufflenet approach, the de Bruijn algorithm also performs far better than the star approach which is one of the most widely accepted schemes. The de Bruijn algorithm needs smaller computational complexity than most previous algorithms for asymmetric networks, including the shufflenet algorithm.

• Korean Journal of Remote Sensing
• /
• v.31 no.1
• /
• pp.21-28
• /
• 2015

The essential idea of de-noising is referring to neighboring pixels of a center pixel to be updated. Conventional adaptive de-noising filters use local statistics, i.e., mean and variance, of neighboring pixels including the center pixel. The drawback of adaptive de-noising filters is that their performance becomes low when edges are contained in neighboring pixels, while anisotropic diffusion de-noising filters remove adaptively noises and preserve edges considering intensity difference between neighboring pixel and the center pixel. The anisotropic diffusion de-noising filters, however, use only intensity difference between neighboring pixels and the center pixel, i.e., local statistics of neighboring pixels and the center pixel are not considered. We propose a new connectivity function of two adjacent pixels using statistics of neighboring pixels and apply connectivity function to diffusion coefficient. Experimental results using an aerial image corrupted by uniform and Gaussian noises showed that the proposed algorithm removed more efficiently noises than conventional diffusion filter and median filter.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1349-1354
• /
• 1990

This paper deals with the control of autonomous vehicle in the production systems. Presently, there is a significant interest in autonomous vehicles which are capable of intelligent motion (and action) without requiring a guide track to follow. This paper describes a PI-F adaptive control algorithm, which is used to drive an experimental autonomous vehicle along a given trajectory. The simulation results characterizing the accuracy og the algorithm are presented.

• Computers and Concrete
• /
• v.2 no.5
• /
• pp.411-421
• /
• 2005

A linear programming problem of the optimal proportioning of concrete aggregates is discussed; and a self-adaptive genetic algorithm is developed to solve this problem. The proposed method is based on changing a range of variables for capturing the feasible region of the optimum solution. A computational verification of this method is compared with the results of the linear programming.