• The Korean Journal of Applied Statistics
• /
• v.24 no.1
• /
• pp.177-183
• /
• 2011

Hidden Markov random eld(HMRF) is one of the most common model for image segmentation which is an important preprocessing in many imaging devices. The HMRF has unknown hyper-parameters on Markov random field to be estimated in segmenting testing images. However, in practice, due to computational complexity, it is often assumed to be a fixed constant. In this paper, we numerically show that the segmentation results very depending on the fixed hyper-parameter, and, if the parameter is misspecified, they further depend on the choice of the class-labelling algorithm. In contrast, the HMRF with estimated hyper-parameter provides consistent segmentation results regardless of the choice of class labelling and the estimation method. Thus, we recommend practitioners estimate the hyper-parameter even though it is computationally complex.

• 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 Engineers of Korea SP
• /
• v.44 no.1
• /
• pp.40-48
• /
• 2007

This paper presents a novel texture segmentation method using multilayer perceptron (MLP) networks and Markov random fields in multiscale Bayesian framework. Multiscale wavelet coefficients are used as input for the neural networks. The output of the neural network is modeled as a posterior probability. Texture classification at each scale is performed by the posterior probabilities from MLP networks and MAP (maximum a posterior) classification. Then, in order to obtain the more improved segmentation result at the finest scale, our proposed method fuses the multiscale MAP classifications sequentially from coarse to fine scales. This process is done by computing the MAP classification given the classification at one scale and a priori knowledge regarding contextual information which is extracted from the adjacent coarser scale classification. In this fusion process, the MRF (Markov random field) prior distribution and Gibbs sampler are used, where the MRF model serves as the smoothness constraint and the Gibbs sampler acts as the MAP classifier. The proposed segmentation method shows better performance than texture segmentation using the HMT (Hidden Markov trees) model and HMTseg.

• Journal of KIISE:Software and Applications
• /
• v.36 no.12
• /
• pp.1034-1037
• /
• 2009

Sign language spotting is the task of detecting the start and end points of signs from continuous data and recognizing the detected signs in the predefined vocabulary. The difficulty with sign language spotting is that instances of signs vary in both motion and shape. Moreover, signs have variable motion in terms of both trajectory and length. Especially, variable sign lengths result in problems with spotting signs in a video sequence, because short signs involve less information and fewer changes than long signs. In this paper, we propose a method for spotting variable lengths signs based on semi-CRF (semi-Markov Conditional Random Field). We performed experiments with ASL (American Sign Language) and KSL (Korean Sign Language) dataset of continuous sign sentences to demonstrate the efficiency of the proposed method. Experimental results show that the proposed method outperforms both HMM and CRF.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.6
• /
• pp.1852-1860
• /
• 2000

Distinct from the Markov random field or pseudo 2D HMM models for image analysis, this paper proposes a new model of 2D hidden Markov mesh chain(HMMM) model which subsumes the definitions of and the assumptions underlying the conventional HMM. The proposed model is a new theoretical realization of 2D HMM with the causality of top-down and left-right progression and the complete lattice constraint. These two conditions enable an efficient mesh decoding for model estimation and a recursive maximum likelihood estimation of model parameters. Those algorithms are developed in theoretical perspective and, in particular, the training algorithm, it is proved, attains the optimal set of parameters.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2009.10a
• /
• pp.99-105
• /
• 2009

Crack detection method of a rotating blade was suggested in this paper. A rotating blade was modeled with a cantilever beam connected to a hub undergoing rotating motion. The existence and the location of crack were able to be recognized from the vertical response of end tip of a rotating cantilever beam by employing Discrete Hidden Markov Model (DHMM) and Empirical Mode Decomposition (EMD). DHMM is a famous stochastic method in the field of speech recognition. However, in recent researches, it has been proved that DHMM can also be used in machine health monitoring. EMD is the method suggested by Huang et al. that decompose a random signal into several mono component signals. EMD was used in this paper as the process of extraction of feature vectors which is the important process to developing DHMM. It was found that developed DHMMs for crack detection of a rotating blade have shown good crack detection ability.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1281-1287
• /
• 2016

This paper presents a method of single image dehazing and feature matching for aerial remote sensing images. In the case of a aerial image, transferring the information of the original image is difficult as the contrast leans by the haze. This also causes that the image contrast decreases. Therefore, a refined transmission map based on a hidden Markov random field. Moreover, the proposed algorithm enhances the accuracy of image matching surface-based features in an aerial remote sensing image. The performance of the proposed algorithm is confirmed using a variety of aerial images captured by a Worldview-2 satellite.

• Journal of Broadcast Engineering
• /
• v.21 no.2
• /
• pp.272-275
• /
• 2016

This paper presents a method of single image dehazing and surface-based feature detection for remote sensing images. In the conventional dark channel prior (DCP) algorithm, the resulting transmission map invariably includes some block artifacts because of patch-based processing. This also causes image blur. Therefore, a refined transmission map based on a hidden Markov random field and expectation-maximization algorithm can reduce the block artifacts and also increase the image clarity. Also, the proposed algorithm enhances the accuracy of image matching surface-based features in an remote sensing image. Experimental results confirm that the proposed algorithm is superior to conventional algorithms in image haze removal. Moreover, the proposed algorithm is suitable for the problem of image matching based on feature extraction.