• Title/Summary/Keyword: cluster method

Search Result 2,497, Processing Time 0.032 seconds

A Setting of Initial Cluster Centers and Color Image Segmentation Using Superpixels and Fuzzy C-means(FCM) Algorithm (슈퍼픽셀과 FCM을 이용한 클러스터 초기값 설정 및 칼라영상분할)

  • Lee, Jeong-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.6
    • /
    • pp.761-769
    • /
    • 2012
  • In this paper, a setting method of initial cluster centers and color image segmentation using superpixels and Fuzzy C-means(FCM) algorithm is proposed. Generally, the FCM can be widely used to segment color images, and an element is assigned to any cluster with each membership values in the FCM. However the algorithm has a problem of local convergence by determining the initial cluster centers. So the selection of initial cluster centers is very important, we proposed an effective method to determine the initial cluster centers using superpixels. The superpixels can be obtained by grouping of some pixels having similar characteristics from original image, and it is projected $La^*b^*$ feature space to obtain the initial cluster centers. The proposed method can be speeded up because number of superpixels are extremely smaller than pixels of original image. To evaluate the proposed method, several color images are used for computer simulation, and we know that the proposed method is superior to the conventional algorithm by the experimental results.

An Energy Efficient Multi-hop Cluster-Head Election Strategy for Wireless Sensor Networks

  • Zhao, Liquan;Guo, Shuaichao
    • Journal of Information Processing Systems
    • /
    • v.17 no.1
    • /
    • pp.63-74
    • /
    • 2021
  • According to the double-phase cluster-head election method (DCE), the final cluster heads (CHs) sometimes are located at the edge of cluster. They have a long distance from the base station (BS). Sensor data is directly transmitted to BS by CHs. This makes some nodes consume much energy for transmitting data and die earlier. To address this problem, energy efficient multi-hop cluster-head election strategy (EEMCE) is proposed in this paper. To avoid taking these nodes far from BS as CH, this strategy first introduces the distance from the sensor nodes to the BS into the tentative CH election. Subsequently, in the same cluster, the energy of tentative CH is compared with those of other nodes, and then the node that has more energy than the tentative CH and being nearest the tentative CH are taken as the final CH. Lastly, if the CH is located at the periphery of the network, the multi-hop method will be employed to reduce the energy that is consumed by CHs. The simulation results suggest that the proposed method exhibits higher energy efficiency, longer stability period and better scalability than other protocols.

Unbiased Balanced Half-Sample Variance Estimation in Stratified Two-stage Sampling

  • Kim, Kyu-Seong
    • Journal of the Korean Statistical Society
    • /
    • v.27 no.4
    • /
    • pp.459-469
    • /
    • 1998
  • Balanced half sample method is a simple variance estimation method for complex sampling designs. Since it is simple and flexible, it has been widely used in large scale sample surveys. However, the usual BHS method overestimate the true variance in without replacement sampling and two-stage cluster sampling. Focusing on this point , we proposed an unbiased BHS variance estimator in a stratified two-stage cluster sampling and then described an implementation method of the proposed estimator. Finally, partially BHS design is explained as a tool of reducing the number of replications of the proposed estimator.

  • PDF

An Energy Efficient Variable Area Routing protocol in Wireless Sensor networks (무선 센서 네트워크에서 에너지 효율적인 가변 영역 라우팅 프로토콜)

  • Choi, Dong-Min;Moh, Sang-Man;Chung, Il-Yong
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.8
    • /
    • pp.1082-1092
    • /
    • 2008
  • In wireless sensor networks, clustering protocol such as LEACH is an efficient method to increase whole networks lifetime. However, this protocol result in high energy consumption at the cluster head node. Hence, this protocol must changes the cluster formation and cluster head node in each round to prolong the network lifetime. But this method also causes a high amount of energy consumption during the set-up process of cluster formation. In order to improve energy efficiency, in this paper, we propose a new cluster formation algorithm. In this algorithm, we define a intra cluster as the sensor nodes within close proximity of each other. In a intra cluster, a node senses and transmits data at a time on the round-robin basis. In a view of whole network, intra cluster is treated as one node. During the setup phase of a round, intra clusters are formed first and then they are re-clustered(network cluster) by choosing cluster-heads(intra clusters). In the intra cluster with a cluster-head, every member node plays the role of cluster-head on the round-robin basis. Hence, we can lengthen periodic round by a factor of intra cluster size. Also, in the steady-state phase, a node in each intra cluster senses and transmits data to its cluster-head of network cluster on the round-robin basis. As a result of analysis and comparison, our scheme reduces energy consumption of nodes, and improve the efficiency of communications in sensor networks compared with current clustering methods.

  • PDF

Improved Paired Cluster-Based Routing Protocol in Vehicular Ad-Hoc Networks

  • Kim, Wu Woan
    • International journal of advanced smart convergence
    • /
    • v.7 no.2
    • /
    • pp.22-32
    • /
    • 2018
  • In VANET, frequent movement of nodes causes dynamic changes of the network topology. Therefore the routing protocol, which is stable to effectively respond the changes of the network topology, is required. Moreover, the existing cluster-based routing protocol, that is the hybrid approach, has routing delay due to the frequent re-electing of the cluster header. In addition, the routing table of CBRP has only one hop distant neighbor nodes. PCBRP (Paired CBRP), proposed in this paper, ties two clusters in one pair of clusters to make longer radius. Then the pair of the cluster headers manages and operates corresponding member nodes. In the current CBRP, when the cluster header leaves the cluster the delay, due to the re-electing a header, should be occurred. However, in PCBRP, another cluster header of the paired cluster takes the role instead of the left cluster header. This means that this method reduces the routing delay. Concurrently, PCBRP reduces the delay when routing nodes in the paired cluster internally. Therefore PCBRP shows improved total delay of the network and improved performance due to the reduced routing overhead.

A On-Line Pattern Clustering Technique Using Fuzzy Neural Networks (퍼지 신경망을 이용한 온라인 클러스터링 방법)

  • 김재현;서일홍
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.7
    • /
    • pp.199-210
    • /
    • 1994
  • Most of clustering methods usually employ a center or predefined shape of a cluster to assign the input data into the cluster. When there is no information about data set, it is impossible to predict how many clusters are to be or what shape clusters take. (the shape of clusters could not be easily represented by the center or predefined shape of clusters) Therefore, it is difficult to assign input data into a proper cluster using previous methods. In this paper, to overcome such a difficulty a cluster is to be represented as a collection of several subclusters representing boundary of the cluster. And membership functions are used to represent how much input data bllongs to subclusters. Then the position of the nearest subcluster is adaptively corrected for expansion of cluster, which the subcluster belongs to by use of a competitive learning neural network. To show the validity of the proposed method a numerical example is illustrated where FMMC(Fuzzy Min-Max Clustering) algorithm is compared with the proposed method.

  • PDF

Performance Evaluation of AMC in Clustered OFDM System

  • Cho, Ju-Phil
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.12
    • /
    • pp.1623-1630
    • /
    • 2005
  • Adaptive modulation and coding (AMC), which has a number of variation levels in accordance with the fading channel variation, is a promising technique for communication systems. In this paper, we present an AMC method using the cluster in OFDM system for bandwidth efficiency and performance improvement. The AMC schemes applied into each cluster or some clusters are determined by the minimum or the average SNR value among all the sub carriers within the corresponding cluster. It is important to find the optimal information on cluster because AMC performance can be varied according to the number and position of cluster. It is shown by computer simulation that the AMC method outperforms the fixed modulation in terms of bandwidth efficiency and its performance can be determined by the position and number of clusters.

  • PDF

A composite estimator for stratified two stage cluster sampling

  • Lee, Sang Eun;Lee, Pu Reum;Shin, Key-Il
    • Communications for Statistical Applications and Methods
    • /
    • v.23 no.1
    • /
    • pp.47-55
    • /
    • 2016
  • Stratified cluster sampling has been widely used for effective parameter estimations due to reductions in time and cost. The probability proportional to size (PPS) sampling method is used when the number of cluster element are significantly different. However, simple random sampling (SRS) is commonly used for simplicity if the number of cluster elements are almost the same. Also it is known that the ratio estimator produces a good performance when the total number of population elements is known. However, the two stage cluster estimator should be used if the total number of elements in population is neither known nor accurate. In this study we suggest a composite estimator by combining the ratio estimator and the two stage cluster estimator to obtain a better estimate under a certain population circumstance. Simulation studies are conducted to compare the superiority of the suggested estimator with two other estimators.

Design of a pattern classifier using fuzzy neural networks (퍼지 신경망을 이용한 패턴 분류기의 설계)

  • 김재현;서일홍;김태원
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10a
    • /
    • pp.724-730
    • /
    • 1993
  • Most of clustering methods usually employ the center of a cluster to assign the input data into a cluster. When the shape of a cluster could not be easily represented by the center of cluster, however, it is difficult to assign input data into a proper cluster using previous methods. In this paper, to overcome such a difficulty, a cluster is to be represented as a collection of several subclusters. And membership functions are used to represent how much input data belong to subclusters. Then the position of each subcluster is adoptively corrected by use of a competitive learning neural network. To show the validity of the proposed method, a numerical example is illustrated, where FMMC(Fuzzy Min-Max Clustering) algorithm is compared with the proposed method.

  • PDF

Cluster analysis by month for meteorological stations using a gridded data of numerical model with temperatures and precipitation (기온과 강수량의 수치모델 격자자료를 이용한 기상관측지점의 월별 군집화)

  • Kim, Hee-Kyung;Kim, Kwang-Sub;Lee, Jae-Won;Lee, Yung-Seop
    • Journal of the Korean Data and Information Science Society
    • /
    • v.28 no.5
    • /
    • pp.1133-1144
    • /
    • 2017
  • Cluster analysis with meteorological data allows to segment meteorological region based on meteorological characteristics. By the way, meteorological observed data are not adequate for cluster analysis because meteorological stations which observe the data are located not uniformly. Therefore the clustering of meteorological observed data cannot reflect the climate characteristic of South Korea properly. The clustering of $5km{\times}5km$ gridded data derived from a numerical model, on the other hand, reflect it evenly. In this study, we analyzed long-term grid data for temperatures and precipitation using cluster analysis. Due to the monthly difference of climate characteristics, clustering was performed by month. As the result of K-Means cluster analysis is so sensitive to initial values, we used initial values with Ward method which is hierarchical cluster analysis method. Based on clustering of gridded data, cluster of meteorological stations were determined. As a result, clustering of meteorological stations in South Korea has been made spatio-temporal segmentation.