Formally, the decoding problem in fully connected pairwise CRFs can be formulated as follows: Note that for any edge (u, v), adding a constant ψ uv to all of its related patterns will not change the optimal solution of the problem.
the optimal Y for the following problem is irrelevant to The reparameterization keeps the optimality of the problem and plays an important role for graph representation, as we will show later.