• KIISE Transactions on Computing Practices
• /
• v.21 no.6
• /
• pp.393-402
• /
• 2015

Human resources are one of the most essential elements of an organization. In particular, the more closed a group is, the higher the value each member has. Previous studies have focused on personal attributes of individual, such as medical history, and have depended upon self-diagnosis to manage structures. However, this method has weak points, such as the timeconsuming process required, the potential for concealment, and non-disclosure of participants' mental states, as this method depends on self-diagnosis through extensive questionnaires or interviews, which is solved in an interactive way. It also suffers from another problem in that relations among people are difficult to express. In this paper, we propose a multi-faced diagnosis model based on social network analysis which overcomes former weaknesses. Our approach has the following steps : First, we reveal the states of those in a social network through 9 questions. Next, we diagnose the social network to find out specific individuals such as victims or leaders using the proposed algorithm. Experimental results demonstrated our model achieved 0.62 precision rate and identified specific people who are not revealed by the existing methods.

• Steel and Composite Structures
• /
• v.34 no.5
• /
• pp.743-767
• /
• 2020

Due to the impressive flexural performance, enhanced compressive strength and more constrained crack propagation, Fibre-reinforced concrete (FRC) have been widely employed in the construction application. Majority of experimental studies have focused on the seismic behavior of FRC columns. Based on the valid experimental data obtained from the previous studies, the current study has evaluated the seismic response and compressive strength of FRC rectangular columns while following hybrid metaheuristic techniques. Due to the non-linearity of seismic data, Adaptive neuro-fuzzy inference system (ANFIS) has been incorporated with metaheuristic algorithms. 317 different datasets from FRC column tests has been applied as one database in order to determine the most influential factor on the ultimate strengths of FRC rectangular columns subjected to the simulated seismic loading. ANFIS has been used with the incorporation of Particle Swarm Optimization (PSO) and Genetic algorithm (GA). For the analysis of the attained results, Extreme learning machine (ELM) as an authentic prediction method has been concurrently used. The variable selection procedure is to choose the most dominant parameters affecting the ultimate strengths of FRC rectangular columns subjected to simulated seismic loading. Accordingly, the results have shown that ANFIS-PSO has successfully predicted the seismic lateral load with R² = 0.857 and 0.902 for the test and train phase, respectively, nominated as the lateral load prediction estimator. On the other hand, in case of compressive strength prediction, ELM is to predict the compressive strength with R² = 0.657 and 0.862 for test and train phase, respectively. The results have shown that the seismic lateral force trend is more predictable than the compressive strength of FRC rectangular columns, in which the best results belong to the lateral force prediction. Compressive strength prediction has illustrated a significant deviation above 40 Mpa which could be related to the considerable non-linearity and possible empirical shortcomings. Finally, employing ANFIS-GA and ANFIS-PSO techniques to evaluate the seismic response of FRC are a promising reliable approach to be replaced for high cost and time-consuming experimental tests.

• The Journal of the Korea Contents Association
• /
• v.20 no.7
• /
• pp.674-682
• /
• 2020

Recently, the problem of air pollution has become a global concern due to industrialization and overcrowding. Air pollution can cause various adverse effects on human health, among which respiratory diseases such as asthma, which have been of interest in this study, can be directly affected. Previous studies have used clinical data to identify how air pollutant affect diseases such as asthma based on relatively small samples. This is high likely to result in inconsistent results for each collection samples, and has significant limitations in that research is difficult for anyone other than the medical profession. In this study, the main focus was on predicting the actual asthmatic occurrence, based on data on the atmospheric environment data released by the government and the frequency of asthma outbreaks. First of all, this study verified the significant effects of each air pollutant with a time lag on the outbreak of asthma through the time-lag Pearson Correlation Coefficient. Second, train data built on the basis of verification results are utilized in Deep Learning algorithms, and models optimized for predicting the asthmatic occurrence are designed. The average error rate of the model was about 11.86%, indicating superior performance compared to other machine learning-based algorithms. The proposed model can be used for efficiency in the national insurance system and health budget management, and can also provide efficiency in the deployment and supply of medical personnel in hospitals. And it can also contribute to the promotion of national health through early warning of the risk of outbreak by atmospheric environment for chronic asthma patients.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1011-1020
• /
• 2004

A lot of work has been done to improve the I/O performance of such a system that store and manage a massive amount of data by distributing them across multiple disks and access them in parallel. Most of the previous work has focused on an efficient mapping from a grid ceil, which is determined bY the interval number of each dimension, to a disk number on the assumption that each dimension is split into disjoint intervals such that entire data space is GRID-like partitioned. However, they have ignored the effects of a GRID partitioning scheme on declustering performance. In this paper, we enhance the performance of mapping function based declustering algorithms by applying a good GRID par-titioning method. For this, we propose an estimation model to count the number of grid cells intersected by a range query and apply a GRID partitioning scheme which minimizes query result size among the possible schemes. While it is common to do binary partition for high-dimensional data, we choose less number of dimensions than needed for binary partition and split several times along that dimensions so that we can reduce the number of grid cells touched by a query. Several experimental results show that the proposed estimation model gives accuracy within 0.5% error ratio regardless of query size and dimension. We can also improve the performance of declustering algorithm based on mapping function, called Kronecker Sequence, which has been known to be the best among the mapping functions for high-dimensional data, up to 23 times by applying an efficient GRID partitioning scheme.

• Journal of KIISE:Software and Applications
• /
• v.35 no.12
• /
• pp.789-799
• /
• 2008

For the communication between human and computer in an interactive computing environment, the gesture recognition has been studied vigorously. The algorithms which use the 2D features for the feature extraction and the feature comparison are faster, but there are some environmental limitations for the accurate recognition. The algorithms which use the 2.5D features provide higher accuracy than 2D features, but these are influenced by rotation of objects. And the algorithms which use the 3D features are slow for the recognition, because these algorithms need the 3d object reconstruction as the preprocessing for the feature extraction. In this paper, we propose a method to extract the 3D features combined with the 3D object reconstruction in real-time. This method generates three kinds of 3D projection maps using the modified GPU-based visual hull generation algorithm. This process only executes data generation parts only for the gesture recognition and calculates the Hu-moment which is corresponding to each projection map. In the section of experimental results, we compare the computational time of the proposed method with the previous methods. And the result shows that the proposed method can apply to real time gesture recognition environment.

• Journal of KIISE:Software and Applications
• /
• v.35 no.11
• /
• pp.671-680
• /
• 2008

Motion capture devices have been utilized in producing several contents, such as movies and video games. However, since motion capture devices are expensive and inconvenient to use, motions segmented from captured data was recycled and synthesized to utilize it in another contents, but the motions were generally segmented by contents producers in manual. Therefore, automatic motion segmentation is recently getting a lot of attentions. Previous approaches are divided into on-line and off-line, where ow line approaches segment motions based on similarities between neighboring frames and off-line approaches segment motions by capturing the global characteristics in feature space. In this paper, we propose a graph-based high-level motion segmentation method. Since high-level motions consist of repeated frames within temporal distances, we consider similarities between neighboring frames as well as all similarities among all frames within the temporal distance. This is achieved by constructing a graph, where each vertex represents a frame and the edges between the frames are weighted by their similarity. Then, normalized cuts algorithm is used to partition the constructed graph into several sub-graphs by globally finding minimum cuts. In the experiments, the results using the proposed method showed better performance than PCA-based method in on-line and GMM-based method in off-line, as the proposed method globally segment motions from the graph constructed based similarities between neighboring frames as well as similarities among all frames within temporal distances.

• KIPS Transactions on Software and Data Engineering
• /
• v.1 no.3
• /
• pp.177-186
• /
• 2012

In this paper, we propose a real-time approach for detecting and tracking a hand region by analyzing depth images. We build a hand model in advance. The model has the shape information of a hand. The detecting process extracts out moving areas in an image, which are possibly caused by moving a hand in front of a camera. The moving areas can be identified by analyzing accumulated difference images and applying the region growing technique. The extracted moving areas are compared against a hand model to get justified as a hand region. The tracking process keeps the track of center points of hand regions of successive frames. For this purpose, it involves three steps. The first step is to determine a seed point that is the closest point to the center point of a previous frame. The second step is to perform region growing to form a candidate region of a hand. The third step is to determine the center point of a hand to be tracked. This point is searched by the mean-shift algorithm within a confined area whose size varies adaptively according to the depth information. To verify the effectiveness of our approach, we have evaluated the performance of our approach while changing the shape and position of a hand as well as the velocity of hand movement.

• The KIPS Transactions:PartB
• /
• v.16B no.5
• /
• pp.385-394
• /
• 2009

Face tracking and recognition are difficult problems because the face is a non-rigid object. The main reasons for the failure to track and recognize the faces are the changes of a face pose and environmental illumination. To solve these problems, we propose a nonlinear manifold framework for the face pose and the face illumination normalization processing. Specifically, to track and recognize a face on the video that has various pose variations, we approximate a face pose density to single Gaussian density by PCA(Principle Component Analysis) using images sampled from training video sequences and then construct the GMM(Gaussian Mixture Model) for each person. To solve the illumination problem for the face tracking and recognition, we decompose the face images into the reflectance and the illuminance using the SSR(Single Scale Retinex) model. To obtain the normalized reflectance, the reflectance is rescaled by histogram equalization on the defined range. We newly approximate the illuminance by the trained manifold since the illuminance has almost variations by illumination. By combining these two features into our manifold framework, we derived the efficient face tracking and recognition results on indoor and outdoor video. To improve the video based tracking results, we update the weights of each face pose density at each frame by the tracking result at the previous frame using EM algorithm. Our experimental results show that our method is more efficient than other methods.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.4
• /
• pp.187-194
• /
• 2016

When performing experiments in indoor and outdoor environment, we need a system that monitors a volunteer to prevent dangerous situations and efficiently manages the data in real time. We developed a guidance device for visually impaired person that guides the user to walk safely to the destination in the previous study. We set a POI (Point of Interest) of a specific location indoors and outdoors and tracks the user's position and navigate the walking path using artificial markers and ZigBee modules as landmark. In addition, we develop path finding algorithm to be used for navigation in the guidance device. In the test bed, the volunteers are exposed to dangerous situations and can be an accident due to malfunction of the device since they are visually impaired person or normal person wearing a eye patch. Therefore the device requires a system that remotely monitors the volunteer wearing guidance device and manages indoor or outdoor a lot of map data. In this paper, we introduce a managing system that monitors the volunteers remotely and handles map data efficiently. We implement a management system which can monitor the volunteer in order to prevent a hazardous situation and effectively manage large amounts of data. In addition, we verified the effectiveness of the proposed system through various experiments.

• Journal of Korea Water Resources Association
• /
• v.51 no.8
• /
• pp.677-686
• /
• 2018

There remain numerous ungauged watersheds in Korea owing to limited spatial and temporal streamflow data with which to estimate hydrological model parameters. To deal with this problem, various regionalization approaches have been proposed over the last several decades. However, the results of the regionalization models differ according to climatic conditions and regional physical characteristics, and the results of the regionalization models in previous studies are generally inconclusive. Thus, to improve the performance of the regionalization methods, this study attaches hydrological model parameters obtained using a spatial proximity model to the explanatory variables of a regional regression model and defines it as a hybrid regionalization model (hybrid model). The performance results of the hybrid model are compared with those of existing methods for 37 test watersheds in South Korea. The GR4J model parameters in the gauged watersheds are estimated using a shuffled complex evolution algorithm. The variation inflation factor is used to consider the multicollinearity of watershed characteristics, and then stepwise regression is performed to select the optimum explanatory variables for the regression model. Analysis of the results reveals that the highest modeling accuracy is achieved using the hybrid model on RMSE overall the test watersheds. Consequently, it can be concluded that the hybrid model can be used as an alternative approach for modeling ungauged watersheds.