arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.5754cs.AIcs.CVmath.OC
收藏

基于树的马尔可夫随机场迭代局部搜索及其在图像分析中的应用

Tree-based iterated local search for Markov random fields with applications in image analysis

Deakin University(迪肯大学)

Truyen Tran, Dinh Phung, Svetha Venkatesh

摘要:

一般结构马尔可夫随机场(MRF)的\emph{maximum a posteriori}(MAP)分配在计算上是困难的.在本文中,我们利用基于树的方法来有效地解决这个问题。我们的新方法,命名为基于树的迭代局部搜索(T-ILS)利用了MRF中嵌入的树结构的易处理性,从而在ILS框架中获得强大的局部搜索。该方法有效地探索指数大的邻域,这样做与有限的内存没有任何要求的成本函数。我们评估的T-ILS在伊辛模型和两个现实世界中的问题,计算机视觉:立体匹配,图像去噪的模拟。实验结果表明,我们的方法是有竞争力的国家的最先进的竞争对手具有显着的计算增益。

英文摘要:

The \emph{maximum a posteriori} (MAP) assignment for general structure Markov random fields (MRFs) is computationally intractable. In this paper, we exploit tree-based methods to efficiently address this problem. Our novel method, named Tree-based Iterated Local Search (T-ILS) takes advantage of the tractability of tree-structures embedded within MRFs to derive strong local search in an ILS framework. The method efficiently explores exponentially large neighborhood and does so with limited memory without any requirement on the cost functions. We evaluate the T-ILS in a simulation of Ising model and two real-world problems in computer vision: stereo matching, image denoising. Experimental results demonstrate that our methods are competitive against state-of-the-art rivals with a significant computational gain.

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

↑