• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1722-1725
• /
• 1997

This paper presents image analysis method using a Markov random field(MRF) model. Particulary, image esgmentation is to partition the given image into regions. This scheme is first segmented into regions, and the obtained domain knowledge is used to obtain the improved segmented image by a Markov random field model. The method is a maximum a posteriori(MAP) estimation with the MRF model and its associated Gibbs distribution. MAP estimation method is applied to capture the natural image by TMS320C80(MVP) and to realize the segmented image by a MRF model.

• 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.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2100-2103
• /
• 2003

기존의 객체 추출 및 추적 기법은 외형 변화가 없는 객체를 대상으로 하거나 배경이 고정된 영상만을 고려하였다 본 논문에서는 영역의 색상과 움직임 정보, 그리고 인접한 영역의 상관 관계를 고려한 Markov Random Field (MRF) 모델을 제안한다. MRF 모델은 영상의 시간적 공간적 상관성을 기반으로 최적의 레이블 셋을 계산함으로써 보다 정확하게 객체를 추출 및 추적할 수 있다. 또한, 블록 기반 움직임 추출 알고리즘인 Diamond Search (DS)를 분할된 영역에 적용하여 빠르게 영역의 움직임과 전역 움직임을 추정하였다. 실험 결과 제안한 방법이 객체의 외형 변화와 카메라 움직임이 있는 동영상에서 빠른 속도로 정확하게 객체를 추출 및 추적하는 것을 확인하였다.

• 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.

• ETRI Journal
• /
• v.40 no.2
• /
• pp.237-245
• /
• 2018

The Distributed Modulated Wideband Converter (DMWC) is a networking system developed from the Modulated Wideband Converter, which converts all sampling channels into sensing nodes with number variables to implement signal undersampling. When the number of sparse subbands changes, the number of nodes can be adjusted flexibly to improve the reconstruction rate. Owing to the different attenuations of distributed nodes in different locations, it is worthwhile to find out how to select the optimal sensing node as the sampling channel. This paper proposes the spectrum sensing of DMWC based on a Markov random field (MRF) to select the ideal node, which is compared to the image edge segmentation. The attenuation of the candidate nodes is estimated based on the attenuation of the neighboring nodes that have participated in the DMWC system. Theoretical analysis and numerical simulations show that neighboring attenuation plays an important role in determining the node selection, and selecting the node using MRF can avoid serious transmission attenuation. Furthermore, DMWC can greatly improve recovery performance by using a Markov random field compared with random selection.

• Communications for Statistical Applications and Methods
• /
• v.16 no.6
• /
• pp.925-936
• /
• 2009

There very many approaches to impute missing values in the iid. case. However, it is hardly found the imputation techniques in the Markov random field(MRF) case. In this paper, we show that the imputation under MRF is just to impute by fitting the normal mixture model(NMM) under several practical assumptions. Our multivariate normal mixture model based approaches under MRF is applied to impute the missing pixel values of 3-variate (R, G, B) color image, providing a technique to smooth the imputed values.

• Communications for Statistical Applications and Methods
• /
• v.8 no.1
• /
• pp.109-115
• /
• 2001

Wavelet coefficients are known to have decorrelating properties, since wavelet is orthonormal transformation. but empirically, those wavelet coefficients of images, like edges, are not statistically independent. Jansen and Bultheel(1999) developed the empirical Bayes approach to improve the classical threshold algorithm using local characterization in Markov random field. They consider the clustering of significant wavelet coefficients with uniform distribution. In this paper, we developed wavelet thresholding algorithm using Laplacian distribution which is more realistic model.

• 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.

• Korean Journal of Remote Sensing
• /
• v.17 no.4
• /
• pp.335-344
• /
• 2001

Texture is extensively studied in a variety of image processing applications such as image segmentation and classification because it is an important property to perceive regions and surfaces. This paper focused on the analysis and synthesis of textured single and multiband images using Markov Random Field model considering the existent spatial correlation. Especially, for multiband images, the cross-channel correlation existing between bands as well as the spatial correlation within band should be considered in the model. Although a local interaction is assumed between the specified neighboring pixels in MRF models, during the maximization process, short-term correlations among neighboring pixels develop into long-term correlations. This result in exhibiting phase transition. In this research, the role of temperature to obtain the most probable state during the sampling procedure in discrete Markov Random Fields and the stopping rule were also studied.

• Korean Journal of Remote Sensing
• /
• v.15 no.2
• /
• pp.147-158
• /
• 1999

Remote sensing technique has offered better understanding of our environment for the decades by providing useful level of information on the landcover. In many applications using the remotely sensed data, digital image processing methodology has been usefully employed to characterize the features in the data and develop the models. Random field models, especially Markov Random Field (MRF) models exploiting spatial relationships, are successfully utilized in many problems such as texture modeling, region labeling and so on. Usually, remotely sensed imagery are very large in nature and the data increase greatly in the problem requiring temporal data over time period. The time required to process increasing larger images is not linear. In this study, the methodology to reduce the computational cost is investigated in the utilization of the Markov Random Field. For this, multiresolution framework is explored which provides convenient and efficient structures for the transition between the local and global features. The computational requirements for parameter estimation of the MRF model also become excessive as image size increases. A Bayesian approach is investigated as an alternative estimation method to reduce the computational burden in estimation of the parameters of large images.