Loopy belief propagation (BP) has been successfully used in a number of difficult graphical models to find the most probable configuration of the hidden variables. In applications ranging from protein folding to image analysis one would like to find not just the best configuration but rather the top M . While this problem has been solved using the junction tree formalism, in many real world pro...

We propose a context guided belief propagation (BP) algorithm to perform high spatial resolution multispectral imagery (HSRMI) classification efficiently utilizing superpixel representation. One important characteristic of HSRMI is that different land cover objects possess a similar spectral property. This property is exploited to speed up the standard BP (SBP) in the classification process. Sp...

Binocular Stereo is the process of estimating three-dimensional shape (stereo) from two eyes (binocular) or two cameras. Usually it is just called stereo. It requires knowing the camera parameters (e.g., focal length, direction of gaze), as discussed in earlier lecture, and solving the correspondence problem – matching pixels between the left and right images. After correspondence has been solv...

Since the discovery that the best error-correcting decoding algorithm can be viewed as belief propagation in a cycle-bound graph, researchers have been trying to determine under what circumstances "loopy belief propagation" is effective for probabilistic inference. Despite several theoretical advances in our understanding of loopy belief propagation, to our knowledge, the only problem that has ...

We present a simultaneous localization and mapping (SLAM) algorithm that is based on radio signals and the association of specular multipath components (MPCs) with geometric features. Especially in indoor scenarios, localization from radio signals is challenging due to diffuse multipath propagation and the unknown MPC-feature association. In our approach, specular reflections at flat surfaces (...

Polar codes have become the channel coding scheme for control of enhanced mobile broadband in 5G communication systems. Belief propagation (BP) decoding polar has advantages low latency and high parallelism but achieves worse bit error ratio (BER) performance compared with successive cancellation list (SCL) scheme. In this paper, an improved BP (IBPL) algorithm is proposed comparable BER to SCL...

Finding the most probable assignment (MAP) in a general graphical model is known to be NP hard but good approximations have been attained with max-product belief propagation (BP) and its variants. In particular, it is known that using BP on a single-cycle graph or tree reweighted BP on an arbitrary graph will give the MAP solution if the beliefs have no ties. In this paper we extend the setting...

In this letter, a deep neural network (DNN) aided joint source-channel (JSCC) decoding scheme is proposed for polar codes. the scheme, an integrated factor graph with unfolded structure first designed. Then DNN flooding belief propagation (FBP) algorithm based on factor, in which both source and channel scaling parameters BP are optimized better performance. Experimental results show that, FBP ...