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 20 of 32 for “"approximate message passing"”.

  1. Denoising-based Approximate Message Passing

    … in this thesis, I propose a denoising-based approximate message passing (D-AMP) algorithm that is capable of high-performance reconstruction. I demonstrate that, when used with a high performance denoiser, D-AMP offers state-of-the-art CS recovery performance for natural images while …

    rice Repository record for Denoising-based Approximate Message Passing (opens in a new tab)

  2. Topics on LASSO and Approximate Message Passing

    … reliable algorithm for solving LASSO based on approximate message passing (AMP). Furthermore, we propose a parameter-free approximate message passing (AMP) algorithm that sets the threshold parameter at each iteration in a fully automatic way without either having an information about the …

    rice Repository record for Topics on LASSO and Approximate Message Passing (opens in a new tab)

  3. Approximate message passing for compressed sensing magnetic resonance imaging

    … presumed redundancies in the data.</p> <p>The Approximate Message Passing (AMP) algorithm is an iterative compressed sensing method that efficiently reconstructs signals that have been sampled with i.i.d. sub-Gaussian sensing matrices. However, when Fourier coefficients of a signal with …

    oxford Repository record for Approximate message passing for compressed sensing magnetic resonance imaging (opens in a new tab)

  4. Quantized matrix completion through bilinear factorization and approximate message passing

    … new Bayesian quantized MF solution based on the approximate message passing (AMP) framework to solve the discrete matrix completion (MC) problem. Specifically, we resort to the bilinear generalized vector AMP (BiG-VAMP) algorithm along with a quantizer, and an expectation-maximization (EM) …

    manitoba Repository record for Quantized matrix completion through bilinear factorization and approximate message passing (opens in a new tab)

  5. ORCHESTRATED APPROXIMATE MESSAGE PASSING: A NOVEL WAY OF MULTIMODAL DATA INTEGRATION

    … data integration problem using a variant of the Approximate Message Passing algorithm introduced in Donoho et al. (2009). Our variant not only matches popularly used techniques in accuracy but also allows for statistical inference with the results of the algorithm, thanks to an exact asymptotic …

    penn Repository record for ORCHESTRATED APPROXIMATE MESSAGE PASSING: A NOVEL WAY OF MULTIMODAL DATA INTEGRATION (opens in a new tab)

  6. Massive unsourced random access based on bilinear generalized vector approximate message passing

    … capitalizes on the bilinear generalized vector approximate message passing (BiG-VAMP) algorithm, tailored to fit the inherent constraints of mURA. To account for the quantization effects, we incorporate an output denoising module into the algorithm. Furthermore, this work presents a novel …

    manitoba Repository record for Massive unsourced random access based on bilinear generalized vector approximate message passing (opens in a new tab)

  7. Algorithmic Analysis And Statistical Inference Of Sparse Models In High Dimension

    … or difficult to study. This thesis leverages the approximate message passing (AMP) algorithm, the optimization theory, and the Sorted L-One Penalized Estimation (SLOPE) to study several important problems of the sparse models. The first chapter introduces various $\ell_1$ penalties including but …

    penn Repository record for Algorithmic Analysis And Statistical Inference Of Sparse Models In High Dimension (opens in a new tab)

  8. Low-Complexity Iterative Receiver Design for Multi-Carrier Faster-Than-Nyquist Signaling Over Frequency-Selective Fading Channel

    … iterative receiver based on hybrid message passing is proposed for spectrally efficient frequency division multiplexing (SEFDM) signaling combined with index modulation (IM), which solves the problem of joint symbol detection and channel estimation for frequency-domain …

    uts Repository record for Low-Complexity Iterative Receiver Design for Multi-Carrier Faster-Than-Nyquist Signaling Over Frequency-Selective Fading Channel (opens in a new tab)

  9. Kalman filtering beyond Gaussian innovation processes

    … by building upon the recent progress in the approximate message passing (AMP) algorithms, the vector AMP (VAMP) algorithm is unified with the Kalman filter (KF) into a common message passing framework that we coin VAMP-KF. The advantage of VAMP-KF is that it does not restrict the innovation …

    manitoba Repository record for Kalman filtering beyond Gaussian innovation processes (opens in a new tab)

  10. Using prior support information in compressed sensing

    … Lp minimization algorithms and a weighted approximate message passing algorithm. In Chapter 1 we describe compressed sensing as a practicable signal acquisition method in application and introduce the generic sparse approximation problem. Then we review some of the algorithms used in …

    ubc Repository record for Using prior support information in compressed sensing (opens in a new tab) Download PDF for Using prior support information in compressed sensing (opens in a new tab)

  11. Sparse Structure Learning via Information-Theoretic Regularization and Self-Contained Probabilistic Estimation

    … approach: we propose the generalized approximate message passing with built-in parameter estimation (PE-GAMP) framework, present its empirical convergence analysis and give detailed formulations to obtain the MMSE and MAP estimations of the sparse signal. Experiments on simulated and …

    jhu Repository record for Sparse Structure Learning via Information-Theoretic Regularization and Self-Contained Probabilistic Estimation (opens in a new tab)

  12. A compressed sensing approach to block-iterative equalization: connections and applications to radar imaging reconstruction

    … thus outperforming the state-of-the-art Complex Approximate Message Passing (CAMP) recursions. The merits of the new recursions are illustrated under a novel 3D MIMO Radar formulation, where the CAMP algorithm is shown to fail with respect to important performance measures.

    brazil-uerj Repository record for A compressed sensing approach to block-iterative equalization: connections and applications to radar imaging reconstruction (opens in a new tab)

  13. Channel Detection and Decoding With Deep Learning

    … research problems, including the designs of message passing algorithms for data detection in faster-than-Nyquist (FTN) signalling, soft-decision decoding algorithms for high-density parity-check codes and user identification for massive machine-type communications (mMTC). These wireless …

    unsw Repository record for Channel Detection and Decoding With Deep Learning (opens in a new tab)

  14. Graphical models and message passing receivers for interference limited communication systems

    … of the OFDM system to propose low-complexity message passing OFDM receivers that leverage recent results in soft-input soft-output decoding, approximate message passing, and sparse signal recovery for joint channel/interference estimation and data decoding. The resulting receivers provide huge …

    texas Repository record for Graphical models and message passing receivers for interference limited communication systems (opens in a new tab)

  15. Multi-user detection with oversampled large antenna arrays and low-resolution ADCs

    … a non-linear inference method based on Vector Approximate Message Passing (VAMP) and Belief Propagation. Addi tionally, we employ a state evolution analysis to investigate the algorithm’s asymptotic behaviour. The main objective of this algorithm is to reconstruct transmitted signals from the …

    manitoba Repository record for Multi-user detection with oversampled large antenna arrays and low-resolution ADCs (opens in a new tab)

  16. Distributed sparse signal recovery in networked systems

    … These algorithms are based on the original approximate message passing (AMP) and iterative hard thresholding (IHT) algorithms in the area of compressed sensing (CS), also known as sparse signal recovery. For distributed AMP (DiAMP), we develop a communication-efficient algorithm GCAMP. …

    vcu Repository record for Distributed sparse signal recovery in networked systems (opens in a new tab)

  17. On Extremal, Algorithmic, and Inferential Problems in Graph Theory

    … as well as the algorithmic paradigms of approximate message passing and power iteration.

    gatech Repository record for On Extremal, Algorithmic, and Inferential Problems in Graph Theory (opens in a new tab)

  18. Sparse Activity Detection for Massive Random Access

    … problem, and the computationally efficient approximate message passing (AMP) algorithm is employed. Specifically, for the single-cell scenario, this thesis studies the design of the AMP based detector to incorporate prior information of wireless channel, and also provides an analytical …

    toronto-retro Repository record for Sparse Activity Detection for Massive Random Access (opens in a new tab)

  19. Circuit models and AMP algorithms for future-generation wireless communication systems

    … addresses recent developments in the approximate message passing (AMP) literature, where algorithms rely heavily on some assumptions (i.e., AWGN model, separable denoisers) which are not practical in many engineering applications. We extend the vector AMP approach, initially used for …

    manitoba Repository record for Circuit models and AMP algorithms for future-generation wireless communication systems (opens in a new tab)

Page 1 of 2