Labeling irregular graphs with belief propagation

Authors:
Ifeoma Nwogu;Jason J. Corso
Affiliations:
State University of New York at Buffalo, Department of Computer Science and Engineering, Buffalo, NY;State University of New York at Buffalo, Department of Computer Science and Engineering, Buffalo, NY
Venue:
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Year:
2008

Citing 10
Cited 1

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning Low-Level Vision

International Journal of Computer Vision - Special issue on statistical and computational theories of vision: modeling, learning, sampling and computing, Part I
Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition

IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Scale-Invariant Contour Completion Using Conditional Random Fields

ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
Recovering human body configurations: combining segmentation and recognition

CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
Efficient graphical models for processing images

CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
Loopy belief propagation for approximate inference: an empirical study

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Multilevel segmentation and integrated bayesian model classification with an application to brain tumor segmentation

MICCAI'06 Proceedings of the 9th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part II
A comparative study of energy minimization methods for markov random fields

ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II

A new localized superpixel Markov random field for image segmentation

ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a statistical approach to labeling images using a more natural graphical structure than the pixel grid (or some uniform derivation of it such as square patches of pixels). Typically, low-level vision estimations based on graphical models work on the regular pixel lattice (with a known clique structure and neighborhood). We move away from this regular lattice to more meaningful statistics on which the graphical model, specifically the Markov network is defined. We create the irregular graph based on superpixels, which results in significantly fewer nodes and more natural neighborhood relationships between the nodes of the graph. Superpixels are a local, coherent grouping of pixels which preserves most of the structure necessary for segmentation. Their use reduces the complexity of the inferences made from the graphs with little or no loss of accuracy. Belief propagation (BP) is then used to efficiently find a local maximum of the posterior probability for this Markov network. We apply this statistical inference to finding (labeling) documents in a cluttered room (under moderately different lighting conditions).