• The Korean Journal of Applied Statistics
• /
• v.25 no.5
• /
• pp.837-846
• /
• 2012

Monte Carlo methods have been used in exact inference for contingency tables for a long time; however, they suffer from ergodicity and the ability to achieve a desired proportion of valid tables. In this paper, we apply the stochastic approximation Monte Carlo(SAMC; Liang et al., 2007) algorithm, as an adaptive Markov chain Monte Carlo, to the exact test of mutual independence in a multiway contingency table. The performance of SAMC has been investigated on real datasets compared to with existing Markov chain Monte Carlo methods. The numerical results are in favor of the new method in terms of the quality of estimates.

• ETRI Journal
• /
• v.45 no.3
• /
• pp.394-403
• /
• 2023

Direct tracking problem of moving noncircular sources for multiple arrays is investigated in this study. Here, we propose an improved unscented particle filter (I-UPF) direct tracking method, which combines system proportional symmetry unscented particle filter and Markov Chain Monte Carlo (MCMC) algorithm. Noncircular sources can extend the dimension of sources matrix, and the direct tracking accuracy is improved. This method uses multiple arrays to receive sources. Firstly, set up a direct tracking model through consecutive time and Doppler information. Subsequently, based on the improved unscented particle filter algorithm, the proposed tracking model is to improve the direct tracking accuracy and reduce computational complexity. Simulation results show that the proposed improved unscented particle filter algorithm for noncircular sources has enhanced tracking accuracy than Markov Chain Monte Carlo unscented particle filter algorithm, Markov Chain Monte Carlo extended Kalman particle filter, and two-step tracking method.

• Management Science and Financial Engineering
• /
• v.19 no.2
• /
• pp.49-53
• /
• 2013

A Markov-chain Monte Carlo sampling algorithm samples a new point around the latest sample due to the Markov property, which prevents it from sampling from multi-modal distributions since the corresponding chain often fails to search entire support of the target distribution. In this paper, to overcome this problem, mode switching scheme is applied to the conventional MCMC algorithms. The algorithm separates the reducible Markov chain into several mutually exclusive classes and use mode switching scheme to increase mixing rate. Simulation results are given to illustrate the algorithm with promising results.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06c
• /
• pp.263-266
• /
• 2007

This paper discusses the Bayesian statistical inference. This paper discusses the Bayesian inference, MCMC (Markov Chain Monte Carlo) integration, MCMC method, Metropolis-Hastings algorithm, Gibbs sampling, Maximum likelihood estimation, Expectation Maximization algorithm, missing data processing, and BMA (Bayesian Model Averaging). The Bayesian statistical inference is used to process a large amount of data in the areas of biology, medicine, bioengineering, science and engineering, and general data analysis and processing, and provides the important method to draw the optimal inference result. Lastly, this paper discusses the method of principal component analysis. The PCA method is also used for data analysis and inference.

• Communications for Statistical Applications and Methods
• /
• v.7 no.1
• /
• pp.211-224
• /
• 2000

The Bayes estimation of the proportion in successive occasions sampling with randomized response model is discussed by means of Acceptance Rejection sampling. Bayesian estimation of transition probabilities in two successive occasions is suggested via Markov Chain Monte Carlo algorithm and its applicability is represented in a numerical example.

• The Journal of Korea Robotics Society
• /
• v.7 no.2
• /
• pp.113-119
• /
• 2012

In this paper we propose the method that detects moving objects in autonomous navigation vehicle using LRF sensor data. Object detection and tracking methods are widely used in research area like safe-driving, safe-navigation of the autonomous vehicle. The proposed method consists of three steps: data segmentation, mobility classification and object tracking. In order to make the raw LRF sensor data to be useful, Occupancy grid is generated and the raw data is segmented according to its appearance. For classifying whether the object is moving or static, trajectory patterns are analysed. As the last step, Markov chain Monte Carlo (MCMC) method is used for tracking the object. Experimental results indicate that the proposed method can accurately detect moving objects.

• Communications for Statistical Applications and Methods
• /
• v.10 no.2
• /
• pp.268-275
• /
• 2003

We consider the Bayesian accelerated failure time model. The error distribution is assigned a skewed normal distribution which is including normal distribution. For noninformative priors of regression coefficients, we show the propriety of posterior distribution. A Markov Chain Monte Carlo algorithm(i.e., Gibbs Sampler) is used to obtain a predictive distribution for a future observation and Bayes estimates of regression coefficients.

• Journal of Satellite, Information and Communications
• /
• v.9 no.4
• /
• pp.104-110
• /
• 2014

This paper considers two reconstruction schemes of structured-sparse signals, turbo inference and Markov chain Monte Carlo (MCMC) inference, in compressed sensing(CS) technique that is recently getting an important issue for an efficient video wireless transmission system using multi-copter as an unmanned aerial vehicle. Proposed reconstruction algorithms are setting importance on reduction of image data sizes, fast reconstruction speed and errorless reconstruction. As a result of experimentation with twenty kinds of images, we can find turbo reconstruction algorithm based on loopy belief propagation(BP) has more excellent performances than MCMC algorithm based on Gibbs sampling as aspects of average reconstruction computation time, normalized mean squared error(NMSE) values.

• Journal of Korean Society on Water Environment
• /
• v.36 no.5
• /
• pp.373-384
• /
• 2020

Hydrological models are based on a combination of parameters that describe the hydrological characteristics and processes within a watershed. For this reason, the model performance and accuracy are highly dependent on the parameters. However, model uncertainties caused by parameters with stochastic characteristics need to be considered. As a follow-up to the study conducted by Choi et al (2020), who developed a relatively simple semi-distributed hydrological model, we propose a tool to estimate the posterior distribution of model parameters using the Metropolis-Hastings algorithm, a type of Markov-Chain Monte Carlo technique, and analyze the uncertainty of model parameters and simulated stream flow. In addition, the uncertainty caused by the parameters of each version is investigated using the lumped and semi-distributed versions of the applied model to the Hapcheon Dam watershed. The results suggest that the uncertainty of the semi-distributed model parameters was relatively higher than that of the lumped model parameters because the spatial variability of input data such as geomorphological and hydrometeorological parameters was inherent to the posterior distribution of the semi-distributed model parameters. Meanwhile, no significant difference existed between the two models in terms of uncertainty of the simulation outputs. The statistical goodness of fit of the simulated stream flows against the observed stream flows showed satisfactory reliability in both the semi-distributed and the lumped models, but the seasonality of the stream flow was reproduced relatively better by the distributed model.

• Smart Structures and Systems
• /
• v.15 no.3
• /
• pp.735-749
• /
• 2015

The major difficulty of using Bayesian probabilistic inference for system identification is to obtain the posterior probability density of parameters conditioned by the measured response. The posterior density of structural parameters indicates how plausible each model is when considering the uncertainty of prediction errors. The Markov chain Monte Carlo (MCMC) method is a widespread medium for posterior inference but its convergence is often slow. The differential evolution adaptive Metropolis-Hasting (DREAM) algorithm boasts a population-based mechanism, which nms multiple different Markov chains simultaneously, and a global optimum exploration ability. This paper proposes an improved differential evolution adaptive Metropolis-Hasting algorithm (IDREAM) strategy to estimate the posterior density of structural parameters. The main benefit of IDREAM is its efficient MCMC simulation through its use of the adaptive Metropolis (AM) method with a mutation strategy for ensuring quick convergence and robust solutions. Its effectiveness was demonstrated in simulations on identifying the structural parameters with limited output data and noise polluted measurements.