Pith. sign in

REVIEW 1 cited by

Learned D-AMP: Principled Neural Network based Compressive Image Recovery

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1704.06625 v4 pith:3Z27IY7T submitted 2017-04-21 stat.ML cs.LG

classification stat.MLcs.LG
keywords networkalgorithmsd-ampfasterldampneuralappliedbm3d-amp
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Compressive image recovery is a challenging problem that requires fast and accurate algorithms. Recently, neural networks have been applied to this problem with promising results. By exploiting massively parallel GPU processing architectures and oodles of training data, they can run orders of magnitude faster than existing techniques. However, these methods are largely unprincipled black boxes that are difficult to train and often-times specific to a single measurement matrix. It was recently demonstrated that iterative sparse-signal-recovery algorithms can be "unrolled" to form interpretable deep networks. Taking inspiration from this work, we develop a novel neural network architecture that mimics the behavior of the denoising-based approximate message passing (D-AMP) algorithm. We call this new network Learned D-AMP (LDAMP). The LDAMP network is easy to train, can be applied to a variety of different measurement matrices, and comes with a state-evolution heuristic that accurately predicts its performance. Most importantly, it outperforms the state-of-the-art BM3D-AMP and NLR-CS algorithms in terms of both accuracy and run time. At high resolutions, and when used with sensing matrices that have fast implementations, LDAMP runs over $50\times$ faster than BM3D-AMP and hundreds of times faster than NLR-CS.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Comprehensive Examination of Unrolled Networks for Solving Linear Inverse Problems

    eess.IV 2025-01 conditional novelty 6.0 of 10

    An empirical study proposing DeMUN, a memory-based unrolled network, and finding that intermediate loss and residual connections improve reconstruction while projector depth beyond five layers matters little.

Pith tools