Consider a variant on the segmentation application (Figure XXXXXXXXXXin which we update all of the contour positions at once. The graphical model for this problem is a loop (i.e., a chain where there...

Consider a variant on the segmentation application (Figure 11.21) in which we update all of the contour positions at once. The graphical model for this problem is a loop (i.e., a chain where

<sup>there is also a edge between



w</sup>



N


<sup>and



w</sup>


1

<sup>). Devise an approach to finding the exact MAP




solution</sup>



in this model. If there are

N

variables each of which can take

K

values, what is the complexity of your algorithm?