| 一种采用自适应机制的分层置信传播算法 |
| |
| 引用本文： | 池凌鸿,郭立,郁理,陈运必.一种采用自适应机制的分层置信传播算法[J].中国科学院研究生院学报,2011,28(5). |
| |
| 作者姓名： | 池凌鸿 郭立 郁理 陈运必 |
| |
| 作者单位： | 中国科学技术大学电子科学与技术系,合肥,230027 |
| |
| 基金项目： | 国家自然科学基金(61071173)资助 |
| |
| 摘 要： | 提出了一种基于迭代自适应机制的改进算法,有效地缩减了分层置信传播算法(HBP)的计算时间.传统HBP计算时间随指定的迭代上限增加而线性增长.为此引入消息收敛的条件判断,在迭代上限相同情况下,减少算法的迭代次数,缩减整体迭代时间.实验表明,与传统HBP相比,该方法计算时间缩减了38％以上,计算时间对整体迭代上限不敏感.该方法可以应用于使用HBP算法的其他方法.
|
| 关 键 词： | 置信传播 自适应 立体匹配 图像修复 |
A self-adaptive hierarchical belief propagation algorithm |
| |
| CHI Ling-Hong,GUO Li,YU Li,CHEN Yun-Bi.A self-adaptive hierarchical belief propagation algorithm[J].Journal of the Graduate School of the Chinese Academy of Sciences,2011,28(5). |
| |
| Authors: | CHI Ling-Hong GUO Li YU Li CHEN Yun-Bi |
| |
| Institution: | CHI Ling-Hong,GUO Li,YU Li,CHEN Yun-Bi(Department of Electronic Science and Technology,USTC,Hefei 230027,China) |
| |
| Abstract: | We propose a self-adaptive algorithm with convergence detection to reduce the computational complexity of HBP.In the conventional HBP,the computational complexity linearly increases with specified iteration upper bound.We introduce convergence detection to stop the iteration of messages which have already converged to optimal values.Experimental results show that the self-adaptive algorithm reduces computational time by 38% or more,and the computational time is insensitive to iteration upper bound.The conve... |
| |
| Keywords: | belief propagation self-adaptive stereo match restoration |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
