• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.3
• /
• pp.81-89
• /
• 2021

Under natural conditions, Apple detection has the problems of occlusion and small object detection difficulties. This paper proposes an improved model based on SSD. The SSD backbone network VGG16 is replaced with the ResNet50 network model, and the receptive field structure RFB structure is introduced. The RFB model amplifies the feature information of small objects and improves the detection accuracy of small objects. Combined with the attention mechanism (SE) to filter out the information that needs to be retained, the semantic information of the detection objectis enhanced. An improved SSD algorithm is trained on the VOC2007 data set. Compared with SSD, the improved algorithm has increased the accuracy of occlusion and small object detection by 3.4% and 3.9%. The algorithm has improved the false detection rate and missed detection rate. The improved algorithm proposed in this paper has higher efficiency.

• The Journal of Korea Robotics Society
• /
• v.17 no.4
• /
• pp.425-430
• /
• 2022

As robots are considered one of the mainstream digital transformations, robots with machine vision becomes a main area of study providing the ability to check what robots watch and make decisions based on it. However, it is difficult to find a small object in the image mainly due to the flaw of the most of visual recognition networks. Because visual recognition networks are mostly convolution neural network which usually consider local features. So, we make a model considering not only local feature, but also global feature. In this paper, we propose a detection method of a small marker on the object using deep learning and an algorithm that considers global features by combining Transformer's self-attention technique with a convolutional neural network. We suggest a self-attention model with new definition of Query, Key and Value for model to learn global feature and simplified equation by getting rid of position vector and classification token which cause the model to be heavy and slow. Finally, we show that our model achieves higher mAP than state of the art model YOLOr.

• Journal of Information Processing Systems
• /
• v.19 no.1
• /
• pp.98-108
• /
• 2023

This paper is an attempt to design segmentation method based on fully convolutional networks (FCN) and attention mechanism. The first five layers of the Visual Geometry Group (VGG) 16 network serve as the coding part in the semantic segmentation network structure with the convolutional layer used to replace pooling to reduce loss of image feature extraction information. The up-sampling and deconvolution unit of the FCN is then used as the decoding part in the semantic segmentation network. In the deconvolution process, the skip structure is used to fuse different levels of information and the attention mechanism is incorporated to reduce accuracy loss. Finally, the segmentation results are obtained through pixel layer classification. The results show that our method outperforms the comparison methods in mean pixel accuracy (MPA) and mean intersection over union (MIOU).

• Journal of information and communication convergence engineering
• /
• v.10 no.1
• /
• pp.40-44
• /
• 2012

Data mining, which is attracting public attention, is a process of drawing out knowledge from a large mass of data. The key technique in data mining is the ability to maximize the similarity in a group and minimize the similarity between groups. Since grouping in data mining deals with a large mass of data, it lessens the amount of time spent with the source data, and grouping techniques that shrink the quantity of the data form to which the algorithm is subjected are actively used. The current grouping algorithm is highly sensitive to static and reacts to local minima. The number of groups has to be stated depending on the initialization value. In this paper we propose a gene algorithm that automatically decides on the number of grouping algorithms. We will try to find the optimal group of the fittest function, and finally apply it to a data mining problem that deals with a large mass of data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8A
• /
• pp.828-834
• /
• 2010

In this paper, an adaptive cross-layer resource allocation algorithm for the downlink multi-user OFDM system is proposed. The proposed algorithm does not only concern the wireless characteristics of physical (PHY) layer, but also pays attention to the user's quality of service (QoS) requirement, fairness, and packet queue state information of medium access control (MAC) layer. The algorithm is composed of two parts: one is to decide the priority of the user, and the other is to assign the radio resource according to its priority. Simulation results show that the proposed algorithm has both steady QoS and low computation complexity, even though the mobile users have different receiving signal to noise ratio (SNR).

• Journal of Sensor Science and Technology
• /
• v.13 no.3
• /
• pp.224-229
• /
• 2004

In this paper, we propose a new Active Noise Control (ANC) system using a teacher forced Blind Source Separation (BSS) algorithm. The Blind Source Separation based on the Independent Component Analysis (ICA) separates the desired sound signal from the unwanted noise signal. In the proposed system, the BSS algorithm is used as a preprocessor of ANC system. Also, we develop a teacher forced BSS learning algorithm to enhance the performance of BSS. The teacher signal is obtained from the output signal of the ANC system. Computer experimental results show that the proposed ANC system in conjunction with the BSS algorithm effectively cancels only the ship engine noise signal from the linear and convolved mixtures with human voice.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.2
• /
• pp.101-114
• /
• 2000

Multicasting is the simultaneous transmission of data to multiple destinations. In multicast ATM networks the effect of failures on transmission links or nodes can be catastrophic so that the issue of survivability is of great importance. However little attention has been paid to the problem of multicast restoration. This paper presents an efficient heuristic technique for routing backup virtual paths in ulticast networks with link failure. Genetic algorithm is employed here as a heuristic. In the application of genetic algorithm to the problem, a new genetic encoding and decoding method and genetic operators are proposed in this paper. The other several heuristics are also presented in order to assess the performance of the proposed algorithm. Experimental results demonstrate that our algorithm is a promising approach to solving the problem.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.3
• /
• pp.417-429
• /
• 1998

This paper considers two-sided (left and right side) assembly lines which are often used, especially in assembling large-sized products such as trucks and buses. A large number of exact algorithms and heuristics have been proposed to balance one-sided lines. However, little attention has been paid to balancing two-sided assembly lines. We present an efficient algorithm based on a branch and bound for balancing two-sided assembly lines. The algorithm involves a procedure for generating an enumeration tree. To efficiently search for the near optimal solutions to the problem, assignment rules are used in the method. New and existing bound strategies and dominance rules are else employed. The proposed algorithm can find a near optimal solution by enumerating feasible solutions partially. Extensive computational experiments are carried out to make the performance comparison between the proposed algorithm and existing ones. The computational results show that our algorithm is promising and robust in solution quality.

• Journal of Positioning, Navigation, and Timing
• /
• v.11 no.2
• /
• pp.99-107
• /
• 2022

Urban Air Mobility (UAM) such as a drone taxi is one of the future transportations that have recently been attracting attention. Along with the construction of an urban terminal, an accurate landing system for UAM is also essential. However, in urban environments, reliable Global Navigation Satellite Systems (GNSS) signals cannot be received due to obstacles such as high-rise buildings which causes multipath and non-line of sight signal. Thus, the positioning result in urban environments from the GNSS signal is unreliable. Consequently, we propose the Ultra-Wideband (UWB) network to assist the soft landing of UAM on a vertiport. Since the positioning performance of UWB network depends on the layout of UWB anchors, it is necessary to optimize the layout of UWB anchors. In this paper, we propose a two-steps genetic algorithm that consists of binary genetic algorithm involved multi objectives fitness function and integer genetic algorithm involved robust solution searching fitness function in order to optimize taking into account Fresnel hole effects.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.63
• /
• pp.23-31
• /
• 2001

Data mining can be either directed or undirected. One way of thinking about it is that we use undirected data mining to recognize relationship in the data and directed data mining to explain those relationships once they have been found. Several data mining techniques have received considerable research attention. In this paper, we propose an algorithm for discovering association rules as directed data mining and applying them to classification. In the first phase, we find frequent closed itemsets and association rules. After this phase, we construct the decision trees using discovered association rules. The algorithm can be applicable to customer relationship management.