• Journal of Korea Multimedia Society
• /
• v.16 no.12
• /
• pp.1376-1384
• /
• 2013

In this paper, we propose an automaticdetection method of foreign bodies through template matching in industrial CT volume data. Our method is composed of three main steps. First,Indown-sampling data, the product region is separated from background after noise reduction and initial foreign-body candidates are extracted using mean and standard deviation of the product region. Then foreign-body candidates are extracted using K-means clustering. Second, the foreign body with different intensity of product region is detected using template matching. At this time, the template matching is performed by evaluating SSD orjoint entropy according to the size of detected foreign-body candidates. Third, to improve thedetection rate of foreign body in original volume data, final foreign bodiesare detected using percolation method. For the performance evaluation of our method, industrial CT volume data and simulation data are used. Then visual inspection and accuracy assessment are performed and processing time is measured. For accuracy assessment, density-based detection method is used as comparative method and Dice's coefficient is measured.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.1
• /
• pp.1-9
• /
• 2013

This paper propose a human action recognition method that uses bag-of-features (BoF) based on CS-LBP (center-symmetric local binary pattern) and a spatial pyramid in addition to the random forest classifier. To construct the BoF, an image divided into dense regular grids and extract from each patch. A code word which is a visual vocabulary, is formed by k-means clustering of a random subset of patches. For enhanced action discrimination, local BoF histogram from three subdivided levels of a spatial pyramid is estimated, and a weighted BoF histogram is generated by concatenating the local histograms. For action classification, a random forest, which is an ensemble of decision trees, is built to model the distribution of each action class. The random forest combined with the weighted BoF histogram is successfully applied to Standford Action 40 including various human action images, and its classification performance is better than that of other methods. Furthermore, the proposed method allows action recognition to be performed in near real-time.

• 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 the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.4 s.310
• /
• pp.50-57
• /
• 2006

In Electronic Commerce, the latest most of the personalized recommender systems have applied to the collaborative filtering technique. This method calculates the weight of similarity among users who have a similar preference degree in order to predict and recommend the item which hits to propensity of users. In this case, we commonly use Pearson Correlation Coefficient. However, this method is feasible to calculate a correlation if only there are the items that two users evaluated a preference degree in common. Accordingly, the accuracy of prediction falls. The weight of similarity can affect not only the case which predicts the item which hits to propensity of users, but also the performance of the personalized recommender system. In this study, we verify the improvement of the prediction accuracy through an experiment after observing the rule of the weight of similarity applying Vector similarity, Entropy, Inverse user frequency, and Default voting of Information Retrieval field. The result shows that the method combining the weight of similarity using the Entropy with Default voting got the most efficient performance.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.30 no.2 s.150
• /
• pp.316-325
• /
• 2006

The colors of apparel are getting more important to give the differentiated character on fiber and fabrics. This study was to extract the favorable colors that become to facial color types. Research was carried out to classify the facial colors into several similar facial color groups. With JX-777, 2 points of face: forehead and cheek, were measured and classified into 3 facial color types. Sample size was 418 Korean adult males and other 15 of new males subjects. New chosen 3 subjects who had the classified facial color types, wore silver gown and black hat on his head to minimize the interaction of the clothe color an hair. The 40 standardized color samples were used to extract the favorable colors. 187 respondents answered the degree of becomingness of color samples on 3 facial color types. Data were analyzed by K-means cluster analysis, ANOVA and Duncan multiple range test using SPSS Win. 12. Findings were as follows: 1. 418 subjects who had YR colors were classified into 3 kinds of facial color groups. Type 1 was 4.59YR 5.89/5.12, Type 2 was 5.61 YR 5.41/4.79 and Type 3 was 4.38YR 6.49/4.89 respectively. 2. Favorable colors for Type 1 were 2 colors that belonged to ' a ' group from among colors that were divided into a, b, c group and 18 colors that belonged to ' a ' group from among colors that were divided into a, b group by Duncan post hoc test. 3. Type 2 showed that this type had many unfavorable colors. Unfavorable colors were 16 colors that belonged to ' c ' by Duncan test. 5. Favorable colors for Type 3 were 14 colors that belonged to ' a ' from among colors that were divided into a, b, c and 16 colors that belonged to ' a ' from among colors that were divided into a, b by Duncan test.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.31 no.3
• /
• pp.79-99
• /
• 2020

The purpose of this study is to investigate the model of cluster analysis techniques for grouping public libraries and analyze their characteristics. Statistical data of public libraries of the National Library Statistics System were used, and three models of cluster analysis were applied. As a result of the study, cluster analysis was conducted based on the size of public libraries, and it was largely divided into two clusters. The size of the cluster was largely skewed to one side. For grouping based on size, the ward method of hierarchical cluster analysis and the k-means cluster analysis model were suitable. Three suggestions were presented as implications of the grouping method of public libraries. First, it is necessary to collect library service-related data in addition to statistical data. Second, an analysis model suitable for the data set to be analyzed must be applied. Third, it is necessary to study the possibility of using cluster analysis techniques in various fields other than library grouping.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.9
• /
• pp.848-857
• /
• 2011

Vision-based collision avoidance system for air traffic management requires a excellent multiple target detection algorithm under low signal-to-noise ratio (SNR) levels. The track-before-detect (TBD) approaches have significant applications such as detection of small and dim targets from an image sequence. In this paper, two detection algorithms with the TBD approaches are proposed to satisfy the multiple target detection requirements. The first algorithm, based on a dynamic programming approach, is designed to classify multiple targets by using a k-means clustering algorithm. In the second approach, a hidden Markov model (HMM) is slightly modified for detecting multiple targets sequentially. Both of the proposed approaches are used in numerical simulations with variations in target appearance properties to provide satisfactory performance as multiple target detection methods.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.3
• /
• pp.83-89
• /
• 2010

Scalable routing is one of the key challenges in designing and operating large scale MANETs. Performance of routing protocols proposed so far is only guaranteed under various limitation, i.e., dependent of the number of nodes in the network or needs the location information of destination node. Due to the dependency to the number of nodes in the network, as the number of nodes increases the performance of previous routing protocols degrade dramatically. We propose Cluster Overlay Dynamic Source Routing (CODSR) protocol. We conduct performance analysis by means of computer simulation under various conditions - diameter scaling and density scaling. Developed algorithm outperforms the DSR algorithm, e.g., more than 90% improvement as for the normalized routing load. Operation of CODSR is very simple and we show that the message and time complexity of CODSR is independent of the number of nodes in the network which makes CODSR highly scalable.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.2
• /
• pp.81-86
• /
• 2014

In this paper, we present an effective sound classification system for recognizing the real-time context of a smartphone user. Our system avoids unnecessary consumption of limited computational resource by filtering both silence and white noise out of input sound data in the pre-processing step. It also improves the classification performance on low energy-level sounds by amplifying them as pre-processing. Moreover, for efficient learning and application of HMM classification models, our system executes the dimension reduction and discretization on the feature vectors through k-means clustering. We collected a large amount of 8 different type sound data from daily life in a university research building and then conducted experiments using them. Through these experiments, our system showed high classification performance.

• Journal of the Korea Convergence Society
• /
• v.11 no.12
• /
• pp.23-30
• /
• 2020

In this study, the relationship between natural gas (NG) data and gas-related environmental elements was performed using machine learning algorithms to predict the level of gas leakage risk without directly measuring gas leakage data. The study was based on open data provided by the server using the IoT-based remote control Picarro gas sensor specification. The naturel gas leaks into the air, it is a big problem for air pollution, environment and the health. The proposed method is multivariate outlier removing method based Random Forest (RF) classification for predicting risk of NG leak. After, unsupervised k-means clustering, the experimental dataset has done imbalanced data. Therefore, we focusing our proposed models can predict medium and high risk so best. In this case, we compared the receiver operating characteristic (ROC) curve, accuracy, area under the ROC curve (AUC), and mean standard error (MSE) for each classification model. As a result of our experiments, the evaluation measurements include accuracy, area under the ROC curve (AUC), and MSE; 99.71%, 99.57%, and 0.0016 for MOL_RF respectively.