PatchSVD: A Non-uniform SVD-based Image Compression Algorithm
Not on the map. Why?
Abstract (arXiv)
Storing data is particularly a challenge when dealing with image data which often involves large file sizes due to the high resolution and complexity of images. Efficient image compression algorithms are crucial to better manage data storage costs. In this paper, we propose a novel region-based lossy image compression technique, called PatchSVD, based on the Singular Value Decomposition (SVD) algorithm. We show through experiments that PatchSVD outperforms SVD-based image compression with respect to three popular image compression metrics. Moreover, we compare PatchSVD compression artifacts with those of Joint Photographic Experts Group (JPEG) and SVD-based image compression and illustrate some cases where PatchSVD compression artifacts are preferable compared to JPEG and SVD artifacts.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 6 of its 26 references that are in the map. First posted on arXiv 7 Jun 2024.
Builds on
6 of 26 references.
References · 6
- 2016Full Resolution Image Compression with Recurrent Neural Networkscited by 175
- 2017Soft-to-Hard Vector Quantization for End-to-End Learning Compressible Representationscited by 152
- 2017Learning Convolutional Networks for Content-weighted Image Compressioncited by 76
- 2018Deep Convolutional AutoEncoder-based Lossy Image Compressioncited by 42
- 2019Deep Residual Learning for Image Compressioncited by 16
- 2016Semantic Perceptual Image Compression using Deep Convolution Networkscited by 12
Built on by
Citing papers per year: 2026: 1.
1 paper.