Share Email Print
cover

Proceedings Paper

Hierarchical Markov random fields with stable points
Author(s): Gregory M. Budzban; Toney Stirewalt
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Markov random field techniques for region labeling have become prevalent in image processing research since the seminal work of Geman and Geman in the early 1 980's. Their use in actual working systems, however, has been hampered by a number ofdifficult problems. Perhaps the most intractable of the problems has been the convergence rate of the algorithm. In this paper, we present a technique that introduces stable points in the labeling array of the random field. The stable points are determined by using a simple statistical pixel classifier together with a confidencemeasure at each pixel. The most confident (top 1% )pixellabels are selected and these labels are used to initiate the evolution of the random field. The stable points introduce pockets of "certainty" in the evolution of the process. The labeling is locally stable and even small numbers of stable points vastly decrease convergence rates of the algorithm.

Paper Details

Date Published: 30 June 1994
PDF: 6 pages
Proc. SPIE 2304, Neural and Stochastic Methods in Image and Signal Processing III, (30 June 1994); doi: 10.1117/12.179218
Show Author Affiliations
Gregory M. Budzban, Southern Illinois Univ. (United States)
Toney Stirewalt, Southern Illinois Univ. (United States)


Published in SPIE Proceedings Vol. 2304:
Neural and Stochastic Methods in Image and Signal Processing III
Su-Shing Chen, Editor(s)

© SPIE. Terms of Use
Back to Top