• Title/Summary/Keyword: Means of Using

Search Result 12,108, Processing Time 0.039 seconds

Voice Activity Detection Algorithm using Fuzzy Membership Shifted C-means Clustering in Low SNR Environment (낮은 신호 대 잡음비 환경에서의 퍼지 소속도 천이 C-means 클러스터링을 이용한 음성구간 검출 알고리즘)

  • Lee, G.H.;Lee, Y.J.;Cho, J.H.;Kim, M.N.
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.3
    • /
    • pp.312-323
    • /
    • 2014
  • Voice activity detection is very important process that find voice activity from noisy speech signal for noise cancelling and speech enhancement. Over the past few years, many studies have been made on voice activity detection, it has poor performance for speech signal of sentence form in a low SNR environment. In this paper, it proposed new voice activity detection algorithm that has beginning VAD process using entropy and main VAD process using fuzzy membership shifted c-means clustering. We conduct an experiment in various SNR environment of white noise to evaluate performance of the proposed algorithm and confirmed good performance of the proposed algorithm.

Ganglion Cyst Region Extraction from Ultrasound Images Using Possibilistic C-Means Clustering Method

  • Suryadibrata, Alethea;Kim, Kwang Baek
    • Journal of information and communication convergence engineering
    • /
    • v.15 no.1
    • /
    • pp.49-52
    • /
    • 2017
  • Ganglion cysts are benign soft tissues usually encountered in the wrist. In this paper, we propose a method to extract a ganglion cyst region from ultrasonography images by using image segmentation. The proposed method using the possibilistic c-means (PCM) clustering method is applicable to ganglion cyst extraction. The methods considered in this thesis are fuzzy stretching, median filter, PCM clustering, and connected component labeling. Fuzzy stretching performs well on ultrasonography images and improves the original image. Median filter reduces the speckle noise without decreasing the image sharpness. PCM clustering is used for categorizing pixels into the given cluster centers. Connected component labeling is used for labeling the objects in an image and extracting the cyst region. Further, PCM clustering is more robust in the case of noisy data, and the proposed method can extract a ganglion cyst area with an accuracy of 80% (16 out of 20 images).

Development of Electronic Tongue System Using Fuzzy C-Means Algorithm Combined to PCA Method (PCA와 결합된 Fuzzy C-Means 알고리즘을 이용한 전자 혀 시스템 개발)

  • Jung Woo Suk;Hong Chul Ho;Kim Jeong Do
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.11 no.2
    • /
    • pp.109-116
    • /
    • 2005
  • In this paper, we investigate the visual and quantitative analysis at the same time with an electronic tongue(e-tongue) system using an array of ISE(ion-selective electrode). We apply the FCM(fuzzy c-means) algorithm combined with PCA(principal component analysis), which can be reduced multi-dimensional data to third-dimensional data, to classify data patterns detected by E-Tongue system. The proposed technique can be designed to solve the cluster centers and membership grade of patterns combined with the output results obtained by PCA method. According to the proposed technique, the membership grade of unknown pattern, which does not shown previously can be determined and analyzed visually. Conclusionally, the relationship between the standard patterns and unknown pattern can be easily analyzed. Throughout the experimental trials, the proposed technique has been confirmed using developed E-Tongue system.

PSO-optimized Pareto and Nash equilibrium gaming-based power allocation technique for multistatic radar network

  • Harikala, Thoka;Narayana, Ravinutala Satya
    • ETRI Journal
    • /
    • v.43 no.1
    • /
    • pp.17-30
    • /
    • 2021
  • At present, multiple input multiple output radars offer accurate target detection and better target parameter estimation with higher resolution in high-speed wireless communication systems. This study focuses primarily on power allocation to improve the performance of radars owing to the sparsity of targets in the spatial velocity domain. First, the radars are clustered using the kernel fuzzy C-means algorithm. Next, cooperative and noncooperative clusters are extracted based on the distance measured using the kernel fuzzy C-means algorithm. The power is allocated to cooperative clusters using the Pareto optimality particle swarm optimization algorithm. In addition, the Nash equilibrium particle swarm optimization algorithm is used for allocating power in the noncooperative clusters. The process of allocating power to cooperative and noncooperative clusters reduces the overall transmission power of the radars. In the experimental section, the proposed method obtained the power consumption of 0.014 to 0.0119 at K = 2, M = 3 and K = 2, M = 3, which is better compared to the existing methodologies-generalized Nash game and cooperative and noncooperative game theory.

An Implementation of Clustering Method using K-Means Algorithm on Multi-Dimensional Data (K-Means 알고리즘을 이용한 다차원 데이터 클러스터링 기법 구현)

  • Ihm, Sun-Young;Shin, HyunSoon;Park, Young-Ho
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.11a
    • /
    • pp.1132-1134
    • /
    • 2013
  • K-Means 클러스터링 기법은 데이터마이닝 분야 중 클러스터링 분야에서 가장 널리 쓰이는 방법 중 하나로 주어진 데이터 셋에서 k개의 클러스터를 중심으로 데이터를 분할하는 기법이다. 최근의 데이터는 여러개의 속성을 고려해야 한다. 따라서 본 논문에서는 K-Means 클러스터링 기법을 소개하고, 또 K-Means 클러스터링 기법을 여러 개의 속성을 고려하기 위하여 다차원 데이터에 적용한 실험을 소개한다.

An Evaluation Method on Enterprise Using Fuzzy Integral (퍼지적분을 이용한 기업평가법)

  • 황승국
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.19 no.40
    • /
    • pp.271-280
    • /
    • 1996
  • This paper presents an evaluation method on enterprise using fuzzy integral which is defined by fuzzy measures. The weight of criteria is computed by eigenvector method. And, using this calculated weight, the total evaluation value is obtained from the weight of by means of Pl & Bel measures. This value means the level on enterprise's situation considering from the viewpoint of evaluation factors.

  • PDF

Resampling Technique for Simulation Output Analysis

  • Kim, Yun-Bae-
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1992.10a
    • /
    • pp.13-13
    • /
    • 1992
  • To estimate the probability of long delay in a queuing system using discrete-event simulation studied. We contrast the coverage, half-width, and stability of confidence intervals constructed using two methods: batch means and new resampling technique; binary bootstrap. The binary bootstrap is an extension of the conventional bootstrap that resamples runs rather than data values. Empirical comparisons using known results for the M/M/1 and D/M/10 queues show the binary bootstrap superior to batch means for this problem.

  • PDF

Emotion Recognition using Bio-signal Measurements & K-Means Classifier (생체신호 분석과 K-Means 분류 알고리즘을 이용한 감정 인식)

  • Cha, Sang-hun;Kim, Sung-Jae;Kim, Da-young;Kim, Kwang-baek;Yun, Sang-Seok
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.10a
    • /
    • pp.386-388
    • /
    • 2018
  • 본 논문은 사회적 상호작용 결여로 감정 기복이 심하고 스트레스로 인해 정서불안 증세를 보이는 자폐 범주성 장애아동의 감정 상태를 인식하기 위한 목적으로 4가지 감정 자극에 대하여 생체신호를 분석하고 K-Means 알고리즘을 적용하여 획득한 정보로부터 감정 상태를 인식하는 방법을 제안한다. 실험구성은 참가자가 주어지는 감정자극 영상을 시청하는 동안 맥파 및 피부전도 센서를 이용하여 생체신호를 측정한 후 자율신경 비율을 나타내는 LF/HF의 심박 정보와 피부 반응 정보를 정량적으로 분석하였고, 추출된 정보로부터 K-Means 알고리즘을 적용하여 감정 상태를 분류하는 과정으로 진행된다. 총 3명의 일반인을 대상으로 실험을 진행하였으며, 4가지 감정 자극에 대한 실험을 수행한 결과, 생체신호 측정을 이용한 감정인식 방법이 제시되는 감정 자극을 충분히 분류할 수 있음을 확인할 수 있었다.

  • PDF

Resampling Technique for Simulation Output Analysis

  • Kim, Yun-Bae
    • Journal of the Korea Society for Simulation
    • /
    • v.1 no.1
    • /
    • pp.31-36
    • /
    • 1992
  • To estimate the probability of long delay in a queuing system using discrete-event simulation is studied. We contrast the coverage, half-width, and stability of confidence intervals constructed using two methods: batch means and new resampling technique; binary bootstrap. The binary bootstrap is an extension of the conventional bootstrap that resamples runs rather than data values. Empirical comparisons using known results for the M/M/1 and D/M/10 queues show the binary bootstrap superior to batch means for this problem.

  • PDF

Robustness in the Hierarchical Bayes Estimation of Normal Means

  • Kim, Dal-Ho;Park, Jin -Kap
    • Communications for Statistical Applications and Methods
    • /
    • v.6 no.2
    • /
    • pp.511-522
    • /
    • 1999
  • The paper considers the problem of robustness in hierarchical bayesian models. In specific we address Bayesian robustness in the estimation of normal means. We provide the ranges of the posterior means under $\varepsilon$-contamination class as well as the density ratio class of priors. For the class of priors that are uniform over a specified interval we investigate the sensitivity as to the choice of the intervals. The methods are illustrated using the famous baseball data of Efron and Morris(1975).

  • PDF