MétaCan
Menu
Back to cohort
Record W2098625285 · doi:10.1117/12.798499

Enhancement of resilience to bit-errors of compressed data on-board a hyperspectral satellite using forward error correction

2008· article· en· W2098625285 on OpenAlexafffundabout
P. Zarrinkhat, Shen‐En Qian

Bibliographic record

VenueProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2008
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsCanadian Space Agency
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsHyperspectral imagingLossless compressionComputer scienceAlgorithmData compressionQuantization (signal processing)Data compression ratioError detection and correctionImage compressionArtificial intelligenceImage processing

Abstract

fetched live from OpenAlex

To deal with the huge volume of data produced by hyperspectral sensors, the Canadian Space Agency (CSA) has developed two simple and fast algorithms for compressing hyperspectral data, namely Successive Approximation Multistage Vector Quantization (SAMVQ) and Hierarchical Self-Organizing Cluster Vector Quantization (HSOCVQ). The CSA intends to use these algorithms, which are capable of providing high compression rates, on-board a proposed Canadian hyperspectral satellite. It has been shown that both SAMVQ and HSOCVQ are near-lossless compression algorithms as their designs restrict compression errors to levels consistent with the level of the intrinsic noise in the original hyperspectral data. Although both of them are more bit-error resistant than the traditional compression algorithms, when the bit-error rate (BER) exceeds 10<sup>-6</sup>, the compression fidelity starts to drop apparently. This paper explores the benefits of employing forward error correction on top of data compression, by SAMVQ or HSOCVQ, to deal with higher BERs. In particular, it is shown that by proper use of convolutional codes, the resilience of compressed hyperspectral data against bit errors can be improved by close to two orders of magnitude.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.578
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0030.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.032
GPT teacher head0.285
Teacher spread0.253 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designBench or experimental
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations2
Published2008
Admission routes3
Has abstractyes

Explore more

Same venueProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIESame topicAdvanced Data Compression TechniquesFrench-language works237,207