Results 21 to 30 of about 157,133 (176)
Robust max-product belief propagation [PDF]
We study the problem of optimizing a graph-structured objective function under \emph{adversarial} uncertainty. This problem can be modeled as a two-persons zero-sum game between an Engineer and Nature. The Engineer controls a subset of the variables (nodes in the graph), and tries to assign their values to maximize an objective function.
Ibrahimi, Morteza +3 more
openaire +2 more sources
Improved CRC aided BP decoding for polar codes
In this letter, a modified message passing algorithm to prevent short cycles in the factor graph is proposed and combined with a relaxation technique to improve the performance of cyclic redundancy check aided belief propagation decoding for polar codes.
Sungkwon Hong, Jong‐Moon Chung
doaj +1 more source
Palette-colouring: a belief-propagation approach [PDF]
We consider a variation of the prototype combinatorial-optimisation problem known as graph-colouring. Our optimisation goal is to colour the vertices of a graph with a fixed number of colours, in a way to maximise the number of different colours present ...
Alessandro Pelizzola +15 more
core +2 more sources
Belief Propagation Bit-Flip Decoder for Polar Codes
The bit-flip method has been successfully applied to the successive cancellation (SC) decoder to improve the block error rate (BLER) performance for polar codes in the finite code length region.
Yongrun Yu +3 more
doaj +1 more source
Belief Propagation With Permutated Graphs of Polar Codes
The belief propagation (BP) decoding of polar codes provides better bit error rate (BER) and packet error rate (PER) performance than the successive cancelation (SC) decoding.
Liping Li, Liangliang Liu
doaj +1 more source
Local stability of Belief Propagation algorithm with multiple fixed points [PDF]
A number of problems in statistical physics and computer science can be expressed as the computation of marginal probabilities over a Markov random field.
Furtlehner, Cyril +2 more
core +4 more sources
A Low Density Lattice Decoder via Non-Parametric Belief Propagation [PDF]
The recent work of Sommer, Feder and Shalvi presented a new family of codes called low density lattice codes (LDLC) that can be decoded efficiently and approach the capacity of the AWGN channel. A linear time iterative decoding scheme which is based on a
Alexander T. Ihler +3 more
core +2 more sources
Homography-guided stereo matching for wide-baseline image interpolation
Image interpolation has a wide range of applications such as frame rate-up conversion and free viewpoint TV. Despite significant progresses, it remains an open challenge especially for image pairs with large displacements. In this paper, we first propose
Yuan Chang +3 more
doaj +1 more source
Cycle-based Cluster Variational Method for Direct and Inverse Inference [PDF]
We elaborate on the idea that loop corrections to belief propagation could be dealt with in a systematic way on pairwise Markov random fields, by using the elements of a cycle basis to define region in a generalized belief propagation setting. The region
A Decelle +42 more
core +5 more sources
Low Complexity Early Stopping Belief Propagation Decoder for Polar Codes
Belief propagation is one of low latency decoding algorithms for polar codes but it requires relatively high decoding complexity due to its inherent iterative decoding nature.
Chungsu Lee +3 more
doaj +1 more source

