• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.10
• /
• pp.958-964
• /
• 2015

In this paper, an object recognition method based on the depth information from the RGB-D camera, Xtion, is proposed for an indoor mobile robot. First, the RANdom SAmple Consensus (RANSAC) algorithm is applied to the point cloud obtained from the RGB-D camera to detect and remove the floor points. Next, the removed point cloud is classified by the k-means clustering method as each object's point cloud, and the normal vector of each point is obtained by using the k-d tree search. The obtained normal vectors are classified by the trained multi-layer perceptron as 18 classes and used as features for object recognition. To distinguish an object from another object, the similarity between them is measured by using Levenshtein distance. To verify the effectiveness and feasibility of the proposed object recognition method, the experiments are carried out with several similar boxes.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.12
• /
• pp.1150-1158
• /
• 2010

In this study, the Polynomial-based Radial Basis Function Neural Networks is proposed as one of the recognition part of overall face recognition system that consists of two parts such as the preprocessing part and recognition part. The design methodology and procedure of the proposed pRBFNNs are presented to obtain the solution to high-dimensional pattern recognition problem. First, in preprocessing part, we use a CCD camera to obtain a picture frame in real-time. By using histogram equalization method, we can partially enhance the distorted image influenced by natural as well as artificial illumination. We use an AdaBoost algorithm proposed by Viola and Jones, which is exploited for the detection of facial image area between face and non-facial image area. As the feature extraction algorithm, PCA method is used. In this study, the PCA method, which is a feature extraction algorithm, is used to carry out the dimension reduction of facial image area formed by high-dimensional information. Secondly, we use pRBFNNs to identify the ID by recognizing unique pattern of each person. The proposed pRBFNNs architecture consists of three functional modules such as the condition part, the conclusion part, and the inference part as fuzzy rules formed in 'If-then' format. In the condition part of fuzzy rules, input space is partitioned with Fuzzy C-Means clustering. In the conclusion part of rules, the connection weight of pRBFNNs is represented as three kinds of polynomials such as constant, linear, and quadratic. Coefficients of connection weight identified with back-propagation using gradient descent method. The output of pRBFNNs model is obtained by fuzzy inference method in the inference part of fuzzy rules. The essential design parameters (including learning rate, momentum coefficient and fuzzification coefficient) of the networks are optimized by means of the Particle Swarm Optimization. The proposed pRBFNNs are applied to real-time face recognition system and then demonstrated from the viewpoint of output performance and recognition rate.

• Journal of Digital Convergence
• /
• v.12 no.4
• /
• pp.277-283
• /
• 2014

Fuzzy modeling is generally using the given data and the fuzzy rules are established by the input variables and the space division by selecting the input variable and dividing the input space for each input variables. The premise part of the fuzzy rule is presented by selection of the input variables, the number of space division and membership functions and in this paper the consequent part of the fuzzy rule is identified by polynomial functions in the form of linear inference and modified quadratic. Parameter identification in the premise part devides input space Min-Max method using the minimum and maximum values of input data set and C-Means clustering algorithm forming input data into the hard clusters. The identification of the consequence parameters, namely polynomial coefficients, of each rule are carried out by the standard least square method. In this paper, membership function of the premise part is dividing input space by using trapezoid-type membership function and by using gas furnace process which is widely used in nonlinear process we evaluate the performance.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.1-7
• /
• 2009

An approach for the classification of music genres using a Fuzzy c-Means(FcM) with divergence-based kernel is proposed and presented in this paper. The proposed model utilizes the mean and covariance information of feature vectors extracted from music data and modelled by Gaussian Probability Density Function (GPDF). Furthermore, since the classifier utilizes a kernel method that can convert a complicated nonlinear classification boundary to a simpler linear one, he classifier can improve its classification accuracy over conventional algorithms. Experiments and results on collected music data sets demonstrate hat the proposed classification scheme outperforms conventional algorithms including FcM and SOM 17.73%-21.84% on average in terms of classification accuracy.

• Journal of Korea Multimedia Society
• /
• v.23 no.11
• /
• pp.1349-1360
• /
• 2020

In recent years, Convolutional Neural Networks (CNNs) have been successfully implemented in different tasks of computer vision. Since CNN models are the representatives of supervised learning algorithms, they demand large amount of data in order to train the classifiers. Thus, obtaining data with correct labels is imperative to attain the state-of-the-art performance of the CNN models. However, labelling datasets is quite tedious and expensive process, therefore real-life datasets often exhibit incorrect labels. Although the issue of poorly labelled datasets has been studied before, we have noticed that the methods are very complex and hard to reproduce. Therefore, in this research work, we propose Deep CleanNet - a considerably simple system that achieves competitive results when compared to the existing methods. We use K-means clustering algorithm for selecting data with correct labels and train the new dataset using a deep CNN model. The technique achieves competitive results in both training and validation stages. We conducted experiments using MNIST database of handwritten digits with 50% corrupted labels and achieved up to 10 and 20% increase in training and validation sets accuracy scores, respectively.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.5
• /
• pp.696-704
• /
• 2013

In this paper, we introduce the LED emotional lighting system realized with the aid of both intelligent algorithm and RGB LED combined with White LED. Generally, the illumination is known as a design factor to form the living place that affects human's emotion and action in the light- space as well as the purpose to light up the specific space. The LED emotional lighting system that can express emotional atmosphere as well as control the quantity of light is designed by using both RGB LED to form the emotional mood and W LED to get sufficient amount of light. RBFNNs is used as the intelligent algorithm and the network model designed with the aid of LED control parameters (viz. color coordinates (x and y) related to color temperature, and lux as inputs, RGBW current as output) plays an important role to build up the LED emotional lighting system for obtaining appropriate color space. Unlike conventional RBFNNs, Fuzzy C-Means(FCM) clustering method is used to obtain the fitness values of the receptive function, and the connection weights of the consequence part of networks are expressed by polynomial functions. Also, the parameters of RBFNN model are optimized by using PSO(Particle Swarm Optimization). The proposed LED emotional lighting can save the energy by using the LED light source and improve the ability to work as well as to learn by making an adequate mood under diverse surrounding conditions.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.9 no.4
• /
• pp.444-450
• /
• 1999

This paper deals with several methods: the clustering method that uses k-means algorithm to abstract the area of characters on the image document and the distance function that suits for the HIS coordinate system to cluster the image. For the prepossessing step to recognize this, or the method of characters segmentate, the algorithm to abstract a discrete character is also proposed, using the linking picture element. This algorithm provides the feature that separates any character such as the touching or overlapped character. The methods of projecting and tracking the edge have so far been used to segment them. However, with the new method proposed here, the picture element extracts a discrete character with only one-time projection after abstracting the character string. it is possible to pull out it. dividing the area into the character and the rest (non-character). This has great significance in terms of processing color documents, not the simple binary image, and already received verification that it is more advanced than the previous document processing system.

• Journal of Intelligence and Information Systems
• /
• v.20 no.4
• /
• pp.107-120
• /
• 2014

This study proposes a novel recommender system using the structural hole analysis to reflect qualitative and emotional information in recommendation process. Although collaborative filtering (CF) is known as the most popular recommendation algorithm, it has some limitations including scalability and sparsity problems. The scalability problem arises when the volume of users and items become quite large. It means that CF cannot scale up due to large computation time for finding neighbors from the user-item matrix as the number of users and items increases in real-world e-commerce sites. Sparsity is a common problem of most recommender systems due to the fact that users generally evaluate only a small portion of the whole items. In addition, the cold-start problem is the special case of the sparsity problem when users or items newly added to the system with no ratings at all. When the user's preference evaluation data is sparse, two users or items are unlikely to have common ratings, and finally, CF will predict ratings using a very limited number of similar users. Moreover, it may produces biased recommendations because similarity weights may be estimated using only a small portion of rating data. In this study, we suggest a novel limitation of the conventional CF. The limitation is that CF does not consider qualitative and emotional information about users in the recommendation process because it only utilizes user's preference scores of the user-item matrix. To address this novel limitation, this study proposes cluster-indexing CF model with the structural hole analysis for recommendations. In general, the structural hole means a location which connects two separate actors without any redundant connections in the network. The actor who occupies the structural hole can easily access to non-redundant, various and fresh information. Therefore, the actor who occupies the structural hole may be a important person in the focal network and he or she may be the representative person in the focal subgroup in the network. Thus, his or her characteristics may represent the general characteristics of the users in the focal subgroup. In this sense, we can distinguish friends and strangers of the focal user utilizing the structural hole analysis. This study uses the structural hole analysis to select structural holes in subgroups as an initial seeds for a cluster analysis. First, we gather data about users' preference ratings for items and their social network information. For gathering research data, we develop a data collection system. Then, we perform structural hole analysis and find structural holes of social network. Next, we use these structural holes as cluster centroids for the clustering algorithm. Finally, this study makes recommendations using CF within user's cluster, and compare the recommendation performances of comparative models. For implementing experiments of the proposed model, we composite the experimental results from two experiments. The first experiment is the structural hole analysis. For the first one, this study employs a software package for the analysis of social network data - UCINET version 6. The second one is for performing modified clustering, and CF using the result of the cluster analysis. We develop an experimental system using VBA (Visual Basic for Application) of Microsoft Excel 2007 for the second one. This study designs to analyzing clustering based on a novel similarity measure - Pearson correlation between user preference rating vectors for the modified clustering experiment. In addition, this study uses 'all-but-one' approach for the CF experiment. In order to validate the effectiveness of our proposed model, we apply three comparative types of CF models to the same dataset. The experimental results show that the proposed model outperforms the other comparative models. In especial, the proposed model significantly performs better than two comparative modes with the cluster analysis from the statistical significance test. However, the difference between the proposed model and the naive model does not have statistical significance.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.4
• /
• pp.569-577
• /
• 2018

In this paper, with the aid of information which is included within data, preprocessing algorithm-based black plastic classifier is designed. The slope and area of spectrum obtained by using laser induced breakdown spectroscopy(LIBS) are analyzed for each material and its ensuing information is applied as the input data of the proposed classifier. The slope is represented by the rate of change of wavelength and intensity. Also, the area is calculated by the wavelength of the spectrum peak where the material property of chemical elements such as carbon and hydrogen appears. Using informations such as slope and area, input data of the proposed classifier is constructed. In the preprocessing part of the classifier, Principal Component Analysis(PCA) and fuzzy transform are used for dimensional reduction from high dimensional input variables to low dimensional input variables. Characteristic analysis of the materials as well as the processing speed of the classifier is improved. In the condition part, FCM clustering is applied and linear function is used as connection weight in the conclusion part. By means of Particle Swarm Optimization(PSO), parameters such as the number of clusters, fuzzification coefficient and the number of input variables are optimized. To demonstrate the superiority of classification performance, classification rate is compared by using WEKA 3.8 data mining software which contains various classifiers such as Naivebayes, SVM and Multilayer perceptron.

• Molecular & Cellular Toxicology
• /
• v.3 no.1
• /
• pp.60-67
• /
• 2007

Gentamicin is a broad-spectrum aminoglycoside antibiotic used in the treatment of bacterial infection. Although side effects of gentamicin such as nephrotoxicity and ototoxicity have been investigated, the information on the hepatic effects of gentamicin is still limited. In the present study, gene expression profiles were analyzed in the liver of gentamicin treated mice using Affymetrix GeneChip$^{(R)}$ Mouse Expression 430A 2.0 Array. Totally, 400 genes were identified as being either up- or down-regulated over 1.5-fold changes (P<0.01) in the liver of gentamicin treated mice. Among these deregulated genes, 16 up-regulated genes mainly involved in transport (Kif5b, Pex14, Rab14, Clcn3, and Necap1) and 20 down-regulated genes involved in lipid and other metabolisms (Hdlbp, Gm2a, Uroc1, and Dak) were selected using k-means clustering algorithm. The functional classification of differentially expressed genes represented that several stress-related genes were regulated in the liver by gentamicin treatment. This data may contribute in understanding the molecular mechanism in the liver of gentamicin treated mice.