A near-lossless trellis-searched predictive image compression system

@article{Moayeri1996ANT,
  title={A near-lossless trellis-searched predictive image compression system},
  author={Nader Moayeri},
  journal={Proceedings of 3rd IEEE International Conference on Image Processing},
  year={1996},
  volume={2},
  pages={93-96 vol.2},
  url={https://api.semanticscholar.org/CorpusID:42883060}
}
This paper presents a near-lossless image compression system where the coded image is within some prespecified maximum error of the original image at each and every pixel. The system is predictive

Figures and Tables from this paper

A new error criterion for near-lossless image compression

This paper presents a new criterion for near-lossless image compression and compares it with the more familiar maximum pixel error criterion in terms of compression performance and coded image

Scalable near-lossless image coding

Two online near-lossless quantization techniques based on 1-D and 2-D transforms are presented and the algorithms outperform the prequantization-based near- lossless image coding in both bit rate and root mean square error performances, resulting in both subjectively and objectively superior performance in scalable decoding.

Fixed-slope near-lossless context-based image compression

A trellis-based fixed-slope near-lossless compression approach, that fits the adaptive context coding scheme ASBOSC introduced in 1997, which results in a distinct rate-distortion curve for each tolerance /spl epsiv/.

L-INFINITY PROGRESSIVE IMAGE COMPRESSION

This paper presents a lossless image coding approach that pr oduces an embedded bit-stream optimized for L∞-constrained decoding. The decoder is implementable using only integer arithmetic and is

Linfinity constrained high-fidelity image compression via adaptive context modeling

By incorporating the proposed techniques into the near-lossless version of CALIC that is considered by many as the state-of-the-art algorithm, the method obtained competitive PSNR results against the best L(2)-based wavelet coders, while obtaining much smaller L(infinity) bound.

Near-lossless image compression techniques

Methods of near-lossless image compression based on the criterion of maximum allowable deviation of pixel values are described in this paper and it is shown that the application of lossless coding based on reversible transforms in conjunction with pre-quantization is inferior to predictive techniques for near- Lossless compression.

L/sub /spl infin//-constrained high-fidelity image compression via adaptive context modeling

By incorporating the proposed techniques into the nearly-lossless version of CALIC, this work was able to increase its PSNR by 1 dB or more and/or reduce its bit rate by ten per cent or more.

Modifying integer wavelet transforms for scalable near-lossless image coding

It is evident from this research that with these novel schemes, scalable decoding features can be integrated into near-lossless coding with only a small increase in bit rate compared to those achieved in JPEG-LS.

Lossless and nearly lossless digital video coding

The importance of motion compensation in lossless video coding and the robustness of embedded decoding at quasi-lossless decoding in an assymetric codec is analysed, where a “Group Of Pictures” (GOP) structure based motion prediction is involved.

Near-lossless image compression: minimum-entropy, constrained-error DPCM

A near-lossless image compression scheme with a mechanism incorporated to minimize the entropy of the quantized prediction error sequence and an algorithm that produces minimum entropy conditioned on the contexts is presented.

Near-lossless compression of medical images through entropy-coded DPCM

Experiments involving several MR and US images show that the entropy-coded DPCM method can provide compression in the range from 4 to 10 with a peak SNR of about 50 dB for 8-bit medical images, and a comparison with the JPEG standard reveals that it can provide about 7 to 8 dB higher SNR for the same compression performance.

Reversible compression of HDTV images using median adaptive prediction and arithmetic coding

    Stephen A. Martucci
    Computer Science, Engineering
  • 1990
Methods of compressing HDTV (high-definition television) image sequences are investigated. Best results are achieved by a new combination of median adaptive intraframe prediction and arithmetic