Abstract
Approximate message passing (AMP) is an efficient iterative signal recovery algorithm for compressed sensing (CS). For sensing matrices with independent and identically distributed (i.i.d.) Gaussian entries, the behavior of AMP can be asymptotically described by a scaler recursion called state evolution. Orthogonal AMP (OAMP) is a variant of AMP that imposes a divergence-free constraint on the denoiser. In this paper, we extend OAMP to incorporate generic denoisers, hence the name D-OAMP. Our numerical results show that state evolution predicts the performance of D-OAMP well for generic denoisers when i.i.d. Gaussian or partial orthogonal sensing matrices are involved. We compare the performances of denosing-AMP (D-AMP) and D-OAMP for recovering natural images from CS measurements. Simulation results show that D-OAMP outperforms D-AMP in both convergence speed and recovery accuracy for partial orthogonal sensing matrices.
| Original language | English |
|---|---|
| Title of host publication | 2016 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2016 - Proceedings |
| Publisher | IEEE |
| Pages | 267-271 |
| ISBN (Print) | 9781509045457 |
| DOIs | |
| Publication status | Published - 19 Apr 2017 |
| Event | 2016 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2016 - Washington, United States Duration: 7 Dec 2016 → 9 Dec 2016 |
Conference
| Conference | 2016 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2016 |
|---|---|
| Place | United States |
| City | Washington |
| Period | 7/12/16 → 9/12/16 |
Research Keywords
- Approximate message passing (AMP)
- Compressed sensing
- Denoising
- Orthogonal AMP
- Partial orthogonal matrix