• 한국정보디스플레이학회:학술대회논문집
• /
• 2004.08a
• /
• pp.239-242
• /
• 2004

This paper presents a novel contrast enhance algorithm for images displayed with bright environment light. This algorithm is designed to preserve local contrast based on the luminance ratio of the pixel to its local surround in attention. This algorithm improves image quality of projectors in a bright room.

• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.959-973
• /
• 2001

We shall discuss one of some techniques needed to analyze algorithms. It is called a big-O function technique. The measures of efficiency of an algorithm have two cases. One is the time used by a computer to solve the problem using this algorithm when the input values are of a specified size. The other one is the amount of computer memory required to implement the algorithm when the input values are of a specified size. Mainly, we will restrict our attention to time complexity. To figure out the Time Complexity in nonlinear problems of Numerical Analysis seems to be almost impossible.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.1
• /
• pp.17-21
• /
• 2003

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 algorithms 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 develop a hierarchical clustering algorithm. An experimental section shows performance of the proposed approach.

• Journal of Computational Design and Engineering
• /
• v.3 no.1
• /
• pp.24-36
• /
• 2016

During the past decade, solving complex optimization problems with metaheuristic algorithms has received considerable attention among practitioners and researchers. Hence, many metaheuristic algorithms have been developed over the last years. Many of these algorithms are inspired by various phenomena of nature. In this paper, a new population based algorithm, the Lion Optimization Algorithm (LOA), is introduced. Special lifestyle of lions and their cooperation characteristics has been the basic motivation for development of this optimization algorithm. Some benchmark problems are selected from the literature, and the solution of the proposed algorithm has been compared with those of some well-known and newest meta-heuristics for these problems. The obtained results confirm the high performance of the proposed algorithm in comparison to the other algorithms used in this paper.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.545-550
• /
• 1991

Recently, the use of robots for painting operations has received much attention, as it is a powerful means for automation and quality improvement. Collision-avoidance is a key issue in the path planning for painting operations. In this paper, we develop a computationally efficient algorithm for the generation of collision-free path for two types of motion: a) Gross motion when the robot approaches the painting area, and b) Fine motion while spraying the surface. The former is a typical collision-avoidance problem, but the latter calls for special attention as the painting mechanics has to be incorporated into path planning. The developed algorithm is applied for the internal coating of the car body whose structure is the major source of collision.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.05a
• /
• pp.358-361
• /
• 2021

In order to improve the accuracy of small target detection more effectively, this paper proposes an improved single shot detector (SSD) target detection and recognition method based on cspdarknet53, which introduces lightweight ECA attention mechanism and Feature Pyramid Network (FPN). First, the original SSD backbone network is replaced with cspdarknet53 to enhance the learning ability of the network. Then, a lightweight ECA attention mechanism is added to the basic convolution block to optimize the network. Finally, FPN is used to gradually fuse the multi-scale feature maps used for detection in the SSD from the deep to the shallow layers of the network to improve the positioning accuracy and classification accuracy of the network. Experiments show that the proposed target detection algorithm has better detection accuracy, and it improves the detection accuracy especially for small targets.

• Korean Journal of Remote Sensing
• /
• v.37 no.5_1
• /
• pp.1061-1070
• /
• 2021

In this manuscript, we tried to improve the performance of the FC-DenseNet by applying an attention gate for the classification of cropping areas. The attention gate module could facilitate the learning of a deep learning model and improve the performance of the model by injecting of spatial/spectral weights to each feature map. Crop classification was performed in the onion and garlic regions using a proposed deep learning model in which an attention gate was added to the skip connection part of FC-DenseNet. Training data was produced using various PlanetScope satellite imagery, and preprocessing was applied to minimize the problem of imbalanced training dataset. As a result of the crop classification, it was verified that the proposed deep learning model can more effectively classify the onion and garlic regions than existing FC-DenseNet algorithm.

• International journal of advanced smart convergence
• /
• v.9 no.1
• /
• pp.177-184
• /
• 2020

In this paper, we studied to direction of arrival (DoA) estimation to use DoA and optimum weight algorithms in coherent interference channels. The DoA algorithm have been considerable attention in signal processing with coherent signals and a limited number of snapshots in a noise and an interference environment. This paper is a proposed method for the desired signal estimation using MUSIC algorithm and adaptive beamforming to compare classical subspace techniques. Also, the proposed method is combined the updated weight value with LCMV beamforming algorithm in adaptive antenna array system for direction of arrival estimation of desired signal. The proposed algorithm can be used with combination to MUSIC algorithm, linearly constrained minimum variance beamforming (LCMV) and the weight value method to accurately desired signal estimation. Through simulation, we compare the proposed method with classical direction of in order to desired signals estimation. We show that the propose method has achieved good resolution performance better that classical direction arrival estimation algorithm. The simulation results show the effectiveness of the proposed method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2824-2838
• /
• 2013

There has been a lot of attention paid recently to analyze dynamic human gestures that vary over time. Most attention to dynamic gestures concerns with spatio-temporal features, as compared to analyzing each frame of gestures separately. For accurate dynamic gesture recognition, motion feature extraction algorithms need to find representative features that uniquely identify time-varying gestures. This paper proposes a new feature-extraction algorithm using temporal self-similarity based on a hierarchical human model. Because a conventional temporal self-similarity method computes a whole movement among the continuous frames, the conventional temporal self-similarity method cannot recognize different gestures with the same amount of movement. The proposed model-based temporal self-similarity method groups body parts of a hierarchical model into several sets and calculates movements for each set. While recognition results can depend on how the sets are made, the best way to find optimal sets is to separate frequently used body parts from less-used body parts. Then, we apply a multiclass support vector machine whose optimization algorithm is based on structural support vector machines. In this paper, the effectiveness of the proposed feature extraction algorithm is demonstrated in an application for taebo gesture recognition. We show that the model-based temporal self-similarity method can overcome the shortcomings of the conventional temporal self-similarity method and the recognition results of the model-based method are superior to that of the conventional method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.4
• /
• pp.1275-1292
• /
• 2021

As a fine-grained classification problem, aspect-level sentiment classification predicts the sentiment polarity for different aspects in context. To address this issue, researchers have widely used attention mechanisms to abstract the relationship between context and aspects. Still, it is difficult to effectively obtain a more profound semantic representation, and the strong correlation between local context features and the aspect-based sentiment is rarely considered. In this paper, a hybrid attention capsule network for aspect-level sentiment classification (ABASCap) was proposed. In this model, the multi-head self-attention was improved, and a context mask mechanism based on adjustable context window was proposed, so as to effectively obtain the internal association between aspects and context. Moreover, the dynamic routing algorithm and activation function in capsule network were optimized to meet the task requirements. Finally, sufficient experiments were conducted on three benchmark datasets in different domains. Compared with other baseline models, ABASCap achieved better classification results, and outperformed the state-of-the-art methods in this task after incorporating pre-training BERT.