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

Low-Complexity Compression Method for Hyperspectral Images Based on Distributed Source Coding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
13
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 39 publications
(13 citation statements)
references
References 12 publications
0
13
0
Order By: Relevance
“…In the paper, both DCT and DWT based 3D approaches are investigated, where a modified 3D DCT based approach is proposed and compared with 3D SPIHT algorithm. Although it was found DWT usually outperforms DCT in this context (Penna et al 2007;Xiong et al 1999), better results from DCT were reported by others (Pan, Liu, and Lv 2012). Therefore, we also aim to evaluate these two approaches in terms of the compression performance and any sideeffects on subsequent data analysis.…”
Section: Introductionmentioning
confidence: 93%
“…In the paper, both DCT and DWT based 3D approaches are investigated, where a modified 3D DCT based approach is proposed and compared with 3D SPIHT algorithm. Although it was found DWT usually outperforms DCT in this context (Penna et al 2007;Xiong et al 1999), better results from DCT were reported by others (Pan, Liu, and Lv 2012). Therefore, we also aim to evaluate these two approaches in terms of the compression performance and any sideeffects on subsequent data analysis.…”
Section: Introductionmentioning
confidence: 93%
“…Both schemes reported in [25] and [26] utilize DCT to remove the spatial redundancy at the encoder, which will cancel out some of the complexity reductions gained from DSC coding. Although [27] exploits the spatial and spectral correlation at the decoder side, its prediction performance has suffered because of its unrealistic assumption that all the pixels in 16 16 blocks have the same spectral correlation and can be predicted with the same linear filter.…”
Section: A Prior Workmentioning
confidence: 99%
“…Unlike videos, ME is not necessary here since different spectral bands are responses of the same object in different wavelengths [44]. Instead, a linear prediction from decoded bands is often assumed to generate the SI [24]- [27]. Estimating SI at the encoder allows for near lossless coding for coset codes [25], [26] and optimal quantization for rate allocation [25].…”
Section: B Distributed Source Codingmentioning
confidence: 99%
“…Estimating SI at the encoder allows for near lossless coding for coset codes [25], [26] and optimal quantization for rate allocation [25]. By transmitting coefficients of the linear prediction model, a more accurate SI can be obtained [27]. Exchanging parts of data with adjacent bands makes it possible to estimate the rate at the encoder and does not decrease the parallelism [45].…”
Section: B Distributed Source Codingmentioning
confidence: 99%
See 1 more Smart Citation