• Title/Summary/Keyword: $\kappa$-means clustering

Search Result 7, Processing Time 0.022 seconds

Mesh Segmentation With Geodesic Means Clustering of Sharp Vertices (첨예정점의 측지거리 평균군집화를 이용한 메쉬 분할)

  • Park, Young-Jin;Park, Chan;Li, Wei;Ha, Jong-Sung;Yoo, Kwan-Hee
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.5
    • /
    • pp.94-103
    • /
    • 2008
  • In this paper, we adapt the $\kappa$-means clustering technique to segmenting a given 3D mesh. In order to avoid the locally minimal convergence and speed up the computing time, first we extract sharp vertices from the mesh by analysing its curvature and convexity that respectively reflect the local and global geometric characteristics from the viewpoint of cognitive science. Next the sharp vertices are partitioned into $\kappa$ clusters by iterated converging with the $\kappa$-means clustering method based on the geodesic distance instead of the Euclidean distance between each pair of the sharp vertices. For obtaining the effective result of $\kappa$-means clustering method, it is crucial to assign an initial value to $\kappa$ appropriately. Hence, we automatically compute a reasonable number of clusters as an initial value of $\kappa$. Finally the mesh segmentation is completed by merging other vertices except the sharp vertices into the nearest cluster by geodesic distance.

Stratification Method Using κ-Spatial Medians Clustering (κ-공간중위 군집방법을 활용한 층화방법)

  • Son, Soon-Chul;Jhun, Myoung-Shic
    • The Korean Journal of Applied Statistics
    • /
    • v.22 no.4
    • /
    • pp.677-686
    • /
    • 2009
  • Stratification of population is widely used to improve the efficiency of the estimation in a sample survey. However, it causes several problems when there are some variables containing outliers. To overcome these problems, Park and Yun (2008) proposed a rather subjective method, which finds outliers before $\kappa$-means clustering for stratification. In this study, we propose the $\kappa$-spatial medians clustering method which is more robust than $\kappa$-means clustering method and also does not need the process of finding outliers in advance. We investigate the characteristics of the proposed method through a case study used in Park and Yun (2008) and confirm the efficiency of the proposed method.

Shot-change Detection using Hierarchical Clustering (계층적 클러스터링을 이용한 장면 전환점 검출)

  • 김종성;홍승범;백중환
    • Proceedings of the IEEK Conference
    • /
    • 2003.07d
    • /
    • pp.1507-1510
    • /
    • 2003
  • We propose UPGMA(Unweighted Pair Group Method using Average distance) as hierarchical clustering to detect abrupt shot changes using multiple features such as pixel-by-pixel difference, global and local histogram difference. Conventional $\kappa$-means algorithm which is a method of the partitional clustering, has to select an efficient initial cluster center adaptively UPGMA that we propose, does not need initial cluster center because of agglomerative algorithm that it starts from each sample for clusters. And UPGMA results in stable performance. Experiment results show that the proposed algorithm works not only well but also stably.

  • PDF

Improved Detecting Schemes for Micro-Electronic Devices Based on Adaptive Hybrid Classification Algorithms (적응형 복합 분류 알고리즘을 이용한 초소형 전자소자 탐지 향상 기법)

  • Kim, Kwangyul;Lim, Jeonghwan;Kim, Songkang;Cho, Junkyung;Shin, Yoan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.6
    • /
    • pp.504-511
    • /
    • 2013
  • This paper proposes improved detection schemes for concealed micro-electronic devices using clustering and classification of radio frequency harmonics in order to protect intellectual property rights. In general, if a radio wave with a specific fundamental frequency is propagated from the transmitter of a classifier to a concealed object, the second and the third harmonics will be returned as the radio wave is reflected. Using this principle, we exploit the fuzzy c-means clustering and the ${\kappa}$-nearest neighbor classification for detecting diverse concealed objects. Simulation results indicate that the proposed scheme can detect electronic devices and metal devices in various learning environments by efficient classification. Thus, the proposed schemes can be utilized as an effective detection method for concealed micro-electronic device to protect intellectual property rights.

Reduced RBF Centers Based Multiuser Detection in DS-CDMA System

  • Lee, Jung-Sik;Hwang, Jae-Jeong;Park, Chi-Yeon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.11C
    • /
    • pp.1085-1091
    • /
    • 2006
  • The major goal of this paper is to develop a practically implemental radial basis function (RBF) neural network based multi-user detector (MUD) for direct sequence (DS)-CDMA system. This work is expected to provide an efficient solution for RBF based MUD by quickly setting up the proper number of RBF centers and their locations required in training. The basic idea in this research is to estimate all the possible RBF centers by using supervised ${\kappa-means$ clustering technique, and select the only centers which locate near seemingly decision boundary between centers, and reduce further by grouping the some of centers adjacent each other. Therefore, it reduces the computational burden for finding the proper number of RBF centers and their locations in the existing RBF based MUD, and ultimately, make its implementation practical.

A Mesh Segmentation Reflecting Global and Local Geometric Characteristics (전역 및 국부 기하 특성을 반영한 메쉬 분할)

  • Im, Jeong-Hun;Park, Young-Jin;Seong, Dong-Ook;Ha, Jong-Sung;Yoo, Kwan-Hee
    • The KIPS Transactions:PartA
    • /
    • v.14A no.7
    • /
    • pp.435-442
    • /
    • 2007
  • This paper is concerned with the mesh segmentation problem that can be applied to diverse applications such as texture mapping, simplification, morphing, compression, and shape matching for 3D mesh models. The mesh segmentation is the process of dividing a given mesh into the disjoint set of sub-meshes. We propose a method for segmenting meshes by simultaneously reflecting global and local geometric characteristics of the meshes. First, we extract sharp vertices over mesh vertices by interpreting the curvatures and convexity of a given mesh, which are respectively contained in the local and global geometric characteristics of the mesh. Next, we partition the sharp vertices into the $\kappa$ number of clusters by adopting the $\kappa$-means clustering method [29] based on the Euclidean distances between all pairs of the sharp vertices. Other vertices excluding the sharp vertices are merged into the nearest clusters by Euclidean distances. Also we implement the proposed method and visualize its experimental results on several 3D mesh models.

Automated Water Surface Extraction in Satellite Images Using a Comprehensive Water Database Collection and Water Index Analysis

  • Anisa Nur Utami;Taejung Kim
    • Korean Journal of Remote Sensing
    • /
    • v.39 no.4
    • /
    • pp.425-440
    • /
    • 2023
  • Monitoring water surface has become one of the most prominent areas of research in addressing environmental challenges.Accurate and automated detection of watersurface in remote sensing imagesis crucial for disaster prevention, urban planning, and water resource management, particularly for a country where water plays a vital role in human life. However, achieving precise detection poses challenges. Previous studies have explored different approaches,such as analyzing water indexes, like normalized difference water index (NDWI) derived from satellite imagery's visible or infrared bands and using k-means clustering analysis to identify land cover patterns and segment regions based on similar attributes. Nonetheless, challenges persist, notably distinguishing between waterspectralsignatures and cloud shadow or terrain shadow. In thisstudy, our objective is to enhance the precision of water surface detection by constructing a comprehensive water database (DB) using existing digital and land cover maps. This database serves as an initial assumption for automated water index analysis. We utilized 1:5,000 and 1:25,000 digital maps of Korea to extract water surface, specifically rivers, lakes, and reservoirs. Additionally, the 1:50,000 and 1:5,000 land cover maps of Korea aided in the extraction process. Our research demonstrates the effectiveness of utilizing a water DB product as our first approach for efficient water surface extraction from satellite images, complemented by our second and third approachesinvolving NDWI analysis and k-means analysis. The image segmentation and binary mask methods were employed for image analysis during the water extraction process. To evaluate the accuracy of our approach, we conducted two assessments using reference and ground truth data that we made during this research. Visual interpretation involved comparing our results with the global surface water (GSW) mask 60 m resolution, revealing significant improvements in quality and resolution. Additionally, accuracy assessment measures, including an overall accuracy of 90% and kappa values exceeding 0.8, further support the efficacy of our methodology. In conclusion, thisstudy'sresults demonstrate enhanced extraction quality and resolution. Through comprehensive assessment, our approach proves effective in achieving high accuracy in delineating watersurfaces from satellite images.