• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3498-3511
• /
• 2016

We investigate the channel state information (CSI) in multi-input multi-output (MIMO) cooperative networks that employ the amplify-and-forward transmission scheme. Least squares and expectation conditional maximization have been proposed in the system. However, neither of these two approaches takes advantage of channel sparsity, and they cause estimation performance loss. Unlike linear channel estimation methods, several compressed channel estimation methods are proposed in this study to exploit the sparsity of the MIMO cooperative channels based on the theory of compressed sensing. First, the channel estimation problem is formulated as a compressed sensing problem by using sparse decomposition theory. Second, the lower bound is derived for the estimation, and the MIMO relay channel is reconstructed via compressive sampling matching pursuit algorithms. Finally, based on this model, we propose a novel algorithm so called sparsity adaptive expectation maximization (SAEM) by using Kalman filter and expectation maximization algorithm so that it can exploit channel sparsity alternatively and also track the true support set of time-varying channel. Kalman filter is used to provide soft information of transmitted signals to the EM-based algorithm. Various numerical simulation results indicate that the proposed sparse channel estimation technique outperforms the previous estimation schemes.

• Journal of KIISE:Software and Applications
• /
• v.31 no.2
• /
• pp.245-254
• /
• 2004

This paper deals with the problem of estimating structure and motion from long continuous image sequences, applying the Expectation Maximization algorithm based on extended Kalman smoother to impose the time-continuity of the motion parameters. By repeatedly estimating the state transition matrix of the dynamic equation and the parameters of noise processes in the dynamic and measurement equations, this optimization gives the maximum likelihood estimates of the motion and structure parameters. Practically, this research is essential for dealing with a long video-rate image sequence with partially unknown system equation and noise. The algorithm is implemented and tested for a real image sequence.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.2
• /
• pp.21-30
• /
• 2014

The use of induction motors has been recently increasing in a variety of industrial sites, and they play a significant role. This has motivated that many researchers have studied on developing fault detection and classification systems of induction motors in order to reduce economical damage caused by their faults. To early identify induction motor faults, this paper effectively estimates spectral envelopes of each induction motor fault by utilizing a linear prediction coding (LPC) analysis technique and an expectation maximization (EM) algorithm. Moreover, this paper classifies induction motor faults into their corresponding categories by calculating Mahalanobis distance using the estimated spectral envelopes and finding the minimum distance. Experimental results show that the proposed approach yields higher classification accuracies than the state-of-the-art conventional approach for both noiseless and noisy environments for identifying the induction motor faults.

• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.24-29
• /
• 2003

In this paper, a new method for the mixed image separation is presented using the independent component analysis, the innovation process, and the expectation-maximization. In general, the independent component analysis (ICA) is one of the widely used statistical signal processing schemes, which represents the information from observations as a set of random variables in the from of linear combinations of another statistically independent component variables. In various useful applications, ICA provides a more meaningful representation of the data than the principal component analysis through the transformation of the data to be quasi-orthogonal to each other. which can be utilized in linear projection.. However, it has been known that ICA does not establish good performance in source separation by itself. Thus, in order to overcome this limitation, there have been many techniques that are designed to reinforce the good properties of ICA, which improves the mixed image separation. Unfortunately, the innovation process still needs to be studied since it yields inconsistent innovation process that is attached to the ICA, the expectation and maximization process is added. The results presented in this paper show that the proposed improves the image separation as presented in experiments.

• The Journal of the Acoustical Society of Korea
• /
• v.30 no.6
• /
• pp.308-314
• /
• 2011

This paper presents techniques for estimating directions of multiple sound sources ranging from $0^{\circ}$ to $360^{\circ}$ using circular probability distributions having a periodic property. Phase differences containing direction information of sources can be modeled as mixtures of multiple probability distributions and source directions can be estimated by maximizing log-likelihood functions. Although the von Mises distribution is widely used for analyzing this kind of periodic data, we define a new class of circular probability distributions from Gaussian and Laplacian distributions by adopting a modulo operation to have $2{\pi}$-periodicity. Direction estimation with these circular probability distributions is done by implementing corresponding EM (Expectation-Maximization) algorithms. Simulation results in various reverberant environments confirm that Laplacian distribution provides better performance than von Mises and Gaussian distributions.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1996.05b
• /
• pp.719-724
• /
• 1996

본 연구는 유지, 보수되는 상시 작동 시스템에 대한 신뢰성 분석을 위해 동적 불완전 수리모형 및 분석 절차의 개발을 수행하였다. 또한 수리 상태에 대한 데이타가 완전히 잠재적(masked)이라 하더라도 기본 분포(base-line distribution)가 와이블 분포라는 가정하에 모수적 추정 절차를 개발하였다. 개발된 추정 절차는 기본적으로 EM(Expectation and Maximization : EM) 알고리즘의 틀(framework)을 유지하고 있다. 특히 최소 수리 특성으로 인해 분포가 변화함에 따라 발생하는 추정의 어려움을 해결하기 위해 데이타 변환(transformation)식을 제시하고 이러한 변환 데이타를 사용함으로써 추가적 데이타의 요구없이 잠재적 데이타를 사용하여 추정을 가능하게 하는 모수 추정 알고리즘을 제시하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12C
• /
• pp.1200-1208
• /
• 2003

Affective computing plays an important role in intelligent Human Computer Interactions(HCI). To detect emotional events, it is desirable to construct a computing model for extracting emotion related features from video. In this paper, we propose a statistical model based on the probabilistic distribution of low level features in video shots. The proposed method extracts low level features from video shots and then from a GMM(Gaussian Mixture Model) for them to detect emotional shots. As low level features, we use color, camera motion and sequence of shot lengths. The features can be modeled as a GMM by using EM(Expectation Maximization) algorithm and the relations between time and emotions are estimated by MLE(Maximum Likelihood Estimation). Finally, the two statistical models are combined together using Bayesian framework to detect emotional events in video.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.1
• /
• pp.145-151
• /
• 2014

This paper proposes an image haze removal algorithm for a single image. The conventional Dark Channel Prior(DCP) algorithm estimates a transmission map using the dark information in an image, and the haze regions are then detected using a matting algorithm. However, since the DCP algorithm uses block-based processing, block artifacts are invariably formed in the transmission map. To solve this problem, the proposed algorithm generates a modified transmission map using a Hidden Markov Random Field(HMRF) and Expectation-Maximization(EM) algorithm. Experimental results confirm that the proposed algorithm is superior to conventional algorithms in image haze removal.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.3
• /
• pp.87-93
• /
• 2017

A maximum likelihood (ML) approach is presented for estimating the mean of radar cross section (RCS) of a Swerling III target and its numerical solution methods are discussed. The solution methods are based on an approximate expression for implementing the expectation maximization (EM) algorithm. The methods are evaluated and compared through Monte Carlo simulations in terms of estimation accuracy and computational efficiency to obtain a most efficient method for both Swerling I and Swerling III targets. The methods are also compared with a previously reported method based on heuristics.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2615-2617
• /
• 2003

The Kalman filter is a recursive Linear Estimator for the linear dynamic systems(LDS) affected by two different noises called process noise and measurement noise both of which are uncorrelated white. The Expectation Maximization(EM) algorithm is employed in this paper as a preprocessor to reinforce the effectiveness of Kalman estimator. Particularly, we focus on the relation between Kalman filter and EM algorithm in the LDS. In this paper, we propose a new algorithm to improve the performance on the parameter estimation via EM algorithm, which improves the overall process of Kalman filtering. Since Kalman filter algorithm not only needs the system parameters but also is very sensitive the initial state conditions, the initial conditions decided through EM turns out to be very effective. In experiments, the computer simulation results ate provided to demonstrate the superiority of the proposed algorithm.