Some simple parametric lossless image compressors

Slyz, M.J.; Neuhoff, David L.

doi:10.1109/icip.2000.900910

Cited by 3 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…BG is a version of BH that uses Golomb coding, selecting the coding parameter for each block based on the block's errors as in [14]. LM (1/1) uses two first-order predictors for every pixel-one predicting from the spectrum at i − 1, j, and one from the spectrum at i, j −1-and trains these on the previous two image bands.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

A Block-Based Inter-Band Lossless Hyperspectral Image Compressor

Slyz

Zhang

Data Compression Conference

View full text Add to dashboard Cite

Abstract:We propose a hyperspectral image compressor called BH which considers its input image as being partitioned into square blocks, each lying entirely within a particular band, and compresses one such block at a time by using the following steps: first predict the block from the corresponding block in the previous band, then select a predesigned code based on the prediction errors, and finally encode the predictor coefficient and errors. Apart from giving good compression rates and being fast, BH can provide random access to spatial locations in the image.We hypothesize that BH works well because it accommodates the rapidly changing image brightness that often occurs in hyperspectral images. We also propose an intraband compressor called LM which is worse than BH, but whose performance helps explain BH's performance.

show abstract

Section: Resultsmentioning

confidence: 99%

“…uses this a u to predict x i,j,k , and selects a Golomb code based on (5) as in [14]. A slightly more flexible approach is to allow N to be different for this code selection than it was for the a u selection.…”

Section: The Lm Compression Algorithmmentioning

confidence: 99%