Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 11 of 11 for “"Belief Propagation (BP)"”.

  1. Distributed belief propagation and its generalizations for location-aware networks

    This thesis investigates the use of generalized belief propagation (GBP) and belief propagation (BP) algorithms for distributed inference. The concept of a network region graph is introduced, along with several approximation structures that can be distributed across a network. In this formulation, …

    mit Repository record for Distributed belief propagation and its generalizations for location-aware networks (opens in a new tab)

  2. Compressive sensing based imaging via belief propagation

    … passing decoding algorithm commonly known as Belief Propagation (BP). The CS technique can accurately recover any compressible or sparse signal from a lesser number of non-adaptive, randomized linear projection samples than that specified by the Nyquist rate. In this work, we demonstrate how …

    utc Repository record for Compressive sensing based imaging via belief propagation (opens in a new tab)

  3. Graphical models for visual object recognition and tracking

    … first develop a nonparametric extension of the belief propagation (BP) algorithm. Using Monte Carlo methods, we provide general procedures for recursively updating particle-based approximations of continuous sufficient statistics. Efficient multiscale sampling methods then allow this …

    mit Repository record for Graphical models for visual object recognition and tracking (opens in a new tab)

  4. Lossless Coding of Markov Random Fields with Complex Cliques

    … method, arithmetic coding is possible via the Belief Propagation (BP) algorithm. We consider two cases of the BP algorithm: MRFs with only simple cliques, and MRFs with complex cliques. In the latter case, we study a minimum radius condition requirement for ensuring that all cliques are …

    queens Repository record for Lossless Coding of Markov Random Fields with Complex Cliques (opens in a new tab)

  5. Statistical Methods for Cooperative and Distributed Inference in Wireless Networks

    … methods – namely, random matrix theory (RMT) and belief propagation (BP) – in distributed inference problems in wireless communication networks. The term “distributed inference” denotes, in general, detection/estimation involving multiple network nodes (“sensors”) that collect physical …

    poli-torino Repository record for Statistical Methods for Cooperative and Distributed Inference in Wireless Networks (opens in a new tab)

  6. Super-resolution image reconstruction from low-resolution images

    … of Scale Invariant Feature Transform (SIFT), Belief Propagation (BP) and Random Sampling Consensus (RANSAC) is described to automatically register the low-resolution images. The results have shown effective for the removal of the mismatched features in the image. A novel SVD-based image fusion …

    strathclyde Repository record for Super-resolution image reconstruction from low-resolution images (opens in a new tab)

  7. Guessing Random Additive Noise Decoding in Coded Multiple-Input Multiple-Output Systems

    … competitive or superior performance relative to Belief Propagation (BP) decoding of 5G Low-Density Parity Check (LDPC) codes. This approach also marks a use of GRAND for low-rate, high-redundancy FEC in a MIMO system. With GRAND in MIMO still being an emerging area of research, this work is an …

    mit Repository record for Guessing Random Additive Noise Decoding in Coded Multiple-Input Multiple-Output Systems (opens in a new tab)

  8. Message Passing Algorithms for Statistical Estimation and Communication

    … channels. Efficient recovery schemes, based on belief propagation (BP) and Approximate Message Passing (AMP), are developed for these problems. We first consider matrix sketching, where the goal is to recover an *n*<sub>1</sub> x *n*<sub>2</sub> low-rank matrix with *k*-sparse singular vectors …

    cambridge Repository record for Message Passing Algorithms for Statistical Estimation and Communication (opens in a new tab)

  9. Theoretical guarantees and complexity reduction in information planning

    … process; and (iii) we propose a variant of belief propagation that is suitable for adaptive inference settings. In the first part, we present conditions under which open-loop is equivalent to closed-loop information planning. Furthermore, we provide bounds on the greedy performance for …

    mit Repository record for Theoretical guarantees and complexity reduction in information planning (opens in a new tab)

  10. High performance and error resilient probabilistic inference system for machine learning

    … algorithms on Markov random field (MRF) such as belief propagation (BP). However, this approximate inference is still computationally demanding, and thus custom hardware accelerators have been attractive for high performance and energy efficiency. There are various custom hardware implementations …

    uiuc Repository record for High performance and error resilient probabilistic inference system for machine learning (opens in a new tab)

  11. Message passing algorithms - methods and applications

    … the work in this dissertation will consider belief propagation and gossip consensus algorithms. We begin by considering the marginalization problem on factor graphs, which is often solved or approximated with Sum-Product belief propagation (BP) over the edges of the factor graph. For the case …

    uiuc Repository record for Message passing algorithms - methods and applications (opens in a new tab)