DCT-based scheme for lossless image compression

@inproceedings{Mandyam1995DCTbasedSF,
  title={DCT-based scheme for lossless image compression},
  author={Giridhar D. Mandyam and Nasir Ahmed and Neeraj Magotra},
  booktitle={Electronic Imaging},
  year={1995}
}
In this paper, a new method to achieve lossless compression of 2D images based on the discrete cosine transform (DCT) is proposed. This method quantizes the high energy DCT coefficients in each block, finds an inverse DCT from only these quantized coefficients, and forms an error residual sequence to be coded. Furthermore, a simple delta modulation scheme is performed on the coefficients that exploits correlation between high energy DCT coefficients in neighboring blocks of an image. The… 
Lossless Image Compression Using the Discrete Cosine Transform
In this paper, a new method to achieve lossless compression of two-dimensional images based on the discrete cosine transform (DCT) is proposed. This method quantizes the high-energy DCT coefficients
Lossless Image Compression Using Predictive Codebooks
TLDR
A method for lossless image compression where relative pixel values of prediction regions in a set of training images are stored as a codebook and using the same codebook one can achieve perfect reconstruction of the image.
Predictive codebook design for lossless image compression
TLDR
A new method for lossless image compression where relative pixel values of localized neighborhoods in test images are stored in a codebook, and the difference between the actual pixel value and the predicted value from the codebook is coded using an entropy coder.
Eecient Codebook Design for Lossless Image Compression
TLDR
A new method for lossless image compression where relative pixel values of localized neighborhoods in test images are stored in a codebook, and the diierence between the actual pixel value and the predicted value from the codebook is coded using an entropy coder.
An Edge Regeneration Method for Artifacts Removal in Compressed Image
TLDR
This paper presents a new Canny edge based restoration method to remove artefacts from compressed image using standard JPEG compression and describes about artefacts which can be consequence of compression and their reduction techniques.
A Compression Artifacts Reduction Method in Compressed Image
TLDR
This paper presents a new Canny edge based restoration method to remove artefacts from compressed image and Experimental effects of proposed method by use of various performance parameters are good.
Efficiency of Jpeg Image Compression Using Quantization Noise Analysis
TLDR
The proposed method is based on forward quantization noise by quantizing the DCTblocks coefficients with step by one to derive that a decompressed JPEG image has a lower variance of forward quantized noise than its uncompressed counterpart.
Segmentation-based and region-adaptive lossless image compression underpinned by a stellar-field image model
TLDR
It is concluded that for archiving data, compression methods may indeed save costs for storage media or data transfer time, especially if a large part of the raw images is encoded with 32 bits per pixel.
Lossless compression of Synthetic Aperture Radar images
  • R. Ives, N. Magotra, G. Mandyam
  • Mathematics, Environmental Science
    1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96
  • 1996
TLDR
This paper provides the results of applying several lossless compression schemes to SAR imagery.
Adaptive color space model based on dominant colors for image and video compression performance improvement
TLDR
The experimental results show that the proposed adaptive color space model provides improved performance of 3 % to 10 % better than YCbCr, YDbDr, YCoCg and YCgCo-R color spaces family.
...
1
2
...

References

SHOWING 1-8 OF 8 REFERENCES
Discrete Cosine Transform
TLDR
It is shown that the discrete cosine transform can be used in the area of digital processing for the purposes of pattern recognition and Wiener filtering and its performance is compared with that of a class of orthogonal transforms and is found to compare closely to that of the Karhunen-Loeve transform, which is known to be optimal.
Fractal image compression
Arithmetic coding for data compression
The state of the art in data compression is arithmetic coding, not the better-known Huffman method. Arithmetic coding gives greater compression, is faster for adaptive models, and clearly separates
Fundamentals of Digital Image Processing
  • Anil K. Jain
  • Computer Science
    Control of Color Imaging Systems
  • 2018
TLDR
This chapter discusses two Dimensional Systems and Mathematical Preliminaries and their applications in Image Analysis and Computer Vision, as well as image reconstruction from Projections and image enhancement.
Discrete Cosine Transform: Algorithms, Advaniages, andApplications
  • 1990
Discrete Cosine Transform: Algorithms, Advantages, and Applications
  • Discrete Cosine Transform: Algorithms, Advantages, and Applications
  • 1990
IEEE Transactions on Computers
  • Computing in Science & Engineering