• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.3
• /
• pp.387-391
• /
• 2008

For the detection of moving objects, background subtraction methods are widely used. In case the background has variation, we need to update the background in real-time for the reliable detection of foreground objects. Gaussian mixture model (GMM) combined with probabilistic learning is one of the most popular methods for the real-time update of the background. However, it does not work well in the complex and dynamic backgrounds with high traffic regions. In this paper, we propose a new method for modelling and updating more reliably the complex and dynamic backgrounds based on the probabilistic learning and the layered processing.

• Journal of the Korea Computer Graphics Society
• /
• v.26 no.5
• /
• pp.15-24
• /
• 2020

We present a supervised learning method that estimates the simulation parameters required to simulate the fabric from the static drape shape of a given fabric sample. The static drape shape was inspired by Cusick's drape, which is used in the apparel industry to classify fabrics according to their mechanical properties. The input vector of the training model consists of the feature vector extracted from the static drape and the density value of a fabric specimen. The output vector consists of six simulation parameters that have a significant influence on deriving the corresponding drape result. To generate a plausible and unbiased training data set, we first collect simulation parameters for 400 knit fabrics and generate a Gaussian Mixed Model (GMM) generation model from them. Next, a large number of simulation parameters are randomly sampled from the GMM model, and cloth simulation is performed for each sampled simulation parameter to create a virtual static drape. The generated training data is fitted with a log-linear regression model. To evaluate our method, we check the accuracy of the training results with a test data set and compare the visual similarity of the simulated drapes.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.8 no.9
• /
• pp.265-273
• /
• 2018

In this paper, we propose an acoustic event detection method in tunnels using non-negative tensor factorization (NTF) and hidden Markov model (HMM) applied to multi-channel audio signals. Incidents in tunnel are inherent to the system and occur unavoidably with known probability. Incidents can easily happen minor accidents and extend right through to major disaster. Most incident detection systems deploy visual incident detection (VID) systems that often cause false alarms due to various constraints such as night obstacles and a limit of viewing angle. To this end, the proposed method first tries to separate and detect every acoustic event, which is assumed to be an in-tunnel incident, from noisy acoustic signals by using an NTF technique. Then, maximum likelihood estimation using Gaussian mixture model (GMM)-HMMs is carried out to verify whether or not each detected event is an actual incident. Performance evaluation shows that the proposed method operates in real time and achieves high detection accuracy under simulated tunnel conditions.

• Annual Conference on Human and Language Technology
• /
• 2018.10a
• /
• pp.550-551
• /
• 2018

바이오마커는 체내의 상태 및 변화를 파악할 수 있는 지표이다. 이는 암을 비롯한 다양한 질병에 대하여 진단하는데 활용도가 높은 것으로 알려져 있으나, 새로운 바이오마커를 찾아내기 위한 임상 실험은 많은 시간과 비용을 소비되며, 모든 바이오마커가 실제 질병을 진단하는데 유용하게 사용되는 것은 아니다. 따라서 본 연구에서는 자연어처리 기술을 활용해 바이오마커를 발굴할 때 요구되는 많은 시간과 비용을 줄이고자 한다. 이 때 다양한 의미를 가진 어휘들이 해당 질병과 연관성이 높은 것으로 나타나며, 이들을 분류하는 것은 매우 어렵다. 따라서 우리는 Word2Vec과 가우시안 혼합 모델을 사용하여 바이오마커를 분류하고자 한다. 실험 결과, 대다수의 바이오마커 어휘들이 하나의 군집에 나타나는 것을 확인할 수 있었다.

• Journal of information and communication convergence engineering
• /
• v.13 no.3
• /
• pp.197-204
• /
• 2015

In this paper, we present an algorithm for the detection of illegally parked vehicles based on a combination of some image processing algorithms. A digital camera is fixed in the illegal parking region to capture the video frames. An adaptive Gaussian mixture model (GMM) is used for background subtraction in a complex environment to identify the regions of moving objects in our test video. Stationary objects are detected by using the pixel-level features in time sequences. A stationary vehicle is detected by using the local features of the object, and thus, information about illegally parked vehicles is successfully obtained. An automatic alarm system can be utilized according to the different regulations of different illegal parking regions. The results of this study obtained using a test video sequence of a real-time traffic scene show that the proposed method is effective.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3480-3500
• /
• 2017

Accurate locating for the mobile target remains a challenge in various applications of wireless sensor networks (WSNs). Unfortunately, most of the typical localization algorithms perform well only in the WSN with densely distributed sensor nodes. The non-localizable problem is prone to happening when a target moves into the WSN with sparsely distributed sensor nodes. To solve this problem, we propose a collaborative and predictive localization algorithm (CPLA). The Gaussian mixture model (GMM) is introduced to predict the posterior trajectory for a mobile target by training its prior trajectory. In addition, the collaborative and predictive schemes are designed to solve the non-localizable problems in the two-anchor nodes locating, one-anchor node locating and non-anchor node locating situations. Simulation results prove that the CPLA exhibits higher localization accuracy than other tested predictive localization algorithms either in the WSN with sparsely distributed sensor nodes or in the WSN with densely distributed sensor nodes.

• Phonetics and Speech Sciences
• /
• v.1 no.1
• /
• pp.69-73
• /
• 2009

This paper proposes an efficient global covariance-based principal component analysis (GCPCA) for speaker identification. Principal component analysis (PCA) is a feature extraction method which reduces the dimension of the feature vectors and the correlation among the feature vectors by projecting the original feature space into a small subspace through a transformation. However, it requires a larger amount of training data when performing PCA to find the eigenvalue and eigenvector matrix using the full covariance matrix by each speaker. The proposed method first calculates the global covariance matrix using training data of all speakers. It then finds the eigenvalue matrix and the corresponding eigenvector matrix from the global covariance matrix. Compared to conventional PCA and Gaussian mixture model (GMM) methods, the proposed method shows better performance while requiring less storage space and complexity in speaker identification.

• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.5
• /
• pp.277-281
• /
• 2013

Modern speaker verification systems based on support vector machines (SVMs) use Gaussian mixture model (GMM) supervectors as their input feature vectors, and the maximum a posteriori (MAP) adaptation is a conventional method for generating speaker-dependent GMMs by adapting a universal background model (UBM). MAP adaptation requires the appropriate amount of input utterance due to the number of model parameters to be estimated. On the other hand, with limited utterances, unreliable MAP adaptation can be performed, which causes adaptation noise even though the Bayesian priors used in the MAP adaptation smooth the movements between the UBM and speaker dependent GMMs. This paper proposes a sparse MAP adaptation method, which is known to perform well in the automatic speech recognition area. By introducing sparse MAP adaptation to the GMM-SVM-based speaker verification system, the adaptation noise can be mitigated effectively. The proposed method utilizes the L0 norm as a regularizer to induce sparsity. The experimental results on the TIMIT database showed that the sparse MAP-based GMM-SVM speaker verification system yields a 42.6% relative reduction in the equal error rate with few additional computations.

• Journal of Platform Technology
• /
• v.11 no.5
• /
• pp.110-125
• /
• 2023

In this paper, we utilize time-series aircraft location data measured based on 2019 domestic airports to analyze Go-Around and UOC_D situations during the approach phase of domestic airports. Various clustering-based machine learning techniques are applied to determine the most appropriate analysis method for domestic aviation data through experimentation. The ADS-B sensor is solely employed to measure aircraft positions. We designed a model using clustering algorithms such as K-Means, GMM, and DBSCAN to classify abnormal situations. Among them, the RF model showed the best performance overseas, but through experiments, it was confirmed that the GMM showed the highest classification performance for domestic aviation data by reflecting the aspects specialized in domestic terrain.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.3
• /
• pp.141-149
• /
• 2005

Tn general. Gaussian mixture model (GMM) is used to estimate the speaker model from the speech 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 the EM algorithm has such drawbacks that it depends heavily on the initialization and it needs the number of mixtures to be known. In this paper, to solve the above problems of the EM algorithm. we propose an EM algorithm with the initialization based on incremental ${\cal}k-means$ for GMM. The proposed method dynamically increases the number of mixtures one by one until finding the optimum number of mixtures. Whenever adding one mixture, we calculate the mutual relationship between it and one of other mixtures respectively. Finally. based on these mutual relationships. we can estimate the optimal number of mixtures which are statistically independent. The effectiveness of the proposed method is shown by the experiment for artificial data. Also. we performed the speaker identification by applying the proposed method comparing with other approaches.