Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||One-step adaptive Markov random field for structured compressive sensing|
|Citation:||Signal Processing, 2019; 156:116-144|
|Suwichaya Suwanwimolkul, Lei Zhang, Damith C. Ranasinghe, Qinfeng Shi|
|Abstract:||Recently, Markov random fields (MRFs) have gained much success in sparse signal recovery. One of the challenges is to adaptively estimate the MRF parameters from a few compressed measurements in compressive sensing (CS). To address this problem, a recently developed method proposes to estimate the MRF parameters based on the point estimation of sparse signals. However, the point estimation cannot depict the statistical uncertainty of the latent sparse signal, which can result in inaccurate parameters estimation; thus, limiting the ultimate performance. In this study, we propose a one-step MRF based CS that estimates the MRF parameters from the given measurements through solving a maximum marginal likelihood (MML) problem. Since the marginal likelihood is obtained from averaging over the latent sparse signal population, it offers better generalization over all the latent sparse signals than the point estimation. To solve the MML problem effectively, we approximate the MRF distribution by the product of two simpler distributions, which enables to produce closed-form solutions for all unknown variables with low computational cost. Extensive experiments on a synthetic and three real-world datasets demonstrate the effectiveness of the proposed method in recovery accuracy, noise tolerance, and runtime.|
|Keywords:||Image processing; compressive sensing; signal reconstruction|
|Rights:||2018 Elsevier B.V. All rights reserved.|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.