01101nas a2200169 4500008004100000020001400041245005300055210005200108260001200160300001600172490000600188520058900194100001800783700001700801700002100818856009200839 1995 eng d a1057-714900aDPA: a deterministic approach to the MAP problem0 aDPA a deterministic approach to the MAP problem c1995/// a1312 - 13140 v43 aDeterministic pseudo-annealing (DPA) is a new deterministic optimization method for finding the maximum a posteriori (MAP) labeling in a Markov random field, in which the probability of a tentative labeling is extended to a merit function on continuous labelings. This function is made convex by changing its definition domain. This unambiguous maximization problem is solved, and the solution is followed down to the original domain, yielding a good, if suboptimal, solution to the original labeling assignment problem. The performance of DPA is analyzed on randomly weighted graphs.1 aBerthod, Marc1 aKato, Zoltan1 aZerubia, Josiane uhttps://www.inf.u-szeged.hu/publication/dpa-a-deterministic-approach-to-the-map-problem