• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.35 no.3
• /
• pp.187-194
• /
• 2017

The present study introduces a method to parallelize k-means clustering algorithm for fast unsupervised classification of large satellite imagery. Known as a representative algorithm for unsupervised classification, k-means clustering is usually applied to a preprocessing step before supervised classification, but can show the evident advantages of parallel processing due to its high computational intensity and less human intervention. Parallel processing codes are developed by using multi-threading based on OpenMP. In experiments, a PC of 8 multi-core integrated CPU is involved. A 7 band and 30m resolution image from LANDSAT 8 OLI and a 8 band and 10m resolution image from Sentinel-2A are tested. Parallel processing has shown 6 time faster speed than sequential processing when using 10 classes. To check the consistency of parallel and sequential processing, centers, numbers of classified pixels of classes, classified images are mutually compared, resulting in the same results. The present study is meaningful because it has proved that performance of large satellite processing can be significantly improved by using parallel processing. And it is also revealed that it easy to implement parallel processing by using multi-threading based on OpenMP but it should be carefully designed to control the occurrence of false sharing.

• Journal of the Korean Society for information Management
• /
• v.24 no.2
• /
• pp.89-104
• /
• 2007

This research attempts to give a personalized recommendation framework in large-sized music contents environment. Despite of existing studios and commercial contents for recommendation systems, large online shopping malls are still looking for a recommendation system that can serve personalized recommendation and handle large data in real-time. This research utilizes data mining technologies and new pattern matching algorithm. A clustering technique is used to get dynamic user segmentations using user preference to contents categories. Then a sequential pattern mining technique is used to extract contents access patterns in the user segmentations. And the recommendation is given by our recommendation algorithm using user contents preference history and contents access patterns of the segment. In the framework, preprocessing and data transformation and transition are implemented on DBMS. The proposed system is implemented to show that the framework is feasible. In the experiment using real-world large data, personalized recommendation is given in almost real-time and shows acceptable correctness.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.264-266
• /
• 2022

In order to apply the RNN model to the radio fingerprint-based indoor path generation technology, the data set must be continuous and sequential. However, Wi-Fi radio fingerprint data is not suitable as RNN data because continuity is not guaranteed as characteristic information about a specific location at the time of collection. Therefore, continuity information of sequential positions should be given. For this purpose, clustering is possible through classification of each region based on signal data. At this time, the continuity information between the clusters does not contain information on whether actual movement is possible due to the limitation of radio signals. Therefore, correlation information on whether movement between adjacent clusters is possible is required. In this paper, a deep learning network, a recurrent neural network (RNN) model, is used to predict the path of a moving object, and it reduces errors that may occur when predicting the path of an object by generating continuous location information for path generation in an indoor environment. We propose a method of giving correlation between clustering for generating an improved moving path that can avoid erroneous path prediction that cannot move on the predicted path.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.5
• /
• pp.103-110
• /
• 2008

A reliable extraction of welded area is the precedent task before the detection of weld defects in industrial radiography. This paper describes an attempt to detect and extract the welded features of steel tubes from the computed radiography(CR) images. The statistical properties are first analyzed on over 160 sample radiographic images which represent either weld or non-weld area to identify the differences between them. The analysis is then proceeded by pattern classification to determine the clustering parameters. These parameters are the width, the functional match, and continuity. The observed weld image is processed line by line to calculate these parameters for each flexible moving window in line image pixel set. The local statistic line-clustering method is used as the classifier to recognize each window data as weld or non-weld cluster. The sequential procedure is to track the edge lines between two distinct regions by iterative calculation of threshold, and it results in extracting the weld feature. Our methodology is concluded to be effective after experiment with CR weld images.

• Journal of Intelligence and Information Systems
• /
• v.8 no.2
• /
• pp.1-13
• /
• 2002

In this paper, we propose an object tracking system which can be convinced of moving area shaped on objects through color sequential images, decided moving directions of foot messengers or vehicles of image sequences. In static camera, we suggests a new evaluating method extracting co-occurrence matrix with feature vectors of RGB after analyzing and blocking difference images, which is accessed to field of camera view for motion. They are energy, entropy, contrast, maximum probability, inverse difference moment, and correlation of RGB color vectors. we describe how to analyze and compute corresponding relations of objects between adjacent frames. In the clustering, we apply an algorithm of FCM(fuzzy c means) to analyze matching and clustering problems of adjacent frames of the featured vectors, energy and entropy, gotten from previous phase. In the matching phase, we also propose a method to know correspondence relation that can track motion each objects by clustering with similar area, compute object centers and cluster around them in case of same objects based on membership function of motion area of adjacent frames.

• The KIPS Transactions:PartD
• /
• v.16D no.5
• /
• pp.817-824
• /
• 2009

In recent years, Weblog has become the most typical social media for citizens to share their opinions. And, many Weblogs reflect several social issues. There are many internet users who actively express their opinions for internet news or Weblog articles through the replying comments on online community. Hence, we can easily find internet blogs including more than 10 thousand replying comments. It is hard to search and explore useful messages on weblogs since most of weblog systems show articles and their comments to the form of sequential list. In this paper, we propose a visualizing and clustering system called TRIB (Telescope for Responding comments for Internet Blog) for a large set of responding comments for a Weblog article. TRIB clusters and visualizes the replying comments considering their contents using pre-defined user dictionary. Also, TRIB provides various personalized views considering the interests of users. To show the usefulness of TRIB, we conducted some experiments, concerning the clustering and visualizing capabilities of TRIB, with articles that have more than 1,000 comments.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.458-459
• /
• 2021

Recently, researches using deep learning technology based on Wi-Fi fingerprints have been conducted for accurate services in indoor location-based services. Among the deep learning models, an RNN model that can store information from the past can store continuous movements in indoor positioning, thereby reducing positioning errors. At this time, continuous sequential data is required as training data. However, since Wi-Fi fingerprint data is generally managed only with signals for a specific location, it is inappropriate to use it as training data for an RNN model. This paper proposes a path generation method through prediction of a moving path based on Wi-Fi fingerprint data extended to region data through clustering to generate sequential input data of the RNN model.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.6
• /
• pp.523-528
• /
• 2015

In this paper, we propose a new multiresolutional and dynamic approach of the EM algorithm. EM is a very popular and powerful clustering algorithm. EM, however, has problems that indexes multiresolution data and requires a priori information on a proper number of clusters in many applications, To solve such problems, the proposed EM algorithm can impose a multiresolution kd-tree structure in the E-step and allocates a cluster based on sequential data. To validate clusters, we use a merge criteria for cluster merging. We demonstrate the proposed EM algorithm outperforms for texture image segmentation.

• Journal of KIISE:Software and Applications
• /
• v.27 no.6
• /
• pp.660-667
• /
• 2000

In this paper, a word segmentation method for handwritten Korean text line images is proposed. The method uses gap information to segment words in line images, where the gap is defined as a white run obtained after vertical projection of line images. Each gap is assigned to one of inter-word gap and inter-character gap based on gap distance. We take up three distance measures which have been proposed for the word segmentation of handwritten English text line images. Then we test three clustering techniques to detect the best combination of gap metrics and classification techniques for Korean text line images. The experiment has been done with 305 text line images extracted manually from live mail pieces. The experimental result demonstrates the superiority of BB(Bounding Box) distance measure and sequential clustering approach, in which the cumulative word segmentation accuracy up to the third hypothesis is 88.52%. Given a line image, the processing time is about 0.05 second.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.6
• /
• pp.445-452
• /
• 2019

In this study, parallel processing codes of k-means clustering algorithm were developed and implemented in a PC-cluster for unsupervised classification of large satellite images. We implemented intra-node code using multicores of CPU (Central Processing Unit) based on OpenMP (Open Multi-Processing), inter-nodes code using a PC-cluster based on message passing interface, and hybrid code using both. The PC-cluster consists of one master node and eight slave nodes, and each node is equipped with eight multicores. Two operating systems, Microsoft Windows and Canonical Ubuntu, were installed in the PC-cluster in turn and tested to compare parallel processing performance. Two multispectral satellite images were tested, which are a medium-capacity LANDSAT 8 OLI (Operational Land Imager) image and a high-capacity Sentinel 2A image. To evaluate the performance of parallel processing, speedup and efficiency were measured. Overall, the speedup was over N / 2 and the efficiency was over 0.5. From the comparison of the two operating systems, the Ubuntu system showed two to three times faster performance. To confirm that the results of the sequential and parallel processing coincide with the other, the center value of each band and the number of classified pixels were compared, and result images were examined by pixel to pixel comparison. It was found that care should be taken to avoid false sharing of OpenMP in intra-node implementation. To process large satellite images in a PC-cluster, code and hardware should be designed to reduce performance degradation caused by file I / O. Also, it was found that performance can differ depending on the operating system installed in a PC-cluster.