2012
DOI: 10.1109/lgrs.2012.2191531
|View full text |Cite
|
Sign up to set email alerts
|

Lossless Compression of Hyperspectral Images Using Clustered Linear Prediction With Adaptive Prediction Length

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
24
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 49 publications
(24 citation statements)
references
References 7 publications
0
24
0
Order By: Relevance
“…In the process of encoding, one can select either sample-adaptive or block-adaptive approach to encode the prediction residuals. However, in terms of compression ratio, the Clustered Differential Pulse Code Modulation with Adaptive Prediction Length (C-DPCM-APL) [11] enhanced over C-DPCM is optimal. It achieves the highest compression ratio on the CCSDS hyperspectral images acquired in 2006.…”
Section: Previous Methodsmentioning
confidence: 99%
“…In the process of encoding, one can select either sample-adaptive or block-adaptive approach to encode the prediction residuals. However, in terms of compression ratio, the Clustered Differential Pulse Code Modulation with Adaptive Prediction Length (C-DPCM-APL) [11] enhanced over C-DPCM is optimal. It achieves the highest compression ratio on the CCSDS hyperspectral images acquired in 2006.…”
Section: Previous Methodsmentioning
confidence: 99%
“…As well as low complexity specific algorithms, several high computational complexity algorithms that feature advanced pre-processing have been proposed [15] [16][17] [18]. These algorithms are able to achieve state-of-the-art levels of compression due to the incorporation of image segmentation to determine areas of homogenous pixels for increased prediction accuracy.…”
Section: Lossless Image Compression Literature Reviewmentioning
confidence: 99%
“…Clustered Differential Pulse Code Modulation (C-DPCM) is an example of one such algorithm whereby error optimised linear predictors are calculated for each cluster utilising collocated pixels from previously encoded bands [17]. C-DPCM-APL (Adaptive Predictor Length), is a variation of this algorithm that uses a brute force approach to determine the optimum number of previously encoded bands to use in the linear predictor calculation [18]. C-DPCM-APL is able to achieve an average compression ratio of 3.47, the highest compression ratio of all the algorithms surveyed.…”
Section: Lossless Image Compression Literature Reviewmentioning
confidence: 99%
“…The Locally Averaged Interband Scaling (LAIS)-LUT method [6] uses two LUTs per band to update and choose the closest to the LAIS as the predictor. The Clustered DPCM (C-DPCM) method is improved in [7] by using an adaptive prediction length. These prediction-based methods are successful in lossless hyperspectral image compression.…”
Section: Introductionmentioning
confidence: 99%