• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6C
• /
• pp.490-496
• /
• 2005

In this paper, we propose a self-constructed clustering algorithm based on inference information of the fuzzy model. This method makes it possible to automatically detect and optimize the number of cluster and parameters by using input-output data. The propose method improves the performance of clustering by extended supervised learning technique. This technique uses the output information as well as input characteristics. For effect the similarity measure in clustering, we use the TSK fuzzy model to sent the information of output. In the conceptually, we design a learning method that use to feedback the information of output to the clustering since proposed algorithm perform to separate each classes in input data space. We show effectiveness of proposed method using simulation than previous ones

• Journal of The Korean Society of Agricultural Engineers
• /
• v.64 no.1
• /
• pp.15-26
• /
• 2022

3D open-field farm model developed from UAV (Unmanned Aerial Vehicle) data could make crop monitoring easier, also could be an important dataset for various fields like remote sensing or precision agriculture. It is essential to separate crops from the non-crop area because labeling in a manual way is extremely laborious and not appropriate for continuous monitoring. We, therefore, made a 3D open-field farm model based on UAV images and developed a crop segmentation model using a supervised machine learning algorithm. We compared performances from various models using different data features like color or geographic coordinates, and two supervised learning algorithms which are SVM (Support Vector Machine) and KNN (K-Nearest Neighbors). The best approach was trained with 2-dimensional data, ExGR (Excess of Green minus Excess of Red) and z coordinate value, using KNN algorithm, whose accuracy, precision, recall, F1 score was 97.85, 96.51, 88.54, 92.35% respectively. Also, we compared our model performance with similar previous work. Our approach showed slightly better accuracy, and it detected the actual crop better than the previous approach, while it also classified actual non-crop points (e.g. weeds) as crops.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.5
• /
• pp.457-464
• /
• 2009

The weak classifier of AdaBoost algorithm is a central classification element that uses a single criterion separating positive and negative learning candidates. Finding the best criterion to separate two feature distributions influences learning capacity of the algorithm. A common way to classify the distributions is to use the mean value of the features. However, positive and negative distributions of Haar-like feature as an image descriptor are hard to classify by a single threshold. The poor classification ability of the single threshold also increases the number of boosting operations, and finally results in a poor classifier. This paper proposes a weak classifier that uses multiple criterions by adding a probabilistic criterion of the positive candidate distribution with the conventional mean classifier: the positive distribution has low variation and the values are closer to the mean while the negative distribution has large variation and values are widely spread. The difference in the variance for the positive and negative distributions is used as an additional criterion. In the learning procedure, we use a new classifier that provides a better classifier between them by selective switching between the mean and standard deviation. We call this new type of combined classifier the "Mixed Weak Classifier". The proposed weak classifier is more robust than the mean classifier alone and decreases the number of boosting operations to be converged.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2310-2325
• /
• 2016

In this paper, we provide a trajectory-generation algorithm that can identify pedestrians in real time. Typically, the contours for the extraction of pedestrians from the foreground of images are not clear due to factors including brightness and shade; furthermore, pedestrians move in different directions and interact with each other. These issues mean that the identification of pedestrians and the generation of trajectories are somewhat difficult. We propose a new method for trajectory generation regarding multiple pedestrians. The first stage of the method distinguishes between those pedestrian-blob situations that need to be merged and those that require splitting, followed by the use of trained decision trees to separate the pedestrians. The second stage generates the trajectories of each pedestrian by using the point-correspondence method; however, we introduce a new point-correspondence algorithm for which the A* search method has been modified. By using fuzzy membership functions, a heuristic evaluation of the correspondence between the blobs was also conducted. The proposed method was implemented and tested with the PETS 2009 dataset to show an effective multiple-pedestrian-tracking capability in a pedestrian-interaction environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.1
• /
• pp.211-230
• /
• 2022

In image segmentation, for the condition that objects (targets) and background in an image are intertwined or their common boundaries are vague as well as their textures are similar, and the targets in images are greatly variable, the deep learning might be difficult to use. Hence, a new method based on graph theory and guided feathering is proposed. First, it uses a guided feathering algorithm to initially separate the objects from background roughly, then, the image is separated into two different images: foreground image and background image, subsequently, the two images are segmented accurately by using the improved graph-based algorithm respectively, and finally, the two segmented images are merged together as the final segmentation result. For the graph-based new algorithm, it is improved based on MST in three main aspects: (1) the differences between the functions of intra-regional and inter-regional; (2) the function of edge weight; and (3) re-merge mechanism after segmentation in graph mapping. Compared to the traditional algorithms such as region merging, ordinary MST and thresholding, the studied algorithm has the better segmentation accuracy and effect, therefore it has the significant superiority.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.1
• /
• pp.1-8
• /
• 2022

In this paper, we propose a fire detection system based on CCTV images using an object tracking technology with YOLOv4 model capable of real-time object detection and a DeepSORT algorithm. The fire detection model was learned from 10800 pieces of learning data and verified through 1,000 separate test sets. Subsequently, the fire detection rate in a single image and fire detection maintenance performance in the image were increased by tracking the detected fire area through the DeepSORT algorithm. It is verified that a fire detection rate for one frame in video data or single image could be detected in real time within 0.1 second. In this paper, our AI fire detection system is more stable and faster than the existing fire accident detection system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.12
• /
• pp.2946-2952
• /
• 2014

Among the Example based Super Resolution(SR) techniques, Neighbor embedding(NE) has been inspired by manifold learning method, particularly locally linear embedding. However, the poor generalization of NE decreases the performance of such algorithm. The sizes of local training sets are always too small to improve the performance of NE. We propose the Learning Sparse-Neighbor Image Representation baesd on SVR having an excellent generalization ability to solve this problem. Given a low resolution image, we first use bicubic interpolation to synthesize its high resolution version. We extract the patches from this synthesized image and determine whether each patch corresponds to regions with high or low spatial frequencies. After the weight of each patch is obtained by our method, we used to learn separate SVR models. Finally, we update the pixel values using the previously learned SVRs. Through experimental results, we quantitatively and qualitatively confirm the improved results of the proposed algorithm when comparing with conventional interpolation methods and NE.

• Journal of IKEEE
• /
• v.24 no.2
• /
• pp.475-485
• /
• 2020

Recently, a crowdsensing system that provides a new sensing service with real-time sensing data provided from a user's device including a sensor without installing a separate sensor has attracted attention. In the crowdsensing system, meaningless data may be provided due to a user's operation error or communication problem, or false data may be provided to obtain compensation. Therefore, the detection and removal of the abnormal data determines the quality of the crowdsensing service. The proposed methods in the past to detect these anomalies are not efficient for the fast-changing environment of crowdsensing. This paper proposes an anomaly data detection method by extracting the characteristics of continuously and rapidly changing sensing data environment by using machine learning technology and modeling it with an appropriate algorithm. We show the performance and feasibility of the proposed system using deep learning binary classification model of supervised learning and autoencoder model of unsupervised learning.

• Journal of Internet Computing and Services
• /
• v.10 no.6
• /
• pp.159-171
• /
• 2009

The objective of this research is to explore a method to utilize a programmable robot, as a potential learning tool in the elementary school's curricula. Due to their programmability and operational ease of use, programmable robots are among digital toys that today offer specially instructive features. In this research, we developed the robot game-based project contents as a tool for teaching the elementary school children to learn the algorithm, the essential part of computer programming. The LEGO material, selected as the construction kit for robot, consists of a mechanical assembly system, a set of sensors and actuators, a central control unit, a programming environment. The project requires the children to complete 3 separate tasks, each of which is developed based on the principles of algorithm. The classroom feedback supports that the robotic experiences provided the children with fun and absorption. It is likely that implementing learning with robot in regular classroom in elementary school can bring new possibilities to the educational system, provided that a thorough preparation backs up the plan.

• Journal of Internet Computing and Services
• /
• v.16 no.3
• /
• pp.33-41
• /
• 2015

In this paper, the simplification procedure of Karnaugh Map, which is essential to design digital logic circuits, was implemented as web-based educational Java applets. The learners will be able to experience interesting learning process by executing the proposed Java applets. In addition, since the proposed Java applets were designed to contain educational technologies by step-by-step procedure, the maximization of learning efficiency can be obtained. The learners can make virtual experiments on the simplification of digital logic circuits by clicking on some buttons or filling out some text fields. Furthermore, the Boolean expression and its schematic diagram occurred in the simplification process will be displayed on the separate frame so that the learners can learn effectively. The schematic diagram enables them to check out if the logic circuit is correctly connected or not. Finally, since the simplification algorithm used in the proposed Java applet is based on the modified Quine-McCluskey minimization technique, the proposed Java applets will show more encouraging result in view of learning efficiency if it is used as assistants of the on-campus offline class.