• Title/Summary/Keyword: K-means++ algorithm

Search Result 1,363, Processing Time 0.03 seconds

Nucleus Recognition of Uterine Cervical Pap-Smears using FCM Clustering Algorithm

  • Kim, Kwang-Baek
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.1
    • /
    • pp.94-99
    • /
    • 2008
  • Segmentation for the region of nucleus in the image of uterine cervical cytodiagnosis is known as the most difficult and important part in the automatic cervical cancer recognition system. In this paper, the region of nucleus is extracted from an image of uterine cervical cytodiagnosis using the HSI model. The characteristics of the nucleus are extracted from the analysis of morphemetric features, densitometric features, colormetric features, and textural features based on the detected region of nucleus area. The classification criterion of a nucleus is defined according to the standard categories of the Bethesda system. The fuzzy C-means clustering algorithm is employed to the extracted nucleus and the results show that the proposed method is efficient in nucleus recognition and uterine cervical Pap-Smears extraction.

Design of Hybrid Unsupervised-Supervised Classifier for Automatic Emotion Recognition (자동 감성 인식을 위한 비교사-교사 분류기의 복합 설계)

  • Lee, JeeEun;Yoo, Sun K.
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.63 no.9
    • /
    • pp.1294-1299
    • /
    • 2014
  • The emotion is deeply affected by human behavior and cognitive process, so it is important to do research about the emotion. However, the emotion is ambiguous to clarify because of different ways of life pattern depending on each individual characteristics. To solve this problem, we use not only physiological signal for objective analysis but also hybrid unsupervised-supervised learning classifier for automatic emotion detection. The hybrid emotion classifier is composed of K-means, genetic algorithm and support vector machine. We acquire four different kinds of physiological signal including electroencephalography(EEG), electrocardiography(ECG), galvanic skin response(GSR) and skin temperature(SKT) as well as we use 15 features extracted to be used for hybrid emotion classifier. As a result, hybrid emotion classifier(80.6%) shows better performance than SVM(31.3%).

A study on the distribution system using Flexible Reliable Intelligent Electrical eNergy Delivery System (FRIENDS(Flexible Reliable Intelligent Electrical eNergy Delivery System)를 이용한 배전계통의 효율적인 운용방안 개발)

  • Kim, Yong-Ha;Lee, Hyeong-No;Jo, Jae-Han;No, Dae-Seok;Lee, Beom;Choi, Sang-Gyu
    • Proceedings of the KIEE Conference
    • /
    • 1998.07c
    • /
    • pp.1059-1062
    • /
    • 1998
  • This paper which can simulate FRIENDS(Flexible Reliable Intelligent Electrical eNergy Delivery System) model of distribution electrical system presents a new algorithm. In the operation of FRIENDS model, dispersed energy storage(DES) systems have an important role. We can use the active and reactive power of DES to control customer's voltage. In this, the former means load levelling operation and the later means voltage control operation of DES. We focus our research on load levelling operation of DES. We develope an algorithm to get an optimal capacity and operation schedule of DES and then apply it to the FRIENDS model. The results show the effectiveness of the proposed method.

  • PDF

Projection Pursuit K-Means Visual Clustering

  • Kim, Mi-Kyung;Huh, Myung-Hoe
    • Journal of the Korean Statistical Society
    • /
    • v.31 no.4
    • /
    • pp.519-532
    • /
    • 2002
  • K-means clustering is a well-known partitioning method of multivariate observations. Recently, the method is implemented broadly in data mining softwares due to its computational efficiency in handling large data sets. However, it does not yield a suitable visual display of multivariate observations that is important especially in exploratory stage of data analysis. The aim of this study is to develop a K-means clustering method that enables visual display of multivariate observations in a low-dimensional space, for which the projection pursuit method is adopted. We propose a computationally inexpensive and reliable algorithm and provide two numerical examples.

Nucleus Segmentation and Recognition of Uterine Cervical Pop-Smears using Region Growing Technique and Backpropagation Algorithm (영역 확장 기법과 오류 역전파 알고리즘을 이용한 자궁경부 세포진 영역 분할 및 인식)

  • Kim Kwang-Baek;Kim Sung-Shin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.6
    • /
    • pp.1153-1158
    • /
    • 2006
  • The classification of the background and cell areas is very important research area because of the ambiguous boundary. In this paper, the region of cell is extracted from an image of uterine cervical cytodiagnosis using the region growing method that increases the region of interest based on similarity between pixels. Segmented image from background and cell areas is binarized using a threshold value. And then 8-directional tracking algorithm for contour lines is applied to extract the cell area. First, the extracted nucleus is transformed to RGB color that is the original image. Second, the K-means clustering algorithm is employed to classify RGB pixels to the R, G, and B channels, respectively. Third, the Hue information of nucleus is extracted from the HSI models that is the transformation of the clustering values in R, G, and B channels. The backpropagation algorithm is employed to classify and identify the normal or abnormal nucleus.

Station Extension Algorithm Considering Destinations to Solve Illegal Parking of E-Scooters

  • Jeongeun, Song;Yoon-Ah, Song;ZoonKy, Lee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.2
    • /
    • pp.131-142
    • /
    • 2023
  • In this paper, we propose a new station selection algorithm to solve the illegal parking problem of shared electric scooters and improve the service quality. Recently, as a solution to the urban transportation problem, shared electric scooters are attracting attention as the first and last mile means between public transportation and final destinations. As a result, the shared electric scooter market grew rapidly, problems caused by electric scooters are becoming serious. Therefore, in this study, text data are collected to understand the nature of the problem, and the problems related to shared scooters are viewed from the perspective of pedestrians and users in 'LDA Topic Modeling', and a station extension algorithm is based on this. Some parking lots have already been installed, but the existing parking lot location is different from the actual area of tow. Therefore, in this study, we propose an algorithm that can install stations at high actual tow density using mixed clustering technology using K-means after primary clustering by DBSCAN, reflecting the 'current state of electric scooter tow in Seoul'.

KNN/PFCM Hybrid Algorithm for Indoor Location Determination in WLAN (WLAN 실내 측위 결정을 위한 KNN/PFCM Hybrid 알고리즘)

  • Lee, Jang-Jae;Jung, Min-A;Lee, Seong-Ro
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.6
    • /
    • pp.146-153
    • /
    • 2010
  • For the indoor location, wireless fingerprinting is most favorable because fingerprinting is most accurate among the technique for wireless network based indoor location which does not require any special equipments dedicated for positioning. As fingerprinting method,k-nearest neighbor(KNN) has been widely applied for indoor location in wireless location area networks(WLAN), but its performance is sensitive to number of neighborsk and positions of reference points(RPs). So possibilistic fuzzy c-means(PFCM) clustering algorithm is applied to improve KNN, which is the KNN/PFCM hybrid algorithm presented in this paper. In the proposed algorithm, through KNN,k RPs are firstly chosen as the data samples of PFCM based on signal to noise ratio(SNR). Then, thek RPs are classified into different clusters through PFCM based on SNR. Experimental results indicate that the proposed KNN/PFCM hybrid algorithm generally outperforms KNN and KNN/FCM algorithm when the locations error is less than 2m.

Digital Forensic for Location Information using Hierarchical Clustering and k-means Algorithm

  • Lee, Chanjin;Chung, Mokdong
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.1
    • /
    • pp.30-40
    • /
    • 2016
  • Recently, the competition among global IT companies for the market occupancy of the IoT(Internet of Things) is fierce. Internet of Things are all the things and people around the world connected to the Internet, and it is becoming more and more intelligent. In addition, for the purpose of providing users with a customized services to variety of context-awareness, IoT platform and related research have been active area. In this paper, we analyze third party instant messengers of Windows 8 Style UI and propose a digital forensic methodology. And, we are well aware of the Android-based map and navigation applications. What we want to show is GPS information analysis by using the R. In addition, we propose a structured data analysis applying the hierarchical clustering model using GPS data in the digital forensics modules. The proposed model is expected to help support the IOT services and efficient criminal investigation process.

Study on Application of Neural Network for Unsupervised Training of Remote Sensing Data (신경망을 이용한 원격탐사자료의 군집화 기법 연구)

  • 김광은;이태섭;채효석
    • Spatial Information Research
    • /
    • v.2 no.2
    • /
    • pp.175-188
    • /
    • 1994
  • A competitive learning network was proposed as unsupervised training method of remote sensing data, Its performance and computational re¬quirements were compared with conventional clustering techniques such as Se¬quential and K - Means. An airborne remote sensing data set was used to study the performance of these classifiers. The proposed algorithm required a little more computational time than the conventional techniques. However, the perform¬ance of competitive learning network algorithm was found to be slightly more than those of Sequential and K - Means clustering techniques.

  • PDF

Fast Outlier Removal for Image Registration based on Modified K-means Clustering

  • Soh, Young-Sung;Qadir, Mudasar;Kim, In-Taek
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.16 no.1
    • /
    • pp.9-14
    • /
    • 2015
  • Outlier detection and removal is a crucial step needed for various image processing applications such as image registration. Random Sample Consensus (RANSAC) is known to be the best algorithm so far for the outlier detection and removal. However RANSAC requires a cosiderable computation time. To drastically reduce the computation time while preserving the comparable quality, a outlier detection and removal method based on modified K-means is proposed. The original K-means was conducted first for matching point pairs and then cluster merging and member exclusion step are performed in the modification step. We applied the methods to various images with highly repetitive patterns under several geometric distortions and obtained successful results. We compared the proposed method with RANSAC and showed that the proposed method runs 3~10 times faster than RANSAC.