Markov Random Field Model-Based Edge-Directed Image Interpolation

For decades, Markov random fields (MRF) have been used by statistical physicists to explain various phenomena occurring among neighboring particles because of their ability to describe local interactions between them. In Winkler (1995) and Bremaud (1999), an MRF model is used to explain why neighboring particles are more likely to rotate in the same direction (clockwise or counterclockwise) or why intensity values of adjacent pixels of an image are more likely to be the same than different values. This model is called the Ising model. There are a large number of problems that can be modeled using the Ising model and where an MRF model can be used. Basically, an MRF model is a spatial-domain extension of a temporal Markov chain where an event at the current time instant depends only on events of a few previous time instants. In MRF, the statistical dependence is defined over the neighborhood system, a collection of neighbors, rather than past events as in the Markov chain model. It is obvious that this type of spatial dependence is a common phenomenon in various signal types including images. In general, images are smooth and, therefore, the intensity values of neighboring pixels are highly dependent on each other. Because of its highly theoretical and complex nature, and intensive computational requirements, practical uses of MRF were extremely limited until recently. Due to the dramatic improvements in computer technologies, MRF modeling has become more feasible for numerous applications, for example, image analysis because many image properties, such as texture, seem to fit an MRF model, i.e., intensity values of neighboring pixels of images are known to be highly correlated with each other. The Markovian nature of these textural properties has long been recognized in the image processing community, and has widely been used in a variety of applications (e.g. image compression and image noise removal). However, these applications were limited to empirical studies and were not based on a statistical model such as the MRF model.

Autocorrelation-based interlaced to progressive format conversion

In this paper, we propose a sequence labeling method by using SVM posterior probabilities with a Markov Random Field (MRF) model for colorectal Narrow Band Imaging (NBI) zoom-videoendoscope. Classifying each frame of a video sequence by SVM classifiers independently leads to an output sequence which is unstable and hard to understand by endoscopists. To make it more stable and readable, we use an MRF model to label the sequence of posterior probabilities. In addition, we introduce class asymmetry for the NBI images in order to keep and enhance frames where there is a possibility that cancers might have been detected. Experimental results with NBI video sequences demonstrate that the proposed MRF model with class asymmetry performs much better than a model without asymmetry.

The present paper is concerned with the study of parallel approaches for the relaxation algorithms associated to Markov Random Fields (MRF) models in image analysis, [2]. MRF-based relaxation algorithms are known to be intrinsically parallel and massive parallelizations by updating at once independent variables of the field have been early described, [4]. We present here a different approach based on relaxation algorithms running in parallel at different and interacting periodically. The proposed approach is based on parallel Markov chains which have been studied by Aarts et al., [l], and Graffigne, [3], for global optimization using simulated annealing. In our method, parallel Markov chains are coupled with a new multiscale exploration of the configuration space for MRF. This multiscale exploration can be implemented efficiently by considering a sequence of multiresolution MRF models whose parameters and neighborhood structures are obtained from the original MRF model. The designed algorithm is suited for MIMD computers and can be outlined as follows. First MRF models at different scales are computed from the original MRF model. The relaxations at different scales are stochastic and cooperative : every p iterations - one iteration corresponding to a full sweep on the image - a processor attempts to transfer local estimates to the processor controlling the next finer scale. With the low resolution levels of the hierarchy are associated high temperatures in the stochastic relaxation, [3]. A high temperature allows to escape from local minima of the energy function. With the intermediate resolution levels are associated lower temperatures. At these levels, the relaxation process becomes more sensitive to local minima and visits the large or medium size valleys of the energy landscape. At the finest resolution level deterministic relaxation is adopted : the estimation is ultimately refined at that level. The proposed parallelization approach is compared to sequential deterministic and stochastic relaxation in the context of optical flow estimation. The multiscale algorithm exhibits fast convergence properties, comparable to multigrid deterministic relaxation, and the obtained estimates are close to the near optimal solutions obtained by time consuming sequential stochastic methods.

In this paper we propose a fast approach for edge preserving super-resolution (SR) based on learning of contourlet coefficients. Given a low resolution test image, we first obtain an initial HR estimate i.e., a close approximation to SR image by learning the contourlet coefficients from a training database consisting of low resolution (LR) and high resolution (HR) images. The final SR image is obtained by using a regularization framework in which both the SR and the LR images are modeled as separate homogeneous Markov Random Fields (MRFs). The LR image formation process is modeled as a decimated and noisy version of the SR image and the final cost function is minimized by using a gradient descent method. Novelty of our approach lies in preserving the edges in the final SR image while using a non edge preserving MRF prior. This is definitely advantageous since it avoids the use of discontinuity preserving prior and hence the computationally taxing optimization methods. The edges in the final SR correspond to those learned from the initial HR estimate. The use of MRF on the low resolution image imposes an additional constraint on the final solution and hence we expect a better solution. In addition, we use the initial HR image for estimating the decimation matrix entries as well as for learning the corresponding MRF parameter. We show the effectiveness of the proposed approach by conducting the experiments on images captured using a real camera.

In order to overcome the poor anti-noise performance of traditional fuzzy C-Means (FCM) algorithm in image segmentation, a novel improved FCM algorithm was proposed in this paper based on Particle Swarm Optimization (PSO) algorithm and Markov Random Field (MRF) model, which can make full use of the global searching ability of PSO and the spatial information integrating ability of MRF for image segmentation. In this algorithm, the image segmentation is converted to a PSO optimization problem, in which the fitness function is set up to containing the spatial information based on the spectral value and the neighboring pixels modeled by MRFs. And segmentation results can be iteratively obtained during the PSO iterations according to the newly designed membership function of FCM in which the spatial information is integrated. The experiments herein reported in this paper illustrate the better performance of this algorithm than the traditional FCM algorithm and the PSO algorithm for image segmentation.

This paper presents a novel texture segmentation method using neural networks and a Markov random field (MRF) model. Multi-scale wavelet coefficients are used as input for the neural networks. The output of the neural network is modeled as a posterior probability. Initially, the multi-scale texture segmentation is performed by the posterior probabilities from the neural networks and MAP (maximum a posterior) classification. Then the MAP segmentation maps are produced at all scales. In order to obtain the more improved segmentation result at the finest scale, our proposed method fuses the multi-scale MAP segmentations sequentially from coarse to fine scales. This is done by computing the MAP segmentation given the segmentation map at one scale and a priori knowledge regarding contextual information which is extracted from the adjacent coarser scale segmentation. In this fusion process, the MRF 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.

We present a new method using the Bayesian approach and a Markov random field (MRF) model of integrating several low level visual modules. Using this approach, we have shown how results from an edge based stereo module can be integrated with an intensity based stereo algorithm. In another example, results from a shape from shading module are combined with intensity based stereo. We first derive the intensity based stereo algorithm using the MRF model. The integration is then performed by coupling the results from other modules to the energy functional of the MRF associated with the intensity based stereo. The maximum a prosteriori (MAP) estimate of the resulting MRF is obtained using the mean field annealing algorithm. Results from real and artificial images show a consistent improvement in the accuracy after integration.

Image segmentation method combined with Markov random field (MRF) model and regional growth image in this paper is proposed to achieve the accuracy of sonar image segmentation. First of all, the characteristics of field and the label field of sonar image is established through the MRF model; secondly, the further image segmentation is processed by region growing based on the initial image segmentation by ICM algorithm, and this reduced segmentation plaques caused by the MRF method on image segmentation. Finally, experimental results show that the method in this paper can obtain the image segmentation effectively.

Markov random field (MRF) models are a popular tool for vision and image processing. Gaussian MRF models are particularly convenient to work with because they can be implemented using matrix and linear algebra routines. However, recent research has focused on on discrete-valued and non-convex MRF models because Gaussian models tend to over-smooth images and blur edges. In this paper, we show how to train a Gaussian conditional random field (GCRF) model that overcomes this weakness and can outperform the non-convex field of experts model on the task of denoising images. A key advantage of the GCRF model is that the parameters of the model can be optimized efficiently on relatively large images. The competitive performance of the GCRF model and the ease of optimizing its parameters make the GCRF model an attractive option for vision and image processing applications.

A new image segmentation algorithm based on Markov random field (MRF) and ant colony system (ACS) is presented in this paper. Information positive feedback and heuristic search, the characters of ACS, were applied for the image segmentations with MRF model. The maximum a posterior (MAP) global best solution of segmentations will be got though MRF, which describes image data relations by local correlations instead of global image possibility distributions. Compared with the simulated annealing (AS), ACS needs less time to search the global best solution. In this paper we proposed a segmentation algorithm combined MRF with ACS, which not only applied ACS as optimization algorithm but also introduced the neighborhood pheromone interaction rules into ACS under MRF model. Especially the pheromone interaction update provided remunerative information to ants in a neighborhood instead of an ant, which could accelerate the optimizing velocity and restrain the relative blur noise. The followed image segmentations experiments proved that this novel algorithm could reach a satisfied result among the noise restraint, edges preservation and computation complexity.

This paper describes a Markov random field (MRF) model with weighting parameters optimized by conditional random field (CRF) for on-line recognition of handwritten Japanese characters. It also presents updated evaluation using a large testing set. The model extracts feature points along the pen-tip trace from pen-down to pen-up and sets each feature point from an input pattern as a site and each state from a character class as a label. It employs the coordinates of feature points as unary features and the differences in coordinates between the neighboring feature points as binary features. The weighting parameters are estimated by CRF or the minimum classification error (MCE) method. In experiments using the TUAT Kuchibue database, the method achieved a character recognition rate of 92.77%, which is higher than the previous model's rate, and the method of estimating the weighting parameters using CRF was more accurate than using MCE.

A valid multiscale classification method of synthetic aperture radar (SAR) imagery is proposed based on multiscale technology and Markov random field (MRF) mode. Firstly, we employ multiscale autoregressive model for extracting the feature of SAR image. which is modeled by Markov random field (MRF) Model that relies on the Gaussian distribution. Secondly, using the joint probability distribution in terms of an energy function, estimation of parameters can be performed by the stochastic relaxation algorithm. Then the maximum posteriori (MAP) is designed as the optimal criterion and the final labels are obtained by the simulated annealing algorithm. Experimental results show that this method is accurate, efficient and robust.

This paper proposes a Markov Random Field (MRF) model used for denoising to preserve the edge. This model combines both gray distinction and edge detection results to determine the weight between adjacent pixels. On the basis of MMRF (Membrane MRF), it imports the weight coefficient to build EPMRF (Edge Preserving MRF) model. This model can describe edge characteristics effectively and reduce impact between adjacent pixels to achieve preserving the edge. The experimental results show that denoising based on EPMRF model have a better performance compared with the traditional MMRF and GMRF (Gaussian MRF) models in removing the image noise, especially in edge preserving.

Based on the computer texture analysis method, a new noncontact surface roughness measurement technique is proposed. The method is inspired by the nonredundant directional selectivity and highly discriminative nature of the wavelet representation and the capability of the Markov random field (MRF) model to capture statistical regularities. Surface roughness information contained in the texture features may be extracted based on an MRF stochastic model of textures in the wavelet feature domain. The model captures significant intrascale and interscale statistical dependencies between wavelet coefficients. To investigate the relationship between the texture features and surface roughness Ra, a simple research setup, which consists of a charge-coupled diode camera without a lens and a diode laser, was established, and the laser speckle texture patterns are acquired from some standard grinding surfaces. The research results have illustrated that surface roughness Ra has a good monotonic relationship with the texture features of the laser speckle pattern. If this measuring system is calibrated with the surface standard samples roughness beforehand, the surface roughness actual value Ra can be deduced in the case of the same material surfaces ground at the same manufacture conditions.