mlsanityData to 13 Oct 2026

Clear-Weighted Bit Allocation for Satellite Downlinks

arXiv 2608.01457 ↗First posted 2 Aug 2026cs.NI cs.CV eess.IVcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 17 of its 35 references that are in the map. First posted on arXiv 2 Aug 2026.

Builds on

17 of 35 references.

References · 17

  1. 2018Joint Autoregressive and Hierarchical Priors for Learned Image Compressioncited by 658
  2. 2020Learned Image Compression with Discretized Gaussian Mixture Likelihoods and Attention Modulescited by 586
  3. 2022ELIC: Efficient Learned Image Compression with Unevenly Grouped Space-Channel Contextual Adaptive Codingcited by 298
  4. 2021Checkerboard Context Model for Efficient Learned Image Compressioncited by 198
  5. 2019Learning Content-Weighted Deep Image Compressioncited by 28
  6. 2022Content-oriented learned image compressioncited by 12
  7. 2023FrankenSplit: Efficient Neural Feature Compression with Shallow Variational Bottleneck Injection for Mobile Edge Computingcited by 12
  8. 2023Fast and High-Performance Learned Image Compression With Improved Checkerboard Context Model, Deformable Residual Module, and Knowledge Distillationcited by 11
  9. 2024Region-Adaptive Transform with Segmentation Prior for Image Compressioncited by 8
  10. 2024AllClear: A Comprehensive Dataset and Benchmark for Cloud Removal in Satellite Imagerycited by 7
  11. 2024Earth+: on-board satellite imagery compression leveraging historical earth observationscited by 6
  12. 2024FOOL: Addressing the Downlink Bottleneck in Satellite Computing with Neural Feature Compressioncited by 6
5 more
  1. 2024Resource-efficient In-orbit Detection of Earth Objectscited by 2
  2. 2024In-Orbit Processing or Not? Sunlight-Aware Task Scheduling for Energy-Efficient Space Edge Computing Networkscited by 2
  3. 2025Leveraging Neural Graph Compilers in Machine Learning Research for Edge-Cloud Systemscited by 2
  4. 2025Joint Optimization of Handoff and Video Rate in LEO Satellite Networkscited by 1
  5. 2025Learned Image Compression for Earth Observation: Implications for Downstream Segmentation Taskscited by 1

Built on by

Not cited yet.