Welcome to Journal of University of Chinese Academy of Sciences,Today is

›› 2011, Vol. 28 ›› Issue (5): 630-635.DOI: 10.7523/j.issn.2095-6134.2011.5.010

• Research Articles • Previous Articles     Next Articles

A self-adaptive hierarchical belief propagation algorithm

CHI Ling-Hong, GUO Li, YU Li, CHEN Yun-Bi   

  1. Department of Electronic Science and Technology, USTC, Hefei 230027, China
  • Received:2010-07-20 Revised:2010-11-15 Online:2011-09-15

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 convergence detection methodology can be used in other HBP-related applications.

Key words: belief propagation, self-adaptive, stereo match, restoration

CLC Number: