Results 211 to 220 of about 25,302 (256)
Some of the next articles are maybe not open access.

Normalized Cut Meets MRF

2016
We propose a new segmentation or clustering model that combines Markov Random Field (MRF) and Normalized Cut (NC) objectives. Both NC and MRF models are widely used in machine learning and computer vision, but they were not combined before due to significant differences in the corresponding optimization, e.g.
Meng Tang 0001   +3 more
openaire   +2 more sources

An MRF approach to unsupervised change detection

Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348), 2003
An approach to the automatic analysis of the difference image for change detection in multitemporal remote sensing images is proposed. This approach is based on a technique that exploits the expectation-maximization (EM) algorithm for the estimation of the density functions associated with both the changed and unchanged pixels in the difference image ...
Bruzzone, Lorenzo, D. Fernandez Prieto
openaire   +3 more sources

Discontinuities in MRFs

1995
Smoothness is a generic assumption underlying a wide range of physical phenomena. It characterizes the coherence and homogeneity of matter within a scope of space (or an interval of time). It is one of the most common assumptions in computer vision models, in particular, those formulated in terms of Markov random fields (MRFs) (Geman and Geman 1984 ...
openaire   +1 more source

A MRF approach to optical flow estimation

Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003
A Markov random field (MRF) formulation for the problem of optical flow computation is studied. An adaptive window matching scheme is used to obtain a good measure of the correlation between the two images. A confidence measure for each match is also used. Thus, the input to the system is the adaptive correlation and the corresponding confidence.
John A. Vlontzos, Davi Geiger
openaire   +2 more sources

Multilabel partition moves for MRF optimization

Image and Vision Computing, 2013
This paper presents new graph-cut based optimization algorithms for image processing problems. Populargraph-cut based algorithms give approximate solutions and are based on the concept of partition move. Themain contribution of this work consists in proposing novel partition moves called multilabel moves to minimizeMarkov random field (MRF) energies ...
Shabou, A., Darbon, J., Tupin, Florence
openaire   +2 more sources

High Level MRF Models

1995
High level vision tasks, such as object matching and recognition and pose estimation, are performed on features extracted from images. The arrangements of such features are usually irregular and hence the problems fall into categories LP3 and LP4. In this chapter, we present MAP-MRF formulations for solving these problems.
openaire   +1 more source

MRF parameter estimation by an accelerated method

Pattern Recognition Letters, 2003
Summary: Markov Random Field (MRF) modelling is a popular method for pattern recognition and computer vision and MRF parameter estimation is of particular importance to MRF modelling. In this paper, a new approach based on Metropolis-Hastings algorithm and gradient method is presented to estimate MRF parameters.
Yihua Yu, QianSheng Cheng
openaire   +2 more sources

Learning Higher Order Potentials for MRFs

2018 IEEE Winter Conference on Applications of Computer Vision (WACV), 2018
Higher order MRF-MAP formulation has been shown to improve solutions in many popular computer vision problems. Most of these approaches have considered hand tuned clique potentials only. Over the last few years, while there has been steady improvement in inference techniques making it possible to perform tractable inference for clique sizes even up to ...
Dinesh Khandelwal   +2 more
openaire   +2 more sources

MRF-Based Blind Image Deconvolution

2013
This paper proposes an optimization-based blind image deconvolution method. The proposed method relies on imposing a discrete MRF prior on the deconvolved image. The use of such a prior leads to a very efficient and powerful deconvolution algorithm that carefully combines advanced optimization techniques. We demonstrate the extreme effectiveness of our
Komodakis, Nikos, Paragios, Nikos
openaire   +2 more sources

Energy minimization for linear envelope MRFs

2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2010
Markov random fields with higher order potentials have emerged as a powerful model for several problems in computer vision. In order to facilitate their use, we propose a new representation for higher order potentials as upper and lower envelopes of linear functions.
Pushmeet Kohli, M. Pawan Kumar
openaire   +1 more source

Home - About - Disclaimer - Privacy