• Title/Summary/Keyword: k-means

Search Result 17,904, Processing Time 0.051 seconds

Sagae-Tanabe Weighted Means and Reverse Inequalities

  • Ahn, Eunkyung;Kim, Sejung;Lee, Hosoo;Lim, Yongdo
    • Kyungpook Mathematical Journal
    • /
    • v.47 no.4
    • /
    • pp.595-600
    • /
    • 2007
  • In this paper we consider weighted arithmetic and geometric means of several positive definite operators proposed by Sagae and Tanabe and we establish a reverse inequality of the arithmetic and geometric means via Specht ratio and the Thompson metric on the convex cone of positive definite operators.

  • PDF

Fish Injured Rate Measurement Using Color Image Segmentation Method Based on K-Means Clustering Algorithm and Otsu's Threshold Algorithm

  • Sheng, Dong-Bo;Kim, Sang-Bong;Nguyen, Trong-Hai;Kim, Dae-Hwan;Gao, Tian-Shui;Kim, Hak-Kyeong
    • Journal of Power System Engineering
    • /
    • v.20 no.4
    • /
    • pp.32-37
    • /
    • 2016
  • This paper proposes two measurement methods for injured rate of fish surface using color image segmentation method based on K-means clustering algorithm and Otsu's threshold algorithm. To do this task, the following steps are done. Firstly, an RGB color image of the fish is obtained by the CCD color camera and then converted from RGB to HSI. Secondly, the S channel is extracted from HSI color space. Thirdly, by applying the K-means clustering algorithm to the HSI color space and applying the Otsu's threshold algorithm to the S channel of HSI color space, the binary images are obtained. Fourthly, morphological processes such as dilation and erosion, etc. are applied to the binary image. Fifthly, to count the number of pixels, the connected-component labeling is adopted and the defined injured rate is gotten by calculating the pixels on the labeled images. Finally, to compare the performances of the proposed two measurement methods based on the K-means clustering algorithm and the Otsu's threshold algorithm, the edge detection of the final binary image after morphological processing is done and matched with the gray image of the original RGB image obtained by CCD camera. The results show that the detected edge of injured part by the K-means clustering algorithm is more close to real injured edge than that by the Otsu' threshold algorithm.

Performance Improvement of Deep Clustering Networks for Multi Dimensional Data (다차원 데이터에 대한 심층 군집 네트워크의 성능향상 방법)

  • Lee, Hyunjin
    • Journal of Korea Multimedia Society
    • /
    • v.21 no.8
    • /
    • pp.952-959
    • /
    • 2018
  • Clustering is one of the most fundamental algorithms in machine learning. The performance of clustering is affected by the distribution of data, and when there are more data or more dimensions, the performance is degraded. For this reason, we use a stacked auto encoder, one of the deep learning algorithms, to reduce the dimension of data which generate a feature vector that best represents the input data. We use k-means, which is a famous algorithm, as a clustering. Sine the feature vector which reduced dimensions are also multi dimensional, we use the Euclidean distance as well as the cosine similarity to increase the performance which calculating the similarity between the center of the cluster and the data as a vector. A deep clustering networks combining a stacked auto encoder and k-means re-trains the networks when the k-means result changes. When re-training the networks, the loss function of the stacked auto encoder and the loss function of the k-means are combined to improve the performance and the stability of the network. Experiments of benchmark image ad document dataset empirically validated the power of the proposed algorithm.

Vocabulary Recognition Performance Improvement using k-means Algorithm for GMM Support (GMM 지원을 위해 k-means 알고리즘을 이용한 어휘 인식 성능 개선)

  • Lee, Jong-Sub
    • Journal of Digital Convergence
    • /
    • v.13 no.2
    • /
    • pp.135-140
    • /
    • 2015
  • General CHMM vocabulary recognition system is model observation probability for vocabulary recognition of recognition rate's low. Used as the limiting unit is applied only to some problem in the phoneme model. Also, they have a problem that does not conform to the needs of the search range to meaning of the words in the vocabulary. Performs a phoneme recognition using GMM to improve these problems. We solve the problem according to the limited search words characterized by an improved k-means algorithm. Measure the effectiveness represented by the accuracy and reproducibility as compared to conventional system performance experiments. Performance test results accuracy is 83%p, and recall is 67%p.

Discoloration of Woods (2) - 36 Commercial Hardwoods Grown in Korea - (목재(木材)의 오염(汚染)에 의한 변색(變色) (2) - 한국산(韓國産) 활엽수재(闊葉樹材)의 화학적(化學的) 변색(變色) -)

  • Ahn, Kyung-Mo;Kong, Young-To;Jo, Jae-Myeong
    • Journal of the Korean Wood Science and Technology
    • /
    • v.14 no.1
    • /
    • pp.55-60
    • /
    • 1986
  • Discoloration sensitivities of woods grown in this country haven't reported yet. Therefore we examined discoloration sensitivities of domestic wood specimens to iron (0.1 %, $FeCl_3.6H_2O$), alkali (pH 12.0, NaOH). acid (pH 1.0, $C_2H_2O_4$) and exposing to sunlight (40 hrs), Thirty-six hardwood species were collected and examined. All specimens were prepared from heartwoods of the collected species. But the specimens of 4 Betula species were divided into sapwoods and heartwoods. By iron stain, the color differences (${\Delta}E$) of 21 wood specimens including one Betula sapwood showed above 12.0, which means strong discoloration sensitivities, and of 3 specimens including one Betula sapwood showed below 2.5, which means weak discolorations. The most strong iron discoloration species was Jungkukgulpi-namu (Pterocarya stenoptera). By alkali stain, the color differences (${\Delta}E$) of 3 wood specimens showed above 9.0, which means strong discoloration sensitivities, and of 18 wood specimens including 4 Berula sapwoods showed below 2.5, which means weak discolorations. By acid stain, the color differences (${\Delta}E$) of 6 wood specimens showed above 10.0 which means strong discoloration sensitivities, and of 12 wood specimens including one Betula sapwoods showed below 2.5, which means weak discolorations. By exposing to sunlight, the color differences (${\Delta}E$) of 31 wood specimens including one Betula sapwoods showed below 6.5, which means, strong discoloration sensitivities, and of only one specimens showed below 2.5, which means weak discoloration. The most strong discoloration species by exposing to sunlight was Guirung-namu (Prunus padus). In general, it was shown that hardwoods grown in Korea were most subject to change of color by exposing to sunlight and next were by iron stain. Domestic hardwoods showed some differences in discoloration sensitivities from domestic softwoods previously reported.

  • PDF

Change Detection in Bitemporal Remote Sensing Images by using Feature Fusion and Fuzzy C-Means

  • Wang, Xin;Huang, Jing;Chu, Yanli;Shi, Aiye;Xu, Lizhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.4
    • /
    • pp.1714-1729
    • /
    • 2018
  • Change detection of remote sensing images is a profound challenge in the field of remote sensing image analysis. This paper proposes a novel change detection method for bitemporal remote sensing images based on feature fusion and fuzzy c-means (FCM). Different from the state-of-the-art methods that mainly utilize a single image feature for difference image construction, the proposed method investigates the fusion of multiple image features for the task. The subsequent problem is regarded as the difference image classification problem, where a modified fuzzy c-means approach is proposed to analyze the difference image. The proposed method has been validated on real bitemporal remote sensing data sets. Experimental results confirmed the effectiveness of the proposed method.

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.

Assessment of Premature Ventricular Contraction Arrhythmia by K-means Clustering Algorithm

  • Kim, Kyeong-Seop
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.5
    • /
    • pp.65-72
    • /
    • 2017
  • Premature Ventricular Contraction(PVC) arrhythmia is most common abnormal-heart rhythm that may increase mortal risk of a cardiac patient. Thus, it is very important issue to identify the specular portraits of PVC pattern especially from the patient. In this paper, we propose a new method to extract the characteristics of PVC pattern by applying K-means machine learning algorithm on Heart Rate Variability depicted in Poinecare plot. For the quantitative analysis to distinguish the trend of cluster patterns between normal sinus rhythm and PVC beat, the Euclidean distance measure was sought between the clusters. Experimental simulations on MIT-BIH arrhythmia database draw the fact that the distance measure on the cluster is valid for differentiating the pattern-traits of PVC beats. Therefore, we proposed a method that can offer the simple remedy to identify the attributes of PVC beats in terms of K-means clusters especially in the long-period Electrocardiogram(ECG).

A Study on Sitting Posture Recognition using Machine Learning (머신러닝을 이용한 앉은 자세 분류 연구)

  • Ma, Sangyong;Hong, Sangpyo;Shim, Hyeon-min;Kwon, Jang-Woo;Lee, Sangmin
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.9
    • /
    • pp.1557-1563
    • /
    • 2016
  • According to recent studies, poor sitting posture of the spine has been shown to lead to a variety of spinal disorders. For this reason, it is important to measure the sitting posture. We proposed a strategy for classification of sitting posture using machine learning. We retrieved acceleration data from single tri-axial accelerometer attached on the back of the subject's neck in 5-types of sitting posture. 6 subjects without any spinal disorder were participated in this experiment. Acceleration data were transformed to the feature vectors of principle component analysis. Support vector machine (SVM) and K-means clustering were used to classify sitting posture with the transformed feature vectors. To evaluate performance, we calculated the correct rate for each classification strategy. Although the correct rate of SVM in sitting back arch was lower than that of K-means clustering by 2.0%, SVM's correct rate was higher by 1.3%, 5.2%, 16.6%, 7.1% in a normal posture, sitting front arch, sitting cross-legged, sitting leaning right, respectively. In conclusion, the overall correction rates were 94.5% and 88.84% in SVM and K-means clustering respectively, which means that SVM have more advantage than K-means method for classification of sitting posture.

A Type 2 Fuzzy C-means (제2종 퍼지 집합을 이용한 퍼지 C-means)

  • Hwang, Cheul;Rhee, Fransk Chung-Hoon
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2001.05a
    • /
    • pp.16-19
    • /
    • 2001
  • This paper presents a type-2 fuzzy C-means (FCM) algorithm that is an extension of the conventional fuzzy C-means algorithm. In our proposed method, the membership values for each pattern are extended as type-2 fuzzy memberships by assigning membership grades to the type-1 memberships. In doing so, cluster centers that are estimated by type-2 memberships may converge to a more desirable location than cluster centers obtained by a type-1 FCM method in the presence of noise.

  • PDF