Pith. sign in

REVIEW 1 cited by

ISTA-Net: Interpretable Optimization-Inspired Deep Network for Image Compressive Sensing

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 1706.07929 v2 pith:WACWRA7N submitted 2017-06-24 cs.CV cs.MM

classification cs.CVcs.MM
keywords ista-netdeepmethodsnetworkreconstructionalgorithmcompressivedubbed
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

With the aim of developing a fast yet accurate algorithm for compressive sensing (CS) reconstruction of natural images, we combine in this paper the merits of two existing categories of CS methods: the structure insights of traditional optimization-based methods and the speed of recent network-based ones. Specifically, we propose a novel structured deep network, dubbed ISTA-Net, which is inspired by the Iterative Shrinkage-Thresholding Algorithm (ISTA) for optimizing a general $\ell_1$ norm CS reconstruction model. To cast ISTA into deep network form, we develop an effective strategy to solve the proximal mapping associated with the sparsity-inducing regularizer using nonlinear transforms. All the parameters in ISTA-Net (\eg nonlinear transforms, shrinkage thresholds, step sizes, etc.) are learned end-to-end, rather than being hand-crafted. Moreover, considering that the residuals of natural images are more compressible, an enhanced version of ISTA-Net in the residual domain, dubbed {ISTA-Net}$^+$, is derived to further improve CS reconstruction. Extensive CS experiments demonstrate that the proposed ISTA-Nets outperform existing state-of-the-art optimization-based and network-based CS methods by large margins, while maintaining fast computational speed. Our source codes are available: \textsl{http://jianzhang.tech/projects/ISTA-Net}.

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