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 17 of 17 for “"Message Passing Algorithm"”.
-
Constrained Information Exchange Message Passing Algorithm in Probabilistic Graphical Models
… all cellular wireless systems run on these days. Message passing algorithms exploit the independence and factorization structure within these graphical models to develop analytically tractable, computationally efficient, and exact inference algorithms. Posterior inference using message-passing …
-
Analogic for code estimation and detection
… by locally propagating probabilities in a message-passing algorithm [29] [15]. In this thesis, we study an exemplary embodiment of analogic called Noise-Locked Loop(NLL) which is a pseudo-random code estimation system. The previous work shows NLL can perform direct-sequence spread-spectrum …
-
Feedback message passing for inference in Gaussian graphical models
… in a cycle-free graph. We propose a feedback message passing algorithm in which non-feedback nodes send out one set of messages while the feedback nodes use a different message update scheme. Exact inference results can be obtained in O(k²n), where k is the number of feedback nodes and n is …
-
Community detection in preferential attachment graphs
… often-studied stochastic block model (SBM). A message passing algorithm for community detection is derived, and multiple simulation results are shown that demonstrate the efficacy of the algorithm. The algorithm is based on certain asymptotic properties unique to this model. These properties, …
-
Optimal standoff imaging using structured laser illumination and graphical models
… standoff imaging along with an approximate message-passing algorithm for belief propagation to perform optimal scene reconstruction. This approach lets us accurately model the statistics of speckled images, photon detection, and atmospheric turbulence, as well as incorporate intelligent …
-
A Hardware Generator for Factor Graph Applications
… factor nodes, which iteratively compute and pass messages to each other. FGs can be applied to solve decoding of forward error correcting codes, Markov chains and Markov Random Fields, Kalman Filtering, Fourier Transforms, and even some games such as Sudoku. In this paper, a framework is presented …
-
Continuous-time analog circuits for statistical signal processing
… circuits as propagating probabilities in a message passing algorithm. Within this framework, analog continuous-time circuits can perform robust, programmable, high-speed, low-power, cost-effective, statistical signal processing. This methodology will have broad application to systems which …
-
Input of Factor Graphs into the Detection, Classification, and Localization Chain and Continuous Active SONAR in Undersea Vehicles
… of the decomposition of a particular function. Messages are passed along the edges connecting factor and variable nodes, on which, a message passing algorithm is applied to compute the posterior probabilities at a particular node. This thesis addresses two issues. In the first section, the …
-
Correlation decay and decentralized optimization in graphical models
… of the networks. This is so even when using algorithms that take advantage of the underlying graphical structure. Approximate methods are therefore needed. The aim of this thesis is to study such large-scale systems, focusing on the question of how randomness affects the complexity of …
-
Cumulative Distribution Networks: Inference, Estimation and Applications of Graphical Models for Cumulative Distribution Functions
… we describe the `derivative-sum-product' (DSP) message-passing algorithm where messages correspond to derivatives of the joint cumulative distribution function. We will then apply CDNs to the problem of learning to rank, or estimating parametric models for ranking, where CDNs provide a natural …
-
Chromatic scheduling of dynamic data-graph computations
… I introduce PRISM, a work-efficient scheduling algorithm for dynamic data-graph computations that uses chromatic scheduling. For a collection of four application benchmarks on a modern multicore machine, chromatic scheduling approximately doubles the performance of the lock-based GraphLab …
-
Distortion-Tolerant Communications with Correlated Information
… the Markov chain. Correspondingly, two decoding algorithms are proposed. The first multi-codeword message passing algorithm (MCMP) is designed for spatially correlated memoryless sources. In the second algorithm, a hidden Markov decoding process is added to the MCMP decoder to effectively exploit …
-
Development of a scalable real-time Lagrangian particle tracking system for volumetric flow field characterization
… on pipelining temporal data through a unique message passing algorithm in order to utilize large clusters containing hundreds of processor nodes. A sensitivity analysis was completed based on the derivation of measurement uncertainty. It was shown that by utilizing groups of four cameras in …
-
Cloud-aided wireless systems: communications and radar applications
… physical-layer parameters is carried out via a message passing algorithm by minimizing the total energy expenditure of the mobile user. The concept of cloud radio is also being considered for the development of two cellular architectures known as Distributed RAN (D-RAN) and C-RAN, whereby the …
-
Sparse graph codes for compression, sensing, and secrecy
… codes with low complexity encoding and decoding algorithms have been designed for many channels. Motivated by the success of sparse graph codes for channel coding, we explore the use of sparse graph codes for four other problems related to compression, sensing, and security. First, we construct …
-
A Unified Robust Minimax Framework for Regularized Learning Problems
… analysis techniques, and inspiring novel generic algorithms. To show how to apply minimax related concepts to real-world learning tasks, we develop a new fault-tolerant classification framework to combat class noise for general multi-class classification problems; further, by studying the …
-
Decentralised coordination of information gathering agents
… of this thesis are decentralised coordination algorithms that solve this general problem with additional constraints and requirements, and can be grouped into two categories. The first category pertains to decentralised coordination of fixed information gathering agents. For these agents, we …