DPA: a deterministic approach to the MAP problem

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 1995Publisher:Institute of Electrical and Electronics Engineers (IEEE)Journal:IEEE Transactions on Image Processing, volume 4, pages 1,312-1,314 (issn: 1057-7149,

Copyright policy )

Authors: Marc Berthod; Zoltan Kato; Josiane Zerubia;

doi: 10.1109/83.413175

pmid: 18292026

DPA: a deterministic approach to the MAP problem

- Summary
- Metrics

Abstract

Deterministic 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.

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	6
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average