Pith. sign in

REVIEW 1 cited by

FOOL: Addressing the Downlink Bottleneck in Satellite Computing with Neural Feature Compression

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.16677 v3 pith:PA2PI2DC submitted 2024-03-25 cs.LG cs.CVcs.DCcs.NIeess.IV

classification cs.LGcs.CVcs.DCcs.NIeess.IV
keywords foolfeaturetransferbottleneckcompressioncomputingcostsdownlink
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Nanosatellite constellations equipped with sensors capturing large geographic regions provide unprecedented opportunities for Earth observation. As constellation sizes increase, network contention poses a downlink bottleneck. Orbital Edge Computing (OEC) leverages limited onboard compute resources to reduce transfer costs by processing the raw captures at the source. However, current solutions have limited practicability due to reliance on crude filtering methods or over-prioritizing particular downstream tasks. This work presents FOOL, an OEC-native and task-agnostic feature compression method that preserves prediction performance. FOOL partitions high-resolution satellite imagery to maximize throughput. Further, it embeds context and leverages inter-tile dependencies to lower transfer costs with negligible overhead. While FOOL is a feature compressor, it can recover images with competitive scores on quality measures at lower bitrates. We extensively evaluate transfer cost reduction by including the peculiarity of intermittently available network connections in low earth orbit. Lastly, we test the feasibility of our system for standardized nanosatellite form factors. We demonstrate that FOOL permits downlinking over 100x the data volume without relying on prior information on the downstream tasks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Adversarial Robustness of Bottleneck Injected Deep Neural Networks for Task-Oriented Communication

    cs.LG 2024-12 conditional novelty 5.0 of 10

    Shallow variational bottleneck compression is more vulnerable to adversarial attacks than deep variational bottleneck compression, and generative decoders widen the attack surface in task-oriented communication.

Pith tools