MétaCan
Menu
Back to cohort
Record W1919844839 · doi:10.1109/igarss.1999.775025

Study of real-time lossless data compression for hyperspectral imagery

2003· article· en· W1919844839 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsCanadian Space Agency
Fundersnot available
KeywordsHyperspectral imagingLossless compressionData compressionComputer scienceRemote sensingArtificial intelligenceEntropy (arrow of time)Entropy encodingEncoderJPEG 2000Imaging spectrometerComputer visionImage compressionSpectrometerImage processingGeography

Abstract

fetched live from OpenAlex

This paper describes a study of real-time lossless data compression of hyperspectral imagery using prediction and entropy encoding. The main effort in developing a compression system, is to study predictors that can yield the best reduction of entropy and can be easily implemented in real-time. The Consultative Committee for Space Data System (CCSDS) recommended lossless algorithm is selected as the entropy encoder. Four predictor schemes have been selected for study. Three typical hyperspectral data sets acquired by the Airborne Visible/Infrared imaging Spectrometer (AVIRIS) and three acquired by the Compact Airborne Spectrographic Imager (casi) were used as test data. A lossless compression system with different predictors has been simulated and tested with the test data.

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.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.328
Threshold uncertainty score0.487

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.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.062
GPT teacher head0.349
Teacher spread0.287 · 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

Quick stats

Citations14
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207