Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Efficient Estimation for Markov Random Fields

Not Accessible

Your library or personal account may give you access

Abstract

The problem of assigning labels from a fixed set to each member of a set of sites appears at all levels of computer vision. Recently, an optimization algorithm known as Highest Confidence First (HCF) [Chou, 1988] has been applied to labeling tasks in low-level vision. Examples of such tasks include edge detection, in which each inter-pixel site must be labeled as either edge or non-edge, and the integration of intensity and sparse depth data for the labeling of depth discontinuities and the generation of dense depth estimates. In these tasks, it often outperforms conventional optimization techniques such as simulated annealing[Geman and Geman, 1984], Monte Carlo sampling[Marroquin, 1985], and Iterative Conditional Modes (ICM) estimation[Besag, 1986].

© 1989 Optical Society of America

PDF Article
More Like This
Markov random fields as a priori information for image restoration

Chi-hsin Wu and Peter C. Doerschuk
RWC2 Signal Recovery and Synthesis (SRS) 1995

Integration of Biomechanical Properties in a Markov Random Field: Application to Myocardial Motion Estimation in Cardiomyopathy Patients

Lucilio Cordero-Grande, Marcos Martín-Fernández, and Carlos Alberola-López
QW2G.1 Quantitative Medical Imaging (QMI) 2013

Texture Segmentation Using Gaussian Markov Random Field Models

Shankar Chatterjee and Rama Chellappa
FB3 Machine Vision (MV) 1985

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.