• Title/Summary/Keyword: Local clustering

Search Result 341, Processing Time 0.028 seconds

Increase of Binary CDMA transmission range by using Clustering technique (Clustering을 통한 Binary CDMA 전송거리 확보)

  • Choi, Hyeon-Seok;Ji, Choong-Won;Kim, Jung-Sun
    • 한국HCI학회:학술대회논문집
    • /
    • 2008.02a
    • /
    • pp.679-682
    • /
    • 2008
  • High interest for the wireless network is going on the research to apply the related technologies in one's real life. Among these wireless network technologies, local area wireless network, Binary CDMA(Code Division Multiple Access), is the method transferring the data by using RF band based on 2.4Ghz. Binary CDMA has longer transmission distance than Bluetooth. Also, it is of benefit to an inexpensive price because the circuit is simple as compared with being similar to the performance of the existing CDMA. Though Binary CDMA has these benefits, one problem is a frequency overlap, and anther problem is to generate the sections with the shorter distance. To solve these problems, We propose the clustering method that can cover wide area.

  • PDF

Reconstruction from Feature Points of Face through Fuzzy C-Means Clustering Algorithm with Gabor Wavelets (FCM 군집화 알고리즘에 의한 얼굴의 특징점에서 Gabor 웨이브렛을 이용한 복원)

  • 신영숙;이수용;이일병;정찬섭
    • Korean Journal of Cognitive Science
    • /
    • v.11 no.2
    • /
    • pp.53-58
    • /
    • 2000
  • This paper reconstructs local region of a facial expression image from extracted feature points of facial expression image using FCM(Fuzzy C-Meang) clustering algorithm with Gabor wavelets. The feature extraction in a face is two steps. In the first step, we accomplish the edge extraction of main components of face using average value of 2-D Gabor wavelets coefficient histogram of image and in the next step, extract final feature points from the extracted edge information using FCM clustering algorithm. This study presents that the principal components of facial expression images can be reconstructed with only a few feature points extracted from FCM clustering algorithm. It can also be applied to objects recognition as well as facial expressions recognition.

  • PDF

Video Abstracting Using Scene Change Detection and Shot Clustering for Construction of Efficient Video Database (대용량 비디오 데이터베이스 구축을 위하여 장면전환 검출과 샷 클러스터링을 이용한 비디오 개요 추출)

  • Shin Seong-Yoon;Pyo Seong-Bae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.2 s.40
    • /
    • pp.111-119
    • /
    • 2006
  • Video viewers can not understand enough entire video contents because most video is long length data of large capacity. This paper propose efficient scene change detection and video abstracting using new shot clustering to solve this problem. Scene change detection is extracted by method that was merged color histogram with $\chi2$ histogram. Clustering is performed by similarity measure using difference of local histogram and new shot merge algorithm. Furthermore, experimental result is represented by using Real TV broadcast program.

  • PDF

A Method of Color Image Segmentation Based on DBSCAN(Density Based Spatial Clustering of Applications with Noise) Using Compactness of Superpixels and Texture Information (슈퍼픽셀의 밀집도 및 텍스처정보를 이용한 DBSCAN기반 칼라영상분할)

  • Lee, Jeonghwan
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.11 no.4
    • /
    • pp.89-97
    • /
    • 2015
  • In this paper, a method of color image segmentation based on DBSCAN(Density Based Spatial Clustering of Applications with Noise) using compactness of superpixels and texture information is presented. The DBSCAN algorithm can generate clusters in large data sets by looking at the local density of data samples, using only two input parameters which called minimum number of data and distance of neighborhood data. Superpixel algorithms group pixels into perceptually meaningful atomic regions, which can be used to replace the rigid structure of the pixel grid. Each superpixel is consist of pixels with similar features such as luminance, color, textures etc. Superpixels are more efficient than pixels in case of large scale image processing. In this paper, superpixels are generated by SLIC(simple linear iterative clustering) as known popular. Superpixel characteristics are described by compactness, uniformity, boundary precision and recall. The compactness is important features to depict superpixel characteristics. Each superpixel is represented by Lab color spaces, compactness and texture information. DBSCAN clustering method applied to these feature spaces to segment a color image. To evaluate the performance of the proposed method, computer simulation is carried out to several outdoor images. The experimental results show that the proposed algorithm can provide good segmentation results on various images.

Unsupervised Image Classification Using Spatial Region Growing Segmentation and Hierarchical Clustering (공간지역확장과 계층집단연결 기법을 이용한 무감독 영상분류)

  • 이상훈
    • Korean Journal of Remote Sensing
    • /
    • v.17 no.1
    • /
    • pp.57-69
    • /
    • 2001
  • This study propose a image processing system of unsupervised analysis. This system integrates low-level segmentation and high-level classification. The segmentation and classification are conducted respectively with and without spatial constraints on merging by a hierarchical clustering procedure. The clustering utilizes the local mutually closest neighbors and multi-window operation of a pyramid-like structure. The proposed system has been evaluated using simulated images and applied for the LANDSATETM+ image collected from Youngin-Nungpyung area on the Korean Peninsula.

Analysis of Gyeonggi-do 911 emergency cases to identify emergency vulnerable area using clustering analysis (군집분석을 통한 응급취약지역의 유형화와 유형별 대응방안 제안: 경기도 119 구급사건 데이터를 기반으로)

  • Kim, Mirae;Kwon, Uijun;Geum, Youngjung
    • Journal of the Korea Management Engineers Society
    • /
    • v.23 no.4
    • /
    • pp.1-18
    • /
    • 2018
  • Emergency response has been considered as an important task in practice, because it is directly associated with the survival of patients. However, it is very difficult to increase the number of fire stations due to the budget and efficiency problem. Under this circumstances, it is critical to consider the suitability of current arrangement for 911 fire station. This is especially true in Gyeonggi-Do where the characteristics of each sub-area are different. In response, this study aims to identify types of areas that are vulnerable for emergency situations, and try to find relevant solutions for each type. For this purpose, we collected 151,463 data for emergency declaration data which exceeds 10 minutes for its response. Total 19 clustering variables which are used as input variables are selected, considering the characteristics of each area. As a result of clustering analysis, three clusters are identified and analyzed. Finally, areas whose emergence response time is in top 10% are selected and analyzed. This paper is expected to find current issues and problems of emergency response for each area, and help to understand and solve the problem for the local government.

Fiscal Policy Effectiveness Assessment Based on Cluster Analysis of Regions

  • Martynenko, Valentyna;Kovalenko, Yuliia;Chunytska, Iryna;Paliukh, Oleksandr;Skoryk, Maryna;Plets, Ivan
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.7
    • /
    • pp.75-84
    • /
    • 2022
  • The efficiency of the regional fiscal policy implementation is based on the achievement of target criteria in the formation and distribution of own financial resources of local budgets, reducing their deficit and reducing dependence on transfers. It is also relevant to compare the development of financial autonomy of regions in the course of decentralisation of fiscal relations. The study consists in the cluster analysis of the effectiveness of fiscal policy implementation in the context of 24 regions and the capital city of Kyiv (except for temporarily occupied territories) under conditions of fiscal decentralisation. Clustering of the regions of Ukraine by 18 indicators of fiscal policy implementation efficiency was carried out using Ward's minimum variance method and k-means clustering algorithm. As a result, the regions of Ukraine are grouped into 5 homogeneous clusters. For each cluster measures were developed to increase own revenues and minimize dependence on official transfers to increase the level of financial autonomy of the regions. It has been proved that clustering algorithms are an effective tool in assessing the effectiveness of fiscal policy implementation at the regional level and stimulating further expansion of financial decentralisation of regions.

Spatial clustering of PM2.5 concentration and their characteristics in the Seoul Metropolitan Area for regional environmental planning (수도권 환경계획을 위한 초미세먼지 농도의 공간 군집특성과 고농도지역 분석)

  • Lim, Chul-Hee;Park, Deuk-Hee
    • Journal of the Korean Society of Environmental Restoration Technology
    • /
    • v.25 no.1
    • /
    • pp.41-55
    • /
    • 2022
  • Social interest in the fine particulate matter has increased significantly since the 2010s, and various efforts have been made to reduce it through environmental plans and policies. To support such environmental planning, in this study, spatial cluster characteristics of fine particulate matter (PM2.5) concentrations were analyzed in the metropolitan area to identify high-risk areas spatially, and the correlation with local environmental characteristics was also confirmed. The PM2.5 concentration for the recent 5 years (2016-2020) was targeted, and representative spatial statistical methods Getis-Ord Gi* and Local Moran's I were applied. As a result of the analysis, the cluster form was different in Getis-Ord Gi* and Local Moran's I, but they show high similarity in direction, therefore complementary results could be obtained. In the high concentration period, the hotspot concentration of the Getis-Ord Gi* method increased, but in Local Moran's I, the HH region, the high concentration cluster, showed a decreasing trend. Hotspots of the Getis-Ord Gi* technique were prominent in the Pyeongtaek-Hwaseong and Yeoju-Icheon regions, and the HH cluster of Local Moran's I was located in the southwest, and the LL cluster was located in the northeast. As in the case of the metropolitan area, in the results of Seoul, there was a phenomenon of division between the northeast and southwest regions. The PM2.5 concentration showed a high correlation with the elevation, vegetation greenness and the industrial area ratio. During the high concentration period, the relation with vegetation greenness increased, and the elevation and industrial area ratio increased in the case of the annual average. This suggests that the function of vegetation can be maximized at a high concentration period, and the influence of topography and industrial areas is large on average. This characteristic was also confirmed in the basic statistics for each major cluster. The spatial clustering characteristics of PM2.5 can be considered in the national land and environmental plan at the metropolitan level. In particular, it will be effective to utilize the clustering characteristics based on the annual average concentration, which contributes to domestic emissions.

Spatial Analysis of Common Gastrointestinal Tract Cancers in Counties of Iran

  • Soleimani, Ali;Hassanzadeh, Jafar;Motlagh, Ali Ghanbari;Tabatabaee, Hamidreza;Partovipour, Elham;Keshavarzi, Sareh;Hossein, Mohammad
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.16 no.9
    • /
    • pp.4025-4029
    • /
    • 2015
  • Background: Gastrointestinal tract cancers are among the most common cancers in Iran and comprise approximately 38% of all the reported cases of cancer. This study aimed to describe the epidemiology and to investigate spatial clustering of common cancers of the gastrointestinal tract across the counties of Iran using full Bayesian smoothing and Moran I Index statistics. Materials and Methods: The data of the national registry cancer were used in this study. Besides, indirect standardized rates were calculated for 371 counties of Iranand smoothed using Winbug 1.4 software with a full Bayesian method. Global Moran I and local Moran I were also used to investigate clustering. Results: According to the results, 75,644 new cases of cancer were nationally registered in Iran among which 18,019 cases (23.8%) were esophagus, gastric, colorectal, and liver cancers. The results of Global Moran's I test were 0.60 (P=0.001), 0.47 (P=0.001), 0.29 (P=0.001), and 0.40 (P=0.001) for esophagus, gastric, colorectal, and liver cancers, respectively. This shows clustering of the four studied cancers in Iran at the national level. Conclusions: High level clustering of the cases was seen in northern, northwestern, western, and northeastern areas for esophagus, gastric, and colorectal cancers. Considering liver cancer, high clustering was observed in some counties in central, northeastern, and southern areas.

Magnifying Block Diagonal Structure for Spectral Clustering (스펙트럼 군집화에서 블록 대각 형태의 유사도 행렬 구성)

  • Heo, Gyeong-Yong;Kim, Kwang-Baek;Woo, Young-Woon
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.9
    • /
    • pp.1302-1309
    • /
    • 2008
  • Traditional clustering methods, like k-means or fuzzy clustering, are prototype-based methods which are applicable only to convex clusters. On the other hand, spectral clustering tries to find clusters only using local similarity information. Its ability to handle concave clusters has gained the popularity recent years together with support vector machine (SVM) which is a kernel-based classification method. However, as is in SVM, the kernel width plays an important role and has a great impact on the result. Several methods are proposed to decide it automatically, it is still determined based on heuristics. In this paper, we proposed an adaptive method deciding the kernel width based on distance histogram. The proposed method is motivated by the fact that the affinity matrix should be formed into a block diagonal matrix to generate the best result. We use the tradition Euclidean distance together with the random walk distance, which make it possible to form a more apparent block diagonal affinity matrix. Experimental results show that the proposed method generates more clear block structured affinity matrix than the existing one does.

  • PDF