Hardware-efficient belief propagation

• Published in: 2009 IEEE Conference on Computer Vision and Pattern Recognition pp. 80 - 87
• Main Authors: Chia-Kai Liang, Chao-Chung Cheng, Yen-Chieh Lai, Liang-Gee Chen, Chen, Homer H
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.06.2009
• Subjects: Bandwidth; Belief propagation; Computer vision; Iterative algorithms; Markov random fields; Message passing; Minimization methods; Robustness; Tiles; Very large scale integration
• ISBN: 1424439922; 9781424439928
• ISSN: 1063-6919; 1063-6919
• DOI: 10.1109/CVPR.2009.5206819

Belief propagation (BP) is an effective algorithm for solving energy minimization problems in computer vision. However, it requires enormous memory, bandwidth, and computation because messages are iteratively passed between nodes in the Markov random field (MRF). In this paper, we propose two methods to address this problem. The first method is a message passing scheme called tile-based belief propagation. The key idea of this method is that a message can be well approximated from other faraway ones. We split the MRF into many tiles and perform BP within each one. To preserve the global optimality, we store the outgoing boundary messages of a tile and use them when performing BP in the neighboring tiles. The tile-based BP only requires 1-5% memory and 0.2-1% bandwidth of the ordinary BP. The second method is an O(L) message construction algorithm for the robust functions commonly used for describing the smoothness terms in the energy function. We find that many variables in constructing a message are repetitive; thus these variables can be calculated once and reused many times. The proposed algorithms are suitable for parallel implementations. We design a low-power VLSI circuit for disparity estimation that can construct 440 M messages per second and generate high quality disparity maps in near real-time. We also implement the proposed algorithms on a GPU, which can calculate messages 4 times faster than the sequential O(L) method.