• Investigative Magnetic Resonance Imaging
• /
• v.2 no.1
• /
• pp.58-66
• /
• 1998

Purpose : This paper introduces a new three dimensional magnetic Resonance Image classification which is based on Mar kov Random Field-Gibbs Random Field with a line model. Material and Methods : The performance of the Gibbs Classifier over a statistically heterogeneous image can be improved if the local stationary regions in the image are disassociated from each other through the mechanism of the interaction parameters defined at the local neighborhood level. This usually involves the construction of a line model for the image. In this paper we construct a line model for multisignature images based on the differential of the image which can provide an a priori estimate of the unobservable line field, which may lie in regions with significantly different statistics. the line model estimated from the original image data can in turn be used to alter the values of the interaction parameters of the Gibbs Classifier. Results : MRF-Gibbs classifier for volumetric MR images is developed under the condition that the domain of the image classification is $E^{3}$ space rather thatn the conventional $E^{2}$ space. Compared to context free classification, MRF-Gibbs classifier performed better in homogeneous and along boundaries since contextual information is used during the classification. Conclusion : We construct a line model for multisignature, multidimensional image and derive the interaction parameter for determining the energy function of MRF-Gibbs classifier.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.3 s.303
• /
• pp.1-6
• /
• 2005

In the Markov network which models disparity map with the Markov Random Fields(MRF), the belief propagation algorithm is operated by message passing between nodes corresponding to each pixel. The initial message value is converged by iterations of the algorithm and the algorithm requires many iterations to get converged messages. In this paper, we simplify the algorithm by regarding the objects in the disparity map as combinations of lines with same message valued nodes to reduce iterations of the algorithm.

• Journal of Korea Multimedia Society
• /
• v.16 no.12
• /
• pp.1368-1375
• /
• 2013

In this paper, we presents a spatially adaptive noise detection and removal algorithm. Under the assumption that an observed image and the additive noise have Gaussian distribution, the noise parameters are estimated with local statistics, and the parameters are used to define the constraints on the noise detection process, where the first order Markov Random Field (MRF) is used. In addition, an adaptive low-pass filter having a variable window sizes defined by the constraints on noise detection is used to control the degree of smoothness of the reconstructed image. Experimental results demonstrate the capability of the proposed algorithm.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.9
• /
• pp.95-103
• /
• 1998

This paper proposes an image segmentation algorithm based on fusion of range and intensity images. Based on Bayesian theory, a priori knowledge is encoded by the Markov random field (MRF). A maximum a posteriori (MAP) estimator is constructed using the features extracted from range and intensity images. Objects are approximated by local planar surfaces in range images, and the parametric space is constructed with the surface parameters estimated pixelwise. In intensity images the ${\alpha}$-trimmed variance constructs the intensity feature. An image is segmented by optimizing the MAP estimator that is constructed using a likelihood function based on edge information. Computer simulation results shw that the proposed fusion algorithm effectively segments the images independentl of shadow, noise, and light-blurring.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.9
• /
• pp.76-90
• /
• 1999

In this paper, a color image retrieval algorithm is proposed based on color histogram and color texture. The representative color vectors of a color image are made from k-means clustering of its color histogram, and color texture is generated by centering around the color of pixels with its color vector. Thus the color texture means texture properties emphasized by its color histogram, and it is analyzed by Gaussian Markov Random Field (GMRF) model. The proposed algorithm can work efficiently because it does not require any low level image processing such as segmentation or edge detection, so it outperforms the traditional algorithms which use color histogram only or texture properties come from image intensity.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.9
• /
• pp.66-75
• /
• 1999

Image segmentation is the process where an image is segmented into regions that are set of homogeneous pixels. The result has a ciritical effect on accuracy of image understanding. In this paper, an Markov random field (MRF) image segmentation is proposed using genetic algorithm(GA). We model an image using MRF which is resistant to noise and blurring. While MRF based methods are robust to degradation, these require accurate parameter estimation. So GA is used as a segmentation algorithm which is effective at dealing with combinatorial problems. The efficiency of the proposed method is shown by experimental results with real images and application to automatic vehicle extraction system.

• Korean Journal of Remote Sensing
• /
• v.19 no.6
• /
• pp.479-490
• /
• 2003

This study proposed a modified anisotropic diffusion restoration for image classification. The anisotropic diffusion restoration uses a probabilistic model based on Markov random field, which represents geographical connectedness existing in many remotely sensed images, and restores them through an iterative diffusion processing. In every iteration, the bonding-strength coefficient associated with the spatial connectedness is adaptively estimated as a function of brightness gradient. The gradient function involves a constant called "temperature", which determines the amount of discontinuity and is continuously decreased in the iterations. In this study, the proposed method has been extensively evaluated using simulated images that were generated from various patterns. These patterns represent the types of natural and artificial land-use. The simulated images were restored by the modified anisotropic diffusion technique, and then classified by a multistage hierarchical clustering classification. The classification results were compared to them of the non-restored simulation images. The restoration with an appropriate temperature considerably reduces error in classification, especially for noisy images. This study made experiments on the satellite images remotely sensed on the Korean peninsula. The experimental results show that the proposed approach is also very effective on image classification in remote sensing.

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

• Coupled systems mechanics
• /
• v.11 no.5
• /
• pp.411-438
• /
• 2022

In this paper, we present the parameter identification for inelastic and multi-scale problems. First, the theoretical background of several fundamental methods used in the upscaling process is reviewed. Several key definitions including random field, Bayesian theorem, Polynomial chaos expansion (PCE), and Gauss-Markov-Kalman filter are briefly summarized. An illustrative example is given to assimilate fracture energy in a simple inelastic problem with linear hardening and softening phases. Second, the parameter identification using the Gauss-Markov-Kalman filter is employed for a multi-scale problem to identify bulk and shear moduli and other material properties in a macro-scale with the data from a micro-scale as quantities of interest (QoI). The problem can also be viewed as upscaling homogenization.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4405-4418
• /
• 2016

Automatic image completion techniques have difficulty processing images in which the target region has multiple planes or is non-facade. Here, we propose a new image completion method that uses belief propagation based on planar priorities. We first calculate planar information, which includes planar projection parameters, plane segments, and repetitive regularity extractions within the plane. Next, we convert this planar information into planar guide knowledge using the prior probabilities of patch transforms and offsets. Using the energy of the discrete Markov Random Field (MRF), we then define an objective function for image completion that uses the planar guide knowledge. Finally, in order to effectively optimize the MRF, we propose a new optimization scheme, termed Planar Priority-belief propagation that includes message-scheduling-based planar priority and dynamic label cropping. The results of experiment show that our approach exhibits advanced performance compared with existing approaches.