• 제목/요약/키워드: Gaussian Mixtures

검색결과 36건 처리시간 0.024초

Flexible Nonlinear Learning for Source Separation

  • Park, Seung-Jin
    • Journal of KIEE
    • /
    • 제10권1호
    • /
    • pp.7-15
    • /
    • 2000
  • Source separation is a statistical method, the goal of which is to separate the linear instantaneous mixtures of statistically independent sources without resorting to any prior knowledge. This paper addresses a source separation algorithm which is able to separate the mixtures of sub- and super-Gaussian sources. The nonlinear function in the proposed algorithm is derived from the generalized Gaussian distribution that is a set of distributions parameterized by a real positive number (Gaussian exponent). Based on the relationship between the kurtosis and the Gaussian exponent, we present a simple and efficient way of selecting proper nonlinear functions for source separation. Useful behavior of the proposed method is demonstrated by computer simulations.

  • PDF

Unsupervised Change Detection Using Iterative Mixture Density Estimation and Thresholding

  • Park, No-Wook;Chi, Kwang-Hoon
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
    • /
    • pp.402-404
    • /
    • 2003
  • We present two methods for the automatic selection of the threshold values in unsupervised change detection. Both methods consist of the same two procedures: 1) to determine the parameters of Gaussian mixtures from a difference image or ratio image, 2) to determine threshold values using the Bayesian rule for minimum error. In the first method, the Expectation-Maximization algorithm is applied for estimating the parameters of the Gaussian mixtures. The second method is based on the iterative thresholding that successively employs thresholding and estimation of the model parameters. The effectiveness and applicability of the methods proposed here are illustrated by an experiment on the multi-temporal KOMPAT-1 EOC images.

  • PDF

변형된 BBI 알고리즘에 기반한 음성 인식기의 계산량 감축 (Computational Complexity Reduction of Speech Recognizers Based on the Modified Bucket Box Intersection Algorithm)

  • 김건용;김동화
    • 대한음성학회지:말소리
    • /
    • 제60호
    • /
    • pp.109-123
    • /
    • 2006
  • Since computing the log-likelihood of Gaussian mixture density is a major computational burden for the speech recognizer based on the continuous HMM, several techniques have been proposed to reduce the number of mixtures to be used for recognition. In this paper, we propose a modified Bucket Box Intersection (BBI) algorithm, in which two relative thresholds are employed: one is the relative threshold in the conventional BBI algorithm and the other is used to reduce the number of the Gaussian boxes which are intersected by the hyperplanes at the boxes' edges. The experimental results show that the proposed algorithm reduces the number of Gaussian mixtures by 12.92% during the recognition phase with negligible performance degradation compared to the conventional BBI algorithm.

  • PDF

CHMM 어휘 인식에서 형상 형성 제어를 이용한 가우시안 모델 최적화 (Gaussian Model Optimization using Configuration Thread Control In CHMM Vocabulary Recognition)

  • 안찬식;오상엽
    • 디지털융복합연구
    • /
    • 제10권7호
    • /
    • pp.167-172
    • /
    • 2012
  • HMM(Hidden Markov Model)을 이용한 어휘 인식에서 모델들의 대한 관측 확률이 이산적인 분포를 나타내며 계산량이 적은 장점이 있지만 인식률이 상대적으로 낮고 정교한 스무딩 과정이 필요한 단점이 있다. 이를 개선하기 위해 가우시안 믹스쳐 연속 확률 밀도를 이용한 CHMM(Continuous Hidden Markov Model) 모델 최적화를 위한 시스템을 제안한다. 본 논문의 시스템은 CHMM 어휘 인식에서 가우시안 믹스쳐 모델을 최적화한 인식 모델을 형상 형성 시스템 지원에 의해 제공한다. 본 논문에서 제안한 시스템을 적용한 결과 어휘 인식률에서 98.1%의 인식률을 나타내었다.

화자 식별을 위한 GMM의 혼합 성분의 개수 추정 (Estimation of Mixture Numbers of GMM for Speaker Identification)

  • 이윤정;이기용
    • 음성과학
    • /
    • 제11권2호
    • /
    • pp.237-245
    • /
    • 2004
  • In general, Gaussian mixture model(GMM) is used to estimate the speaker model for speaker identification. The parameter estimates of the GMM are obtained by using the expectation-maximization (EM) algorithm for the maximum likelihood(ML) estimation. However, if the number of mixtures isn't defined well in the GMM, those parameters are obtained inappropriately. The problem to find the number of components is significant to estimate the optimal parameter in mixture model. In this paper, to estimate the optimal number of mixtures, we propose the method that starts from the sufficient mixtures, after, the number is reduced by investigating the mutual information between mixtures for GMM. In result, we can estimate the optimal number of mixtures. The effectiveness of the proposed method is shown by the experiment using artificial data. Also, we performed the speaker identification applying the proposed method comparing with other approaches.

  • PDF

연속열역학을 이용한 다성분 혼합물의 상평형 (Phase Equilibria in Multicomponent Mixtures using Continuous Thermodynamics)

  • 용평순;김기창;권영중
    • 산업기술연구
    • /
    • 제18권
    • /
    • pp.267-275
    • /
    • 1998
  • Continuous thermodynamics has been applied for modeling of phase equilibria in multicomponent mixtures, to avoid disadvantages of the pseudo-component and key-component method. In this paper continuous thermodynamic relations formulated by using the Pate-Teja equation of state were adopted for calculations of phase equilibria in natural gas mixtures, crude oil mixtures and mixtures extracted by supercritical $CO_2$ fluids. Calculations of phase equilibria were performed by two procedures ; a moment method coupled with the beta distribution function and a quadrature method combined with Gaussian-Legendre polynomials. Calculated results were compared with experimental data. It was showed that continuous thermodynamic frameworks considered in this paper were well-matched to experimental data.

  • PDF

잡음 환경에서의 음성인식을 위한 PMC 적응에 관한 연구 (A Study on the PMC Adaptation for Speech Recognition under Noisy Conditions)

  • 김현기
    • 한국산업정보학회논문지
    • /
    • 제7권3호
    • /
    • pp.9-14
    • /
    • 2002
  • 본 논문에서는 잡음 환경에서 음성 인식기의 성능을 향상시키기 위한 방법을 제안한다. 제안한 방법은 기존의 PMC방법으로 상태 당 가지 수가 많은 모델을 만들 때 발생하는 확률 밀도 분포의 변화를 보상하기 위해 상태 수준에서 조합한 파라미터를 재 추정하여 각 상태에서 가지의 확률 분포의 변화를 적응시키는 방법이다. 상태 당 다수의 가지를 가지는 CDHMM은 제안한 PMC 방법과 조합된다. 또한, EM 알고리즘은 가지 평균의 분산을 줄이기 위하여 모델 평균 파라미터를 적응시키는데 사용한다. 그리고 시뮬레이션을 통하여 본 논문에서 제안한 PMC 방법은 기존의PMC 방법보다 더 향상된 성능을 얻을 수 있었다.

  • PDF

A Fast EM Algorithm for Gaussian Mixtures

  • Jung, Hye-Kyung;Seo, Byung-Tae
    • Communications for Statistical Applications and Methods
    • /
    • 제19권1호
    • /
    • pp.157-168
    • /
    • 2012
  • The EM algorithm is the most important tool to obtain the maximum likelihood estimator in finite mixture models due to its stability and simplicity. However, its convergence rate is often slow because the conventional EM algorithm is based on a large missing data space. Several techniques have been proposed in the literature to reduce the missing data space. In this paper, we review existing methods and propose a new EM algorithm for Gaussian mixtures, which reduces the missing data space while preserving the stability of the conventional EM algorithm. The performance of the proposed method is evaluated with other existing methods via simulation studies.

정규 혼합분포를 이용한 준지도 학습 (Semi-Supervised Learning by Gaussian Mixtures)

  • 최병정;채윤석;최우영;박창이;구자용
    • 응용통계연구
    • /
    • 제21권5호
    • /
    • pp.825-833
    • /
    • 2008
  • 혼합모형을 이용한 판별분석은 다중 분류문제를 해결하는데 유용한 방법으로서 준지도 학습으로 확장될 수 있다. 본 논문에서는 정규 혼합분포를 이용한 준지도 학습 방법에서 혼합 모형의 하위 구성요소 개수 선택 기준을 연구하고자 한다. 하위 구성요소 선택 기준으로서 베이지안 정보량을 사용하였고 모의실험을 통해 이 방법의 유용성을 규명하였다.

수정된 EM알고리즘을 이용한 GMM 화자식별 시스템의 성능향상 (Performance Enhancement of Speaker Identification System Based on GMM Using the Modified EM Algorithm)

  • 김성종;정익주
    • 음성과학
    • /
    • 제12권4호
    • /
    • pp.31-42
    • /
    • 2005
  • Recently, Gaussian Mixture Model (GMM), a special form of CHMM, has been applied to speaker identification and it has proved that performance of GMM is better than CHMM. Therefore, in this paper the speaker models based on GMM and a new GMM using the modified EM algorithm are introduced and evaluated for text-independent speaker identification. Various experiments were performed to evaluate identification performance of two algorithms. As a result of the experiments, the GMM speaker model attained 94.6% identification accuracy using 40 seconds of training data and 32 mixtures and 97.8% accuracy using 80 seconds of training data and 64 mixtures. On the other hand, the new GMM speaker model achieved 95.0% identification accuracy using 40 seconds of training data and 32 mixtures and 98.2% accuracy using 80 seconds of training data and 64 mixtures. It shows that the new GMM speaker identification performance is better than the GMM speaker identification performance.

  • PDF