跳到主要导航 跳到搜索 跳到主要内容

MAP inference with MRF by graduated non-convexity and concavity procedure

  • Chinese Academy of Sciences

科研成果: 书/报告/会议事项章节会议稿件同行评审

8 引用 (Scopus)

摘要

In this paper we generalize the recently proposed graduated non-convexity and concavity procedure (GNCCP) to approximately solve the maximum a posteriori (MAP) inference problem with the Markov random field (MRF). Unlike the commonly used graph cuts or loopy brief propagation, the GNCCP based MAP algorithm is widely applicable to any types of graphical models with any types of potentials, and is very easy to use in practice. Our preliminary experimental comparisons witness its state-of-the-art performance.

源语言英语
主期刊名Neural Information Processing - 21st International Conference, ICONIP 2014, Proceedings
编辑Chu Kiong Loo, Keem Siah Yap, Kok Wai Wong, Andrew Teoh, Kaizhu Huang
出版商Springer Verlag
404-412
页数9
ISBN(电子版)9783319126395
DOI
出版状态已出版 - 2014
已对外发布
活动21st International Conference on Neural Information Processing, ICONIP 2014 - Kuching, 马来西亚
期限: 3 11月 20146 11月 2014

出版系列

姓名Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
8835
ISSN(印刷版)0302-9743
ISSN(电子版)1611-3349

会议

会议21st International Conference on Neural Information Processing, ICONIP 2014
国家/地区马来西亚
Kuching
时期3/11/146/11/14

学术指纹

探究 'MAP inference with MRF by graduated non-convexity and concavity procedure' 的科研主题。它们共同构成独一无二的指纹。

引用此