title: Strong Markov random field model.
abstract: The strong Markov random field (strong-MRF) model is a submodel of the more general MRF-Gibbs model. The strong-MRF model defines a system whose field is Markovian with respect to a defined neighborhood, and all subneighborhoods are also Markovian. A checkerboard pattern is a perfect example of a strong Markovian system. Although the strong Markovian system requires a more stringent assumption about the field, it does have some very nice mathematical properties. One mathematical property is the ability to define the strong-MRF model with respect to its marginal distributions over the cliques. Also, a direct equivalence to the Analysis-of-Variance (ANOVA) log-linear construction can be proven. From this proof, the general ANOVA log-linear construction formula is acquired.
authors.affiliation: Computer Vision Group, Gloriastrasse 35, ETH-Zentrum, CH-8092 Zurich, Switzerland. rpaget@vision.ee.ethz.ch
authors.forename: Rupert
authors.initials: R
authors.lastname: Paget
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D003196:Computer Graphics; D007089:Image Enhancement / Q000379:methods; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D016247:Information Storage and Retrieval / Q000379:methods; D008390:Markov Chains; D015233:Models, Statistical; D009716:Numerical Analysis, Computer-Assisted; D010363:Pattern Recognition, Automated; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity; D012815:Signal Processing, Computer-Assisted; D013382:Subtraction Technique