30 June 1994 Hierarchical Markov random fields with stable points
Author Affiliations +
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.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Gregory M. Budzban, Gregory M. Budzban, Toney Stirewalt, Toney Stirewalt, "Hierarchical Markov random fields with stable points", Proc. SPIE 2304, Neural and Stochastic Methods in Image and Signal Processing III, (30 June 1994); doi: 10.1117/12.179218; https://doi.org/10.1117/12.179218


A region finding method to remove the noise from the...
Proceedings of SPIE (December 07 2015)
Geometric modeling for computer vision
Proceedings of SPIE (January 31 1992)
The location of laser beam cutting based on the computer...
Proceedings of SPIE (September 21 2011)

Back to Top