A Belief Propagation Algorithm for Multipath-Based SLAM with Multiple Map Features: A mmWave MIMO Application
0
Citation
21
Reference
10
Related Paper
Keywords:
Belief Propagation
No abstract available.
Cite
Citations (2)
This paper presents a novel belief propagation (BP) based decoding algorithm for polar codes. The proposed algorithm facilitates belief propagation by utilizing the specific constituent codes that exist in the factor graph, which results in an express journey (XJ) for belief information to propagate in each decoding iteration. In addition, this XJ-BP decoder employs a novel round-trip message passing scheduling method for the increased efficiency. The proposed method simplifies min-sum (MS) BP decoder by 40.6%. Along with the round-trip scheduling, the XJ-BP algorithm reduces the computational complexity of MS BP decoding by 90.4%; this enables an energy-efficient hardware implementation of BP decoding in practice.
Belief Propagation
Factor graph
List decoding
Berlekamp–Welch algorithm
Cite
Citations (41)
In Non - ergodic belief networks the posterior belief OF many queries given evidence may become zero.The paper shows that WHEN belief propagation IS applied iteratively OVER arbitrary networks(the so called, iterative OR loopy belief propagation(IBP)) it IS identical TO an arc - consistency algorithm relative TO zero - belief queries(namely assessing zero posterior probabilities). This implies that zero - belief conclusions derived BY belief propagation converge AND are sound.More importantly it suggests that the inference power OF IBP IS AS strong AND AS weak, AS that OF arc - consistency.This allows the synthesis OF belief networks FOR which belief propagation IS useless ON one hand, AND focuses the investigation OF classes OF belief network FOR which belief propagation may be zero - complete.Finally, ALL the above conclusions apply also TO Generalized belief propagation algorithms that extend loopy belief propagation AND allow a crisper understanding OF their power.
Belief Propagation
Zero (linguistics)
Belief Revision
Cite
Citations (0)
Multipath effect is an important factor that affects capability of TTC system at low elevation angles.The principle of multipath effect and the mathematical model of multipath fading are introduced in this paper.While electromagnetic wave travels between transmitting and receiving antennas,it has one direct path and several reflective paths.It will produce multipath fading when reflective signal counterbalances direct signal.Based on the mathematical model,the conditions in which the multipath fading appears and the influences of multipath fading on TTC system are analyzed in this paper.The position where multipath fading appears depends on the altitudes of the both antennas and the distance between them.The intensity of multipath fading depends on the reflectance of surface.Some methods are summarized to avoid and overcome multipath fading.
Fading distribution
Rake receiver
Cite
Citations (2)
Belief propagation (BP), also called “sum-product algorithm”, is one of the best-known graphical model for inference in statistical physics, artificial intelligence, computer vision, etc. Furthermore, a recent research in distributed sensor network localization showed us that BP is an efficient way to obtain sensor location as well as appropriate uncertainty. However, BP convergence is not guaranteed in a network with loops. In this paper, we propose localization using generalized belief propagation based on junction tree (GBPJT) method. We illustrate it in a network with loop where BP shows poor performance. In fact, we compared estimated locations with Nonparametric Belief Propagation (NBP) algorithm. According to our simulation results, GBP-JT resolved the problems with loops, but the price for this is unacceptable large computational cost. The main conclusion is that this algorithm could be used with some approximation which keeps improved accuracy and significantly decreases the computational cost.
Belief Propagation
Graphical model
Approximate inference
Backpropagation
Propagation of uncertainty
Cite
Citations (6)
In Non - ergodic belief networks the posterior belief OF many queries given evidence may become zero.The paper shows that WHEN belief propagation IS applied iteratively OVER arbitrary networks(the so called, iterative OR loopy belief propagation(IBP)) it IS identical TO an arc - consistency algorithm relative TO zero - belief queries(namely assessing zero posterior probabilities). This implies that zero - belief conclusions derived BY belief propagation converge AND are sound.More importantly it suggests that the inference power OF IBP IS AS strong AND AS weak, AS that OF arc - consistency.This allows the synthesis OF belief networks FOR which belief propagation IS useless ON one hand, AND focuses the investigation OF classes OF belief network FOR which belief propagation may be zero - complete.Finally, ALL the above conclusions apply also TO Generalized belief propagation algorithms that extend loopy belief propagation AND allow a crisper understanding OF their power.
Belief Propagation
Zero (linguistics)
Belief Revision
Cite
Citations (21)
article Free Access Share on Remarks on Algorithm 332: Jacobi polynomials: Algorithm 344: student's t-distribution: Algorithm 351: modified Romberg quadrature: Algorithm 359: factoral analysis of variance Author: Arthur H. J. Sale Univ. of Sydney, Sydney, Australia Univ. of Sydney, Sydney, AustraliaView Profile Authors Info & Claims Communications of the ACMVolume 13Issue 7July 1970 https://doi.org/10.1145/362686.362700Published:01 July 1970Publication History 0citation275DownloadsMetricsTotal Citations0Total Downloads275Last 12 Months10Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Quadrature (astronomy)
Cite
Citations (0)
This paper presents a novel propagation (BP) based decoding algorithm for polar codes. The proposed algorithm facilitates belief propagation by utilizing the specific constituent codes that exist in the factor graph, which results in an express journey (XJ) for belief information to propagate in each decoding iteration. In addition, this XJ-BP decoder employs a novel round-trip message passing scheduling method for the increased efficiency. The proposed method simplifies min-sum (MS) BP decoder by 40.6%. Along with the round-trip scheduling, the XJ-BP algorithm reduces the computational complexity of MS BP decoding by 90.4%; this enables an energy-efficient hardware implementation of BP decoding in practice.
Belief Propagation
Factor graph
Berlekamp–Welch algorithm
List decoding
Cite
Citations (2)
In the Markov network which models disparity map with the Markov Random Field(MRF), the belief propagation algorithm is operated by message passing between nodes corresponding to each pixels. Belief propagation algorithm required much iteration for accurate result. In this paper, we propose the stereo matching algorithm using belief propagation in multi-resolution domain. Multi-resolution method based on wavelet or lifting can reduce the search area, therefore this algorithm can generate disparity map with fast speed.
Belief Propagation
Markov random field
Cite
Citations (0)
Belief Propagation
Cite
Citations (0)