平面图中两两马氏随机场上MAP配置的PTAS
PTAS for MAP Assignment on Pairwise Markov Random Fields in Planar Graphs
摘要:
本文提出了一个计算平面图中非负权的两两马尔可夫随机场上最大后验分配的PTAS。该算法是实用的,并不远远落后于图像处理的最新技术。MAP在成对马尔可夫随机场(可能)负权重不能近似,除非P = NP,即使在平面图。我们还表明,通过减少,这产生了PTAS的相关聚类在平面图中的一个评分函数。
英文摘要:
We present a PTAS for computing the maximum a posteriori assignment on Pairwise Markov Random Fields with non-negative weights in planar graphs. This algorithm is practical and not far behind state-of-the-art techniques in image processing. MAP on Pairwise Markov Random Fields with (possibly) negative weights cannot be approximated unless P = NP, even on planar graphs. We also show via reduction that this yields a PTAS for one scoring function of Correlation Clustering in planar graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。