• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.4
• /
• pp.721-727
• /
• 2016

In this paper, in order to resolve the problem of reduction for D2D (device to device) advertisement dissemination efficiency of conventional dissemination algorithms, we here propose several clustering algorithms (modified single linkage algorithm (MSL), K-means algorithm, and expectation maximization algorithm with Gaussian mixture model (EM)) based advertisement dissemination algorithms to improve advertisement dissemination efficiency in D2D communication networks. Target areas are clustered in several target groups by the proposed clustering algorithms. Then, D2D advertisements are consecutively distributed by using a routing algorithm based on the geographical distribution of the target areas and a relay selection algorithm based on the distance between D2D sender and D2D receiver. Via intensive MATLAB simulations, we analyze the performance excellency of the proposed algorithms with respect to maximum number of relay transmissions and D2D user density ratio in a target area and a non-target area.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.2
• /
• pp.21-30
• /
• 2014

The use of induction motors has been recently increasing in a variety of industrial sites, and they play a significant role. This has motivated that many researchers have studied on developing fault detection and classification systems of induction motors in order to reduce economical damage caused by their faults. To early identify induction motor faults, this paper effectively estimates spectral envelopes of each induction motor fault by utilizing a linear prediction coding (LPC) analysis technique and an expectation maximization (EM) algorithm. Moreover, this paper classifies induction motor faults into their corresponding categories by calculating Mahalanobis distance using the estimated spectral envelopes and finding the minimum distance. Experimental results show that the proposed approach yields higher classification accuracies than the state-of-the-art conventional approach for both noiseless and noisy environments for identifying the induction motor faults.

• Journal of Biomedical Engineering Research
• /
• v.28 no.4
• /
• pp.520-529
• /
• 2007

An efficient method for implementing image reconstruction algorithms for Compton cameras is presented. Since Compton scattering formula establishes a cone surface from which the incident photon must have originated, it is crucial to implement a computationally efficient cone-surface integration method for image reconstruction. In this paper we assume that a cone is made up of a series of ellipses (or circles) stacked up one on top of the other. In order to reduce computational burden for tracing ellipses formed by the intersection of a cone and an image plane, we propose a new method using a series of imaginary planes perpendicular to the cone axis so that each plane contains a circle, not an ellipse. In this case the cone surface integral can be performed by simply accumulating the circles along the cone axis. To reduce the computational cost of tracing circles, only one of the circles in the cone is traced and the rest are determined by using simple trigonometric ratios. For our experiments, we used the three different schemes for tracing ellipses; (i) using the samples generated by the ellipse equation, (ii) using the fixed number of samples along a circle on the imaginary plane, and (iii) using the fixed sampling interval along a circle on the imaginary plane. We then compared performance of the above three methods by applying them to the two reconstruction algorithms - the simple back-projection method and the expectation-maximization algorithm. The experimental results demonstrate that our proposed methods (ii) and (iii) using imaginary planes significantly improve reconstruction accuracy as well as computational efficiency.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.5
• /
• pp.383-392
• /
• 2007

This study focuses on co-registration and band selection, which are one of the pre-processing steps to apply the change detection technique using hyperspectral images. We carried out automatic co-registration by using the SIFT algorithm which performance was already established in the computer vision fields, and selected the bands fur change detection by estimating the noise of image through the PIFs reflecting the radiometric consistency. The EM algorithm was also applied to select the band objectively. Hyperion images were used for the proposed techniques, and non-calibrated bands and striping noises contained in Hyperion image were removed. Throughout the results, we could develop the reliable co-registration procedure which coincided with accuracy within 0.2 pixels (RMSE) for change detection, and verified that band selection depending on the visual inspection could be objective by extracting the PIFs.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.26 no.6
• /
• pp.493-497
• /
• 2016

Infrared (IR) imaging is capable of detecting targets that are not visible at night, thus it has been widely used for the security and defense system. However, the quality of the IR image is often degraded by low resolution and noise corruption. This paper addresses target segmentation with the IR image. Multiple regions of interest (ROI) are extracted by the multi-level segmentation and targets are segmented from the individual ROI. Each level of the multi-level segmentation is composed of a k-means clustering algorithm an expectation-maximization (EM) algorithm, and a decision process. The k-means clustering algorithm initializes the parameters of the Gaussian mixture model (GMM) and the EM algorithm iteratively estimates those parameters. Each pixel is assigned to one of clusters during the decision. This paper proposes the selection and the merging of the extracted ROIs. ROI regions are selectively merged in order to include the overlapped ROI windows. In the experiments, the proposed method is tested on an IR image capturing two pedestrians at night. The performance is compared with conventional methods showing that the proposed method outperforms others.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.5
• /
• pp.992-998
• /
• 2017

For local advertising based on D2D communications, sources want advertisement messages to be diffused to unspecified users as many as possible. It is one of challenging issues to select target-areas for advertising if users are uniformly distributed. In this paper, we propose D2D based advertisement dissemination algorithm using user clustering with expectation-maximization. The user distribution of each cluster can be estimated by principal components (PCs) obtained from each cluster. That is, PCs enable the target-areas and routing paths to be properly determined according to the user distribution. Consequently, advertisement messages are able to be disseminated to many users. We evaluate performances of our proposed algorithm with respect to coverage probability and average reception number per user.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.46 no.6
• /
• pp.1-8
• /
• 2009

Detecting entry and exit zones in a view covered by multiple cameras is an essential step to determine the topology of the camera setup, which is critical for achieving and sustaining the accuracy and efficiency of multi-camera surveillance system. In this paper, a graph theoretic clustering method is proposed to detect zones using data points which correspond to entry and exit events of objects in the camera view. The minimum spanning tree (MST) is constructed by associating the data points. Then a set of well-formed clusters is sought by removing inconsistent edges of the MST, based on the concepts of the cluster balance and the cluster density defined in the paper. Experimental results suggest that the proposed method is effective, even for sparsely elongated clusters which could be problematic for expectation-maximization (EM). In addition, comparing to the EM-based approaches, the number of data required to obtain stable outcome is relatively small, hence shorter learning period.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.11
• /
• pp.5311-5316
• /
• 2012

Single Photon Emission Computed tomography(SPECT) was performed on 13 healthy adults (average age: 39) to investigate the changes of cerebral blood flow according to brain imaging analysis algorithm. The acquired images were filtered and reconstructed through Filtered Back Projection (FBP) and Ordered Subset Expectation Maximization (OSEM). The brain distribution data of radiopharmaceuticals were compared using Statistical Parametric Mapping (SPM), and the changes of blood flow was expressed in Cluster. As a result, uptake rate was increased in Sub-gyral, Sub-Lobar, Extra-Nuclear, Limbic lobe and Cingulate Gyrus, while uptake rate was decreased in Middle frontal gyrus, Inferior Frontal Gyrus and Precentral Gyrus. The discriminable SPM was shown according to cerebral blood flows in Cluster by the reconstruction algorithm.

• Journal of Intelligence and Information Systems
• /
• v.15 no.4
• /
• pp.23-36
• /
• 2009

Network intrusion detection have been continuously improved by using data mining techniques. There are two kinds of methods in intrusion detection using data mining-supervised learning with class label and unsupervised learning without class label. In this paper we have studied the way of improving network intrusion detection accuracy by using LBG clustering algorithm which is one of unsupervised learning methods. The K-means method, that starts with random initial centroids and performs clustering based on the Euclidean distance, is vulnerable to noisy data and outliers. The nonuniform binary split algorithm uses binary decomposition without assigning initial values, and it is relatively fast. In this paper we applied the EM(Expectation Maximization) based LBG algorithm that incorporates the strength of two algorithms to intrusion detection. The experimental results using the KDD cup dataset showed that the accuracy of detection can be improved by using the LBG algorithm.

• The KIPS Transactions:PartC
• /
• v.17C no.2
• /
• pp.181-189
• /
• 2010

HAP(High Altitude Platform) is a stationary aerial platform positioned in the stratosphere between 17Km and 22Km height and it could act as an MBS (Mobile Base Station). HAP based Network has advantages of both satellite system and terrestrial communication system. In this paper we study the deploy of multiple HAP MBS that can provides efficient communication for users. For this study, EM(Expectation Maximization) clustering algorithm is used to cluster terrestrial mobile nodes. The object of this paper is improving EM algorithm into the clustering algorithm for efficiency in variety aspects considering distance between mobile terminal units and speed of mobile terminal units, and estimating performance of HAP MBS deploy technique with use of improved EM algorithm using RWP (Random Waypoint) node mobility.