Approximations and bounds for binary Markov random fields

We develop an easy to compute second order interaction removal approximation for pseudo-Boolean functions and use this to define a new approximation and upper and lower bounds for the normalising constant of binary Markov random fields (MRFs). As a by-product of the approximation procedure we obtain also a partially ordered Markov model (POMM) approximation of the MRF.