Pith. sign in

REVIEW 3 cited by

Non-local Attention Optimized Deep Image Compression

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 1904.09757 v1 pith:S5H2KIUR submitted 2019-04-22 eess.IV cs.CV

classification eess.IVcs.CV
keywords imageattentioncompressionfeaturesnon-localdeepframeworkhyperprior
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper proposes a novel Non-Local Attention Optimized Deep Image Compression (NLAIC) framework, which is built on top of the popular variational auto-encoder (VAE) structure. Our NLAIC framework embeds non-local operations in the encoders and decoders for both image and latent feature probability information (known as hyperprior) to capture both local and global correlations, and apply attention mechanism to generate masks that are used to weigh the features for the image and hyperprior, which implicitly adapt bit allocation for different features based on their importance. Furthermore, both hyperpriors and spatial-channel neighbors of the latent features are used to improve entropy coding. The proposed model outperforms the existing methods on Kodak dataset, including learned (e.g., Balle2019, Balle2018) and conventional (e.g., BPG, JPEG2000, JPEG) image compression methods, for both PSNR and MS-SSIM distortion metrics.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Point Cloud-Assisted Neural Image Compression

    eess.IV 2024-12 conditional novelty 6.0 of 10

    Point cloud depth projected onto the image, fused through a new attention module, improves learned image compression on KITTI by 54.5% BD-rate over Cheng2020.

  2. Efficient Progressive Image Compression with Variance-aware Masking

    cs.CV 2024-11 conditional novelty 6.0 of 10

    A progressive image codec that ranks residual latent elements by predicted standard deviation and transmits them from most to least important, matching state-of-the-art RD with far lower decode cost.

  3. An Information-Theoretic Regularizer for Lossy Neural Image Compression

    cs.CV 2024-11 conditional novelty 5.0 of 10

    A regularizer that maximizes conditional source entropy gives BD-rate gains of 0.9% to 3.0% across five neural compression models, but may be equivalent to reweighting the rate term.

Pith tools