Task-aware Distributed Source Coding under Dynamic Bandwidth
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909410946711552 |
|---|---|
| author | Li, Po-han Ankireddy, Sravan Kumar Zhao, Ruihan Mahjoub, Hossein Nourkhiz Moradi-Pari, Ehsan Topcu, Ufuk Chinchali, Sandeep Kim, Hyeji |
| author_facet | Li, Po-han Ankireddy, Sravan Kumar Zhao, Ruihan Mahjoub, Hossein Nourkhiz Moradi-Pari, Ehsan Topcu, Ufuk Chinchali, Sandeep Kim, Hyeji |
| contents | Efficient compression of correlated data is essential to minimize communication overload in multi-sensor networks. In such networks, each sensor independently compresses the data and transmits them to a central node due to limited communication bandwidth. A decoder at the central node decompresses and passes the data to a pre-trained machine learning-based task to generate the final output. Thus, it is important to compress the features that are relevant to the task. Additionally, the final performance depends heavily on the total available bandwidth. In practice, it is common to encounter varying availability in bandwidth, and higher bandwidth results in better performance of the task. We design a novel distributed compression framework composed of independent encoders and a joint decoder, which we call neural distributed principal component analysis (NDPCA). NDPCA flexibly compresses data from multiple sources to any available bandwidth with a single model, reducing computing and storage overhead. NDPCA achieves this by learning low-rank task representations and efficiently distributing bandwidth among sensors, thus providing a graceful trade-off between performance and bandwidth. Experiments show that NDPCA improves the success rate of multi-view robotic arm manipulation by 9% and the accuracy of object detection tasks on satellite imagery by 14% compared to an autoencoder with uniform bandwidth allocation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_15523 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Task-aware Distributed Source Coding under Dynamic Bandwidth Li, Po-han Ankireddy, Sravan Kumar Zhao, Ruihan Mahjoub, Hossein Nourkhiz Moradi-Pari, Ehsan Topcu, Ufuk Chinchali, Sandeep Kim, Hyeji Information Theory Computer Vision and Pattern Recognition Efficient compression of correlated data is essential to minimize communication overload in multi-sensor networks. In such networks, each sensor independently compresses the data and transmits them to a central node due to limited communication bandwidth. A decoder at the central node decompresses and passes the data to a pre-trained machine learning-based task to generate the final output. Thus, it is important to compress the features that are relevant to the task. Additionally, the final performance depends heavily on the total available bandwidth. In practice, it is common to encounter varying availability in bandwidth, and higher bandwidth results in better performance of the task. We design a novel distributed compression framework composed of independent encoders and a joint decoder, which we call neural distributed principal component analysis (NDPCA). NDPCA flexibly compresses data from multiple sources to any available bandwidth with a single model, reducing computing and storage overhead. NDPCA achieves this by learning low-rank task representations and efficiently distributing bandwidth among sensors, thus providing a graceful trade-off between performance and bandwidth. Experiments show that NDPCA improves the success rate of multi-view robotic arm manipulation by 9% and the accuracy of object detection tasks on satellite imagery by 14% compared to an autoencoder with uniform bandwidth allocation. |
| title | Task-aware Distributed Source Coding under Dynamic Bandwidth |
| topic | Information Theory Computer Vision and Pattern Recognition |
| url | https://arxiv.org/abs/2305.15523 |