scholarly journals Simultaneous Representation and Separation for Multiple Interference Allied with Approximation Message Passing

2021 ◽  
Author(s):  
Guisheng Wang
Keyword(s):  
Message Passing ◽  
Belief Propagation ◽  
Principal Component ◽  
Sparse Learning ◽  
Transform Domain ◽  
Separation Algorithm ◽  
Cognitive Transformation ◽  
Iterative Shrinkage ◽  
Simultaneous Representation ◽  
Multiple Interference

<p>Broadband reliable communication is a competitive 5G technology for cognitive communication scenarios, but meanwhile introduces multiform interference to existing broadband transform domain communication system (TDCS) transmission. In order to facilitate the improvement of the anti-jamming performance for the coexistence of diverse interference and TDCS signals in wireless heterogeneous networks, it is important to separated and eliminate various interference to TDCS systems. In this paper, a novel sparse learning method-based cognitive transformation framework of interference separation is formulated for accurate interference recovery, which can be efficiently solved by iteratively learning the prior sparse probability distribution of the interference support. To further improve the separation accuracy and iterative convergence, the principal component analysis and Bayesian perspective in orthogonal base learning are exploited to singly recover the multiple interference and TDCS signals. Moreover, utilizing different sparsity states of spectrum analysis, the proposed novel interference separation algorithm is extended to simultaneous separation based on state evolving of approximation message passing, which iteratively learns the belief propagation posteriors and keeps shrunk by iterative shrinkage threshold. Simulation results demonstrate that the proposed methods are effective in separating and recovering the sparse diversities of interference to TDCS systems, and significantly outperform the state-of-the-art methods.</p>

scholarly journals Simultaneous Representation and Separation for Multiple Interference Allied with Approximation Message Passing

2021 ◽  
Author(s):  
Guisheng Wang
Keyword(s):  
Message Passing ◽  
Belief Propagation ◽  
Principal Component ◽  
Sparse Learning ◽  
Transform Domain ◽  
Separation Algorithm ◽  
Cognitive Transformation ◽  
Iterative Shrinkage ◽  
Simultaneous Representation ◽  
Multiple Interference

<p>Broadband reliable communication is a competitive 5G technology for cognitive communication scenarios, but meanwhile introduces multiform interference to existing broadband transform domain communication system (TDCS) transmission. In order to facilitate the improvement of the anti-jamming performance for the coexistence of diverse interference and TDCS signals in wireless heterogeneous networks, it is important to separated and eliminate various interference to TDCS systems. In this paper, a novel sparse learning method-based cognitive transformation framework of interference separation is formulated for accurate interference recovery, which can be efficiently solved by iteratively learning the prior sparse probability distribution of the interference support. To further improve the separation accuracy and iterative convergence, the principal component analysis and Bayesian perspective in orthogonal base learning are exploited to singly recover the multiple interference and TDCS signals. Moreover, utilizing different sparsity states of spectrum analysis, the proposed novel interference separation algorithm is extended to simultaneous separation based on state evolving of approximation message passing, which iteratively learns the belief propagation posteriors and keeps shrunk by iterative shrinkage threshold. Simulation results demonstrate that the proposed methods are effective in separating and recovering the sparse diversities of interference to TDCS systems, and significantly outperform the state-of-the-art methods.</p>

scholarly journals Cooperative Localization for Mobile Networks: A Distributed Belief Propagation–Mean Field Message Passing Algorithm

2016 ◽  
Vol 23 (6) ◽  
pp. 828-832 ◽  
Author(s):  
Burak Cakmak ◽  
Daniel N. Urup ◽  
Florian Meyer ◽  
Troels Pedersen ◽  
Bernard H. Fleury ◽  
...  
Keyword(s):  
Mobile Networks ◽  
Message Passing ◽  
Belief Propagation ◽  
Mean Field ◽  
Cooperative Localization ◽  
Message Passing Algorithm

scholarly journals Constraint Satisfaction by Survey Propagation

2005 ◽  
Author(s):  
Alfredo Braunstein ◽  
Marc Mézard
Keyword(s):  
Constraint Satisfaction ◽  
Message Passing ◽  
Statistical Physics ◽  
Belief Propagation ◽  
Solution Space ◽  
Error Correcting Codes ◽  
Constraint Satisfaction Problems ◽  
Probabilistic Methods ◽  
Survey Propagation ◽  
Algorithmic Strategy

Methods and analyses from statistical physics are of use not only in studying the performance of algorithms, but also in developing efficient algorithms. Here, we consider survey propagation (SP), a new approach for solving typical instances of random constraint satisfaction problems. SP has proven successful in solving random k-satisfiability (k -SAT) and random graph q-coloring (q-COL) in the “hard SAT” region of parameter space [79, 395, 397, 412], relatively close to the SAT/UNSAT phase transition discussed in the previous chapter. In this chapter we discuss the SP equations, and suggest a theoretical framework for the method [429] that applies to a wide class of discrete constraint satisfaction problems. We propose a way of deriving the equations that sheds light on the capabilities of the algorithm, and illustrates the differences with other well-known iterative probabilistic methods. Our approach takes into account the clustered structure of the solution space described in chapter 3, and involves adding an additional “joker” value that variables can be assigned. Within clusters, a variable can be frozen to some value, meaning that the variable always takes the same value for all solutions (satisfying assignments) within the cluster. Alternatively, it can be unfrozen, meaning that it fluctuates from solution to solution within the cluster. As we will discuss, the SP equations manage to describe the fluctuations by assigning joker values to unfrozen variables. The overall algorithmic strategy is iterative and decomposable in two elementary steps. The first step is to evaluate the marginal probabilities of frozen variables using the SP message-passing procedure. The second step, or decimation step, is to use this information to fix the values of some variables and simplify the problem. The notion of message passing will be illustrated throughout the chapter by comparing it with a simpler procedure known as belief propagation (mentioned in ch. 3 in the context of error correcting codes) in which no assumptions are made about the structure of the solution space. The chapter is organized as follows. In section 2 we provide the general formalism, defining constraint satisfaction problems as well as the key concepts of factor graphs and cavities, using the concrete examples of satisfiability and graph coloring.

scholarly journals Analysis of TDMP Algorithm of LDPC Codes Based on Density Evolution and Gaussian Approximation

Entropy ◽  
2019 ◽  
Vol 21 (5) ◽  
pp. 457 ◽  
Author(s):  
Xiumin Wang ◽  
Hong Chang ◽  
Jun Li ◽  
Weilin Cao ◽  
Liang Shan
Keyword(s):  
Message Passing ◽  
Belief Propagation ◽  
Gaussian Approximation ◽  
Bp Algorithm ◽  
Turbo Decoding ◽  
Density Evolution ◽  
Analysis Process ◽  
Evolution Analysis ◽  
Simplified Algorithm ◽  
Previous Iteration

Based on density evolution analysis of the existing belief propagation (BP) algorithm, the Turbo Decoding Message Passing (TDMP) algorithm was analyzed from the perspective of density evolution and Gaussian approximation, and the theoretical analysis process of TDMP algorithm was given. When calculating the prior message of each layer of the TDMP algorithm, the check message of the previous iteration should be subtracted. Therefore, the result will not be convergent, if the TDMP algorithm is directly analyzed based on density evolution and Gaussian approximation. We researched the TDMP algorithm based on the symmetry conditions to obtain the convergent result. When using density evolution (DE) and Gaussian approximation to analyze the decoding convergence of the TDMP algorithm, we can provide a theoretical basis for proving the superiority of the algorithm. Then, based on the DE theory, we calculated the probability density function (PDF) of the check-to-variable information of TDMP and its simplified algorithm, and then gave it a calculation based on the process of the normalization factor. Simulation results show that the decoding convergence speed of the TDMP algorithm was faster and the iterations were smaller compared to the BP algorithm under the same conditions.

Efficient nonparametric belief propagation for pose estimation and manipulation of articulated objects

2019 ◽  
Vol 4 (30) ◽  
pp. eaaw4523 ◽  
Author(s):  
Karthik Desingh ◽  
Shiyang Lu ◽  
Anthony Opipari ◽  
Odest Chadwicke Jenkins
Keyword(s):  
Pose Estimation ◽  
Message Passing ◽  
Belief Propagation ◽  
Sensor Data ◽  
Depth Sensor ◽  
Continuous Space ◽  
Articulated Objects ◽  
Message Passing Algorithm ◽  
Wide Range ◽  
Object Part

Robots working in human environments often encounter a wide range of articulated objects, such as tools, cabinets, and other jointed objects. Such articulated objects can take an infinite number of possible poses, as a point in a potentially high-dimensional continuous space. A robot must perceive this continuous pose to manipulate the object to a desired pose. This problem of perception and manipulation of articulated objects remains a challenge due to its high dimensionality and multimodal uncertainty. Here, we describe a factored approach to estimate the poses of articulated objects using an efficient approach to nonparametric belief propagation. We consider inputs as geometrical models with articulation constraints and observed RGBD (red, green, blue, and depth) sensor data. The described framework produces object-part pose beliefs iteratively. The problem is formulated as a pairwise Markov random field (MRF), where each hidden node (continuous pose variable) is an observed object-part’s pose and the edges denote the articulation constraints between the parts. We describe articulated pose estimation by a “pull” message passing algorithm for nonparametric belief propagation (PMPNBP) and evaluate its convergence properties over scenes with articulated objects. Robot experiments are provided to demonstrate the necessity of maintaining beliefs to perform goal-driven manipulation tasks.

A Simulation of Temporally Variant Agent Interaction via Belief Promulgation

2012 ◽  
pp. 913-927
Author(s):  
Adam J. Conover
Keyword(s):  
Message Passing ◽  
Belief Propagation ◽  
Autonomous Agent ◽  
Emergent Properties ◽  
Agent Behavior ◽  
Temporal Variance ◽  
Agent Interaction ◽  
Multi Agent ◽  
Asynchronous Environments ◽  
Global Population

This chapter concludes a two part series which examines the emergent properties of multi-agent communication in “temporally asynchronous” environments. Many traditional agent and swarm simulation environments divide time into discrete “ticks” where all entity behavior is synchronized to a master “world clock”. In other words, all agent behavior is governed by a single timer where all agents act and interact within deterministic time intervals. This discrete timing mechanism produces a somewhat restricted and artificial model of autonomous agent interaction. In addition to the behavioral autonomy normally associated with agents, simulated agents should also have “temporal autonomy” in order to interact realistically. This chapter focuses on the exploration of a grid of specially embedded, message-passing agents, where each message represents the communication of a core “belief”. Here, we focus our attention on the how the temporal variance of belief propagation from individual agents induces emergent and dynamic effects on a global population.

Sign in / Sign up

Export Citation Format

Share Document