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

Evolutionary algorithm has been receiving a remarkable attention due to the model-free and population-based parallel search attributes and much successful results are coming out. However, there are some problems in most of the evolutionary algorithms. The critical one is that it takes much time or large generations to search the global optimum in case of the objective function with multimodality. Another problem is that it usually cannot search all the local optima because it pays great attention to the search of the global optimum. In addition, if the objective function has several global optima, it may be very difficult to search all the global optima due to the global characteristics of the selection methods. To cope with these problems, at first we propose a preprocessing process, grid-filtering algorithm(GFA), and propose a new distributed evolutionary ...

• Journal of information and communication convergence engineering
• /
• 제20권3호
• /
• pp.195-203
• /
• 2022

Noise generated during image acquisition and transmission can negatively impact the results of image processing applications, and noise removal is typically a part of image preprocessing. Denoising techniques combined with nonlocal techniques have received significant attention in recent years, owing to the development of sophisticated hardware and image processing algorithms, much attention has been paid to; however, this approach is relatively poor for edge preservation of fine image details. To address this limitation, the current study combined a steering kernel technique with adaptive masks that can adjust the size according to the noise intensity of an image. The algorithm sets the steering weight based on a similarity comparison, allowing it to respond to edge components more effectively. The proposed algorithm was compared with existing denoising algorithms using quantitative evaluation and enlarged images. The proposed algorithm exhibited good general denoising performance and better performance in edge area processing than existing non-local techniques.

• Journal of Computing Science and Engineering
• /
• 제10권4호
• /
• pp.111-117
• /
• 2016

An accurate approach for diagnosis of attention deficit hyperactivity disorder (ADHD) is presented in this paper. The presented technique efficiently classifies three subtypes of ADHD (ADHD-C, ADHD-H, ADHD-I) and typically developing control (TDC) by using only structural magnetic resonance imaging (MRI). The research examines structural MRI of the hippocampus from the ADHD-200 database. Each available MRI has been processed by a region-of-interest (ROI) to build a set of features for further analysis. The presented ADHD diagnostic approach unifies feature selection and classification techniques. The feature selection technique based on the proposed binary-coded genetic algorithm searches for an optimal subset of features extracted from the hippocampus. The classification technique uses a chosen optimal subset of features for accurate classification of three subtypes of ADHD and TDC. In this study, the famous Extreme Learning Machine is used as a classification technique. Experimental results clearly indicate that the presented BCGA-ELM (binary-coded genetic algorithm coupled with Extreme Learning Machine) efficiently classifies TDC and three subtypes of ADHD and outperforms existing techniques.

• Nuclear Engineering and Technology
• /
• 제55권5호
• /
• pp.1630-1643
• /
• 2023

The correct situation awareness (SA) of operators is important for managing nuclear power plants (NPPs), particularly in accident-related situations. Among the three levels of SA suggested by Ensley, Level 3 SA (i.e., projection of the future status of the situation) is challenging because of the complexity of NPPs as well as the uncertainty of accidents. Hence, several prediction methods using artificial intelligence techniques have been proposed to assist operators in accident prediction. However, these methods only predict short-term plant status (e.g., the status after a few minutes) and do not provide information regarding the uncertainty associated with the prediction. This paper proposes an algorithm that can predict the multivariate and long-term behavior of plant parameters for 2 h with 120 steps and provide the uncertainty of the prediction. The algorithm applies bidirectional long short-term memory and an attention mechanism, which enable the algorithm to predict the precise long-term trends of the parameters with high prediction accuracy. A conditional variational autoencoder was used to provide uncertainty information about the network prediction. The algorithm was trained, optimized, and validated using a compact nuclear simulator for a Westinghouse 900 MWe NPP.

• 전자공학회논문지C
• /
• 제34C권4호
• /
• pp.36-44
• /
• 1997

An efficient context-free multiple-object segmentation using attention operator based on modified generalized symmetry transform is proposed and implemented by modifying a radial basis function network. By using the difference of intensity gradient, instead of te intensity gradient itself, in generalized symmetry tranform so as to make the attention operator to preserve the edges of the objects shape, an efficient context-free multiple-object segementation is proposed in which no a priori shape informtion on the objects is requried. The attention operator is implemented by using a modified radial basis function network which can reflect symmetry, and by using te edge pyramid of the input image, both of the local and the global symmetry of the objects are reflected simultaneously to make the multiple-object with different sizes be segmented with a singel fixed-size $n\timesm$ can be done with O(n) complexity. The simulaton results show that the proposed algorithm can efficiently be used in context-free multiple-object segmentation even for the low contrast IR images as well as for the images from the camera.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2007년도 추계 종합학술대회 논문집
• /
• pp.788-791
• /
• 2007

에이전트의 사리에 맞는 행동과 그에 따라 다양한 사건, 행위를 하기 위해 필요한 주의는 크게 인식, 성향, 욕구에 따라 발생할 수 있고 이 주의가 변화함으로써 컨텍스트의 변화가 생긴다. 본 논문에서는 주의의 처리 방법에 대한 알고리즘과 그에 따른 컨텍스트의 변화에 대한 처리방법의 알고리즘을 제시한다.

• ETRI Journal
• /
• 제36권2호
• /
• pp.253-263
• /
• 2014

In the near future, traditional narrow and fixed viewpoint video services will be replaced by high-quality panorama video services. This paper proposes a visual-attention-aware progressive region of interest (RoI) trick mode streaming service (VA-PRTS) that prioritizes video data to transmit according to the visual attention and transmits prioritized video data progressively. VA-PRTS enables the receiver to speed up the time to display without degrading the perceptual quality. For the proposed VA-PRTS, this paper defines a cutoff visual attention metric algorithm to determine the quality of the encoded video slice based on the capability of visual attention and the progressive streaming method based on the priority of RoI video data. Compared to conventional methods, VA-PRTS increases the bitrate saving by over 57% and decreases the interactive delay by over 66%, while maintaining a level of perceptual video quality. The experiment results show that the proposed VA-PRTS improves the quality of the viewer experience for interactive panoramic video streaming services. The development results show that the VA-PRTS has highly practical real-field feasibility.

• International Journal of Contents
• /
• 제15권4호
• /
• pp.8-15
• /
• 2019

This paper presents a solution of the 'Quick, Draw! Doodle Recognition Challenge' hosted by Google. Doodles are drawings comprised of concrete representational meaning or abstract lines creatively expressed by individuals. In this challenge, a doodle is presented as a sequence of sketches. From the view of at the sketch level, to learn the pattern of strokes representing a doodle, we propose a sequential model stacked with multiple convolution layers and Long Short-Term Memory (LSTM) cells following the attention mechanism [15]. From the view at the image level, we use multiple models pre-trained on ImageNet to recognize the doodle. Finally, an ensemble and a post-processing method using the minimum cost flow algorithm are introduced to combine multiple models in achieving better results. In this challenge, our solutions garnered 11th place among 1,316 teams. Our performance was 0.95037 MAP@3, only 0.4% lower than the winner. It demonstrates that our method is very competitive. The source code for this competition is published at: https://github.com/ngxbac/Kaggle-QuickDraw.

• 제어로봇시스템학회논문지
• /
• 제10권11호
• /
• pp.1071-1076
• /
• 2004

It is a fuzzy controller that it is the most used method in the control of non-linear system. The most important part in the fuzzy controller is a design of fuzzy rules. Many algorithm that design fuzzy rules have proposed. And attention to the evolutionary computation is increasing in the recent days. Among them, the co-evolutionary algorithm is used in the design of optimal fuzzy rule. This paper takes advantage of a schema co-evolutionary algorithm. In order to verify the efficiency of the schema co-evolutionary algorithm, a fuzzy controller for the mobile robot control is designed by the schema co-evolutionary algorithm and it is compared with other parasitic co-evolutionary algorithm such as a virus-evolutionary genetic algorithm and a co-evolutionary method of Handa.

• 한국산업경영시스템학회:학술대회논문집
• /
• 한국산업경영시스템학회 2002년도 춘계학술대회
• /
• pp.125-132
• /
• 2002

We study clustering algorithm for sequences of categorical values. Clustering is a data mining problem that has received significant attention by the database community. Traditional clustering algorlthms deal with numerical or categorical data points. However, there exist many important databases that store categorical data sequences. In this paper we introduce new similarity measure and develope a hierarchical clustering algorithm. An experimental section shows performance of the proposed approach.