• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.1001-1004
• /
• 2006

Many researches have been processed to reconstruct corrupted an image by noise in fields of signal processing such as image recognition and compute. vision, and AWGN(additive white gaussian noise) and impulse noise are representative. Impulse noise consists of fired-valued(salt & pepper) impulse noise and random-valued impulse noise, and non-linear filters such as SM(standard median) filters are used to remove this noise. But basic SM filters still generate many errors in edge regions of an image, and in order to overcome this problem a variety of methods have been researched. In this paper, we proposed an impulse noise removal algorithm which is superior to the edge preserving capacity. At this tine, after detecting a noise by using the noise detector, we applied a noise removal algorithm based on the min-max operation and compared the capacity with existing methods through simulation.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.4 s.42
• /
• pp.17-25
• /
• 2006

An intelligent game has been studied for some time, and the main purpose of the study was to win against human by enhancing game skills. But some commercial games rather focused on adaptation of the user's behavior in order to bring interests on the games. In this study, we are suggesting an adaptive reinforcement learning algorithm, which focuses on the adaptation of user behavior. We have designed and developed the Othello game, which provides large state spaces. The evaluation of the experiment was done by playing two reinforcement learning algorithms against Min-Max algorithm individually. And the results show that our approach is playing more improved learning rate, than the previous reinforcement learning algorithm.

• Journal of Information Processing Systems
• /
• v.14 no.6
• /
• pp.1457-1463
• /
• 2018

In recent times, Natural User Interface/Natural User Experience (NUI/NUX) technology has found widespread application across a diverse range of fields and is also utilized for controlling unmanned aerial vehicles (UAVs). Even if the user controls the UAV by utilizing the NUI/NUX technology, it is difficult for the user to easily control the UAV. The user needs an autopilot to easily control the UAV. The user needs a flight path to use the autopilot. The user sets the flight path based on the waypoints. UAVs normally fly straight from one waypoint to another. However, if flight between two waypoints is in a straight line, UAVs may collide with obstacles. In order to solve collision problems, flight records can be utilized to adjust the generated path taking the locations of the obstacles into consideration. This paper proposes a natural path generation method between waypoints based on flight records collected through UAVs flown by users. Bayesian probability is utilized to select paths most similar to the flight records to connect two waypoints. These paths are generated by selection of the center path corresponding to the highest Bayesian probability. While the K-means algorithm-based straight-line method generated paths that led to UAV collisions, the proposed method generates paths that allow UAVs to avoid obstacles.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.4
• /
• pp.141-147
• /
• 1996

In this paper an improved morphological algorithm for directional defect detection is proposed, where the defect is parallel to the texture image. The algorithm is based on obtaining the background image while removing the defect by comparing every directional morphological result with max or min except that of defect. The defect can of defect and the background image. For a computer simulation, it is shown that the proposed method has better performance than the conventional algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.45
• /
• pp.25-32
• /
• 1998

A modified simulated annealing algorithm is proposed and applied to the permutation flowshop scheduling with the makespan objective. Based on the job deletion and insertion method, a newly defined Max-min perturbation scheme is proposed to obtain a better candidate solution in the simulated annealing process. The simulation experiments are conducted to evaluate the effectiveness of the proposed algorithm against the existing heuristics and results are reported.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2013.07a
• /
• pp.271-273
• /
• 2013

본 논문에서는 비파괴 검사를 통하여 얻은 세라믹 영상에 퍼지 기법과 ART2 기법을 적용하여 결함을 검출하는 방법을 제안한다. 제안된 방법은 세라믹 소재로 얻어진 영상에서 결함의 구간을 설정하기 위해 퍼지 스트레칭 기법을 적용하여 명암도를 대비시킨다. 명암 대비가 강조된 영상에서 퍼지 이진화 기법을 적용한 후, 상/하 경계선에 가장 많이 분포된 곳을 Max, Min으로 설정하고, Max+20, Min-20을 결함 구간으로 설정한다. 설정한 결함 구간 내의 비파괴 세라믹 영상에서 ART2 알고리즘 기법을 적용하여 세라믹 영상의 결함을 검출한다. 본 논문에서 제안된 방법을 비파괴 세라믹 영상을 대상으로 실험한 결과, 제안된 방법이 기존의 세라믹 결함 검출 방법보다 비파괴 세라믹 영상에서 다양한 형태의 결함이 검출되는 것을 확인하였다.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.415-424
• /
• 2008

In this paper, we compare the QoS performance enhancement schemes according to the network architecture of mobile WiMAX system in order to improve the end-to-end QoS performance and propose QoS parameter mapping method and IP packet scheduling algorithm. To evaluate the end-to-end QoS performance, we implemented an end-to-end simulator of mobile WiMAX system using OPNET. Simulation results show that the proposed QoS parameter mapping scheme reduces the average delay of VoIP packet and improves uplink resource efficiency. And also, when the proposed IP packet scheduling algorithm is applied to the system, the end-to-end packet transmission delay of VoIP service can be reduced by 44-67 percent compared to FIFO and WRR scheduler.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.3
• /
• pp.201-207
• /
• 2018

There is no known polynomial time algorithm for random-type quadratic assignment problem(RQAP) that is a NP-complete problem. Therefore the heuristic or meta-heuristic approach are solve the approximated solution for the RQAP within polynomial time. This paper suggests polynomial time algorithm for random type quadratic assignment problem (QAP) with time complexity of $O(n^2)$. The proposed algorithm applies one-to-one matching strategy between ascending order of sum of distance for each location and descending order of sum of quantity for each facility. Then, swap the facilities for reflect the correlation of distances of locations and quantities of facilities. For the experimental data, this algorithm, in spite of $O(n^2)$ polynomial time algorithm, can be improve the solution than genetic algorithm a kind of metaheuristic method.

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.669-674
• /
• 2001

In order to reflect the aggregation situation in the aggregation process, aggregation based on situation assessment (ASA) method was proposed in [1]. It consists of the situation assessment model (SAM) and the ASA algorithm. In the SAM, the value of parameter, p, is transformed into the nearest integer value [1]. The integer-typed output of SAM is used as input for an aggregation. The integer-typed output of SAM indicates the current degree of aggregation situation. The ASA algorithm produces at most finite several aggregation results between min and max. In the sequel, the ASA method can not properly handle the applications with the more sophisticated aggregation results between min and max. In order to solve this problem, we propose two improved ASA (I-ASA) methods. In these I-ASA methods, we allow the value of parameter of SAM to be a real number, and suggest two improved ASA algorithms to make continuous aggregation results between min and max. These I-ASA methods can handle both a precise aggregation and an approximate aggregation. Therefore, when compared to the ASA method [1], the proposed I-ASA methods have advantages in that they can handle the applications with the more sophisticated aggregation results and can be used in the more general applications for aggregations.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.15 no.2
• /
• pp.1-9
• /
• 2011

An optimal design method for a structural control system considering load variations due to their uncertain characteristics is studied in this paper. The conventional design problem for a control system generally deals with the optimization problem of a structural control system and interaction between the structure and the control device. This study deals with the optimization problem of a load-structure-control system and the more complicated interactions with each other. The problem of finding the load that maximizes the structural responses and the structural control system that minimizes the responses simultaneously is formulated as the min-max problem. In order to effectively obtain the optimal design variables, a co-evolutionary algorithm is adopted and, as a result, an optimal design procedure for the linear structural control system with uncertain dynamic characteristics is proposed. The example design and simulated results of an earthquake excited structure validates the proposed method.