🤖 AI Summary
Earth observation satellites face challenges in downlinking all acquired imagery due to intermittent ground station contacts, while existing cloud detection methods often erroneously discard clear-sky pixels. This work proposes a neural codec architecture that dynamically allocates bitrate to high-value clear-sky regions by weighting reconstruction loss with per-pixel clear-sky probabilities. Integrating recoverable layered coding with a lightweight causal scheduling mechanism, the approach optimizes downlink efficiency under disrupted links without requiring on-board transmission of cloud masks. Under equivalent clear-sky image quality, the method reduces bitrate by up to 47.8% compared to baseline learned compression schemes. Moreover, its scheduling strategy doubles effective delivery volume in link-interruption scenarios, achieving 83.6% of the theoretical upper bound—significantly outperforming conventional playback ordering.
📝 Abstract
Earth-observation satellites capture more imagery than intermittent ground contacts can transmit. Onboard systems threshold a cloud detector, discard frames or tiles, and compress the survivors with a fixed codec. On expert-labeled imagery, these rules remove more than one-fifth of clear pixels, primarily through detector false positives. We train a neural codec with a clear-probability-weighted reconstruction loss, reallocating coded bytes from clouds to clear ground without requiring or transmitting a cloud map onboard. Each capture is encoded into a resumable base layer and a dependent refinement layer, while clear content is estimated from features produced by the encoder. At each contact, we causally rank arrived layers using estimated clear content, unfinished bytes, deadline slack, and aggregate deadline pressure. The scheduler serves base and computational deadlines, bounds stored residual bytes, and resumes interrupted packets. We evaluate the onboard-to-downlink pipeline using real entropy-coded bytes, orbit-derived interruptible contact capacities, and measured service time and energy on resource-constrained embedded accelerators. Clear-weighted codecs require up to 47.8\% fewer bytes than learned-compression baselines at matched clear-region quality. The optimized encoder consumes less time and energy than one pass of the cloud detector used by the frame-discard rules. Relative to fixed two-stage service on the same streams, our scheduler more than doubles deadline-full clear-content delivery for the interrupted combined cohort, reaches 83.6\% of a certified clairvoyant upper bound, and exceeds replayed reference orders in deadline-usable delivery.