Image segmentation using adaptive loopy belief propagation

Loopy belief propagation (LBP) algorithm over pairwise-connected Markov random fields (MRFs) has become widely used for low-level vision problems. However, Pairwise MRF is often insufficient to capture the statistics of natural images well, and LBP is still extremely slow for application on an MRF with large discrete label space. To solve these problems, the present study proposes a new segmentation algorithm based on adaptive LBP. The proposed algorithm utilizes local region information to construct a local region model, as well as a local interaction region MRF model for image segmentation. The adaptive LBP algorithm maximizes the global probability of the proposed MRF model, which employs two very important strategies, namely, “message self-convergence” and “adaptive label pruning”. Message self-convergence can improve the reliability of a pixel in choosing a label in local region, and label pruning can dismiss impossible labels for every pixel. Thus, the most reliable information messages transfer through the LBP algorithm. The experimental results show that the proposed algorithm not only obtains more accurate segmentation results but also greater speed.