2014
DOI: 10.1109/tgrs.2013.2292366
|View full text |Cite
|
Sign up to set email alerts
|

Lossless to Lossy Dual-Tree BEZW Compression for Hyperspectral Images

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
6
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 34 publications
(7 citation statements)
references
References 21 publications
0
6
0
Order By: Relevance
“…4, t Φ ↓ j is the instant in which packets Φ ↑ k , 0 ≤ k ≤ j have been transmitted plus the time needed to compute Φ ↓ j . This quantity is expressed by the left argument of the max{•} operator in (5). For the other packets of the figure, the earliest instant is when the previous packet (i.e., Φ ↓ j−1 ) has Fig.…”
Section: Synchronization Aspectsmentioning
confidence: 99%
See 1 more Smart Citation
“…4, t Φ ↓ j is the instant in which packets Φ ↑ k , 0 ≤ k ≤ j have been transmitted plus the time needed to compute Φ ↓ j . This quantity is expressed by the left argument of the max{•} operator in (5). For the other packets of the figure, the earliest instant is when the previous packet (i.e., Φ ↓ j−1 ) has Fig.…”
Section: Synchronization Aspectsmentioning
confidence: 99%
“…Once the data are compressed -either with or without loss-to a size that fits the bit budget of the downlink, they are (stored and then) transmitted during the time in which the ground station(s) is in contact with the satellite. Among others, standards and coding systems devised for the coding of satellite images using lossless and lossy regimes are respectively described in [1]- [6] and [2], [5], [7], [8].…”
mentioning
confidence: 99%
“…For packets Φ For the other packets of the figure, the earliest instant is when the previous packet (i.e., Φ ↓ j−1 ) has already been transmitted, which is expressed in the right part of the max(·) expression. Note that (5) assumes that processing times c j are shorter than transmission times T Φ ↑ j . The synchronization needed between the ground station and the satellite reduces the effective bit budget of both channels since, as seen in Fig.…”
Section: Synchronization Aspectsmentioning
confidence: 99%
“…Once the data are compressed -either with or without loss-to a size that fits the bit budget of the downlink, it is (stored and) transmitted during the time in which the ground station(s) are in contact with the satellite. Among others, standards and coding systems devised for the coding of satellite images using lossless and lossy regimes are respectively described in [1]- [6] and [2], [5], [7], [8].…”
Section: Introductionmentioning
confidence: 99%
“…A low complexity KLT-based algorithm in Blanes and Serra-Sagristà [2010] was introduced, its performance is better than DWT when it is used with the JPEG coding. In Cheng and Dill [2014], a lossless to lossy compression scheme for hyperspectral images based on a dual-tree Binary Embedded Zerotree Wavelet (BEZW) algorithm has been presented. The impact of lossy compression on spectral unmixing, and supervised classification using Support Vector Machine (SVM) was investigated in García-Vílchez et al [2011].…”
Section: Introductionmentioning
confidence: 99%