.png){kind=icon}
.png){kind=icon}
Return
Generalized fusion algorithm for compressive sampling reconstruction and RIP-based analysis
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2017.03.021.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We design a Generalized Fusion Algorithm for Compressive Sampling (gFACS) reconstruction. In the gFACS algorithm, several individual compressive sampling (CS) reconstruction algorithms participate to achieve a better performance than the individual algorithms. The gFACS algorithm is iterative in nature and its convergence is proved under certain conditions using Restricted Isometry Property (RIP) based theoretical analysis. The theoretical analysis allows for the participation of any off-the-shelf or new CS reconstruction algorithm with simple modifications, and still guarantees convergence. We show modifications of some well-known CS reconstruction algorithms for their seamless use in the gFACS algorithm. Simulation results show that the proposed gFACS algorithm indeed provides better performance than the participating individual algorithms. (C) 2017 Elsevier B.V. All rights reserved.
Keywords:
Compressive sampling
Greedy algorithm
RIP analysis
Fusion strategy
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.