Factorial Markov Random Fields

Authors:
Junhwan Kim;Ramin Zabih
Affiliations:
-;-
Venue:
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Year:
2002

Citing 7
Cited 5

Markov random field modeling in computer vision

Markov random field modeling in computer vision
An introduction to variational methods for graphical models

Learning in graphical models
Image inpainting

Proceedings of the 27th annual conference on Computer graphics and interactive techniques
An Integrated Bayesian Approach to Layer Extraction from Image Sequences

IEEE Transactions on Pattern Analysis and Machine Intelligence
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision

EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Smoothness in Layers: Motion segmentation using nonparametric mixture estimation.

CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Layered representation of motion video using robust maximum-likelihood estimation of mixture models and MDL encoding

ICCV '95 Proceedings of the Fifth International Conference on Computer Vision

State of the art on automatic road extraction for GIS update: a novel classification

Pattern Recognition Letters
Dynamic Conditional Random Fields: Factorized Probabilistic Models for Labeling and Segmenting Sequence Data

The Journal of Machine Learning Research
Bayesian Defogging

International Journal of Computer Vision
The scale of geometric texture

ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
Shape and reflectance from natural illumination

ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose an extension to the standard Markov Random Field (MRF) model in order to handle layers. Our extension, which we call a Factorial MRF (FMRF), is analogous to the extension from Hidden Markov Models (HMM's) to Factorial HMM's. We present an efficient EM-based algorithm for inference on Factorial MRF's. Our algorithm makes use of the fact that layers are a priori independent, and that layers only interact through the observable image. The algorithm iterates between wide inference, i.e., inference within each layer for the entire set of pixels, and deep inference, i.e., inference through the layers for each single pixel. The efficiency of our method is partly due to the use of graph cuts for binary segmentation, which is part of the wide inference step. We show experimental results for both real and synthetic images.