Proceedings Article10.1109/PACCS.2009.154
New Lossless Compression Method for JPEG
W Y Wang
- 16 May 2009
- pp 489-490
2
TL;DR: Using the typical example as experiment, a new shuffle algorithm is proposed to resize the JPEG, and then use the universal lossless algorithms to compress the resize JPEG with little time cost.
read more
Abstract: Universal lossless algorithms of data compression are always efficient to text and inefficient to JPEG data. According to the characteristic of JPEG, a new shuffle algorithm is proposed to resize the JPEG, and then use the universal lossless algorithms to compress the resize JPEG. In the end, using the typical example as experiment has been carried out and obtained a preferable compression ratio with little time cost.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Image compression using method on dct (discrete cosine transform) low resolution camera
Yohanes Pracoyo Widi Prasetyo
- 01 Jan 2021
TL;DR: In the simulation with Mat Lab, it can be seen that the image blocks are separated to be quantified and processed by the encoder by performing a re-construction, which will result in a smaller image file size than the source image file without losing too much information in the image.
Learned Lossless JPEG Transcoding via Joint Lossy and Residual Compression
13 Dec 2022
TL;DR: Zhang et al. as discussed by the authors proposed a learned lossless JPEG transcoding framework via joint lossy and residual compression, which adaptively learns the distribution of residual DCT coefficients before compressing them using context-based entropy coding.
References
A novel lossless data compression scheme based on the error correcting Hamming codes
TL;DR: This paper introduces a novel lossless binary data compression scheme that is based on the error correcting Hamming codes, namely the HCDC scheme, and an analytical formula is derived for computing the compression ratio as a function of block size, and fraction of valid data blocks in the sequence.
23