Describes a family of approximations, denoted "cluster approximations", for the computation of the mean of a Markov random field (MRF). This is a key computation in image processing when applied to the a posteriori MRF. The approximation is a form of mean field theory and accounts exactly for only spatially local interactions. The implementation of the approximation requires the solution of a nonlinear multivariable fixed-point equation. Unlike many forms of mean field theory, the approximation is easy to apply even to nonquadratic Hamiltonians (e.g., it requires no analytical calculations), the structure of the gray level values in the original problem is retained, the resulting approximate mean field can be proven to lie in the same set which contains the true mean of the MRF, and there are existence, uniqueness, and convergence-of-algorithm results for the fixed-point equation. Two numerical examples are presented which emphasize nonlinear observation processes.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Computation of Bayesian estimators for Markov random field image models using the cluster approximation


    Contributors:


    Publication date :

    1994-01-01


    Size :

    616203 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Computation of Bayesian Estimators for Markov Random Field Image Models Using the Cluster Approximation

    Wu, C.-H. / Doerschuk, P. C. / IEEE; Signal Processing Society | British Library Conference Proceedings | 1994



    Bayesian image classification using Markov random fields

    Berthod, M. / Kato, Z. / Yu, S. et al. | British Library Online Contents | 1996



    Robust and efficient image segmentation approaches using Markov random field models

    Nasab, N. M. / Analoui, M. / Deip, E. J. | British Library Online Contents | 2003