We understood from the question that we need to compute the out going messages for each unobserved nodes, then use those messages to update in coming messages for unobserved neighbor nodes. When computing outgoing messages we need to find xi that maximizes [pairwise function * incoming messages]. How do we know what pixel maximizes the incoming messages? When computing outgoing nodes m_ij(xj), should we compute it for every possible value of xj? Alternatively, should we only compute one message for the current version of the pixel so that the maximization is independent on the incoming messages?

Thanks

Maximization of incoming messages