arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1203.3512cs.AIcs.CV
收藏

基于图割的联想层次网络精确与近似推理

Exact and Approximate Inference in Associative Hierarchical Networks using Graph Cuts

Oxford Brookes University(牛津布鲁克斯大学);Microsoft Research Cambridge(微软研究院剑桥实验室)

Chris Russell, L'ubor Ladicky, Pushmeet Kohli, Philip H. S. Torr

摘要:

马尔可夫网络广泛应用于计算机视觉和机器学习。一个重要的子类是关联马尔可夫网络,用于各种各样的应用。对于这些网络,可以使用基于图切割的移动算法(例如α扩展)有效地找到良好的近似最小成本解决方案。最近提出了一个相关的模型,关联层次网络,它为高阶集团(即集团大小大于2)提供了关联马尔可夫网络的自然概括。该方法为计算机视觉中的目标类分割问题提供了一个很好的模型。在本文中,我们简要描述了关联层次网络,并提供了一个计算效率高的方法,基于图割近似推理。我们的方法对于包含数十万个变量的网络表现良好,并且在包含数万个变量的集团上定义了高阶势。由于这些问题的规模,标准的线性规划技术是不适用的。我们表明,我们的方法有一个边界为4的解决方案的一般联想层次网络与任意集团大小注意到少数结果存在的解决方案的标签马尔可夫网络与高阶集团。

英文摘要:

Markov Networks are widely used through out computer vision and machine learning. An important subclass are the Associative Markov Networks which are used in a wide variety of applications. For these networks a good approximate minimum cost solution can be found efficiently using graph cut based move making algorithms such as alpha-expansion. Recently a related model has been proposed, the associative hierarchical network, which provides a natural generalisation of the Associative Markov Network for higher order cliques (i.e. clique size greater than two). This method provides a good model for object class segmentation problem in computer vision. Within this paper we briefly describe the associative hierarchical network and provide a computationally efficient method for approximate inference based on graph cuts. Our method performs well for networks containing hundreds of thousand of variables, and higher order potentials are defined over cliques containing tens of thousands of variables. Due to the size of these problems standard linear programming techniques are inapplicable. We show that our method has a bound of 4 for the solution of general associative hierarchical network with arbitrary clique size noting that few results on bounds exist for the solution of labelling of Markov Networks with higher order cliques.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑