Rate adaptive compressed sampling based on region division for wireless sensor networks
Wei Wang, Xiaoping Jin, Daying Quan, Mingmin Zhu, Xiaofeng Wang, Ming Zheng, Jingjian Li, Jianhua Chen · 2024
Read Rate adaptive compressed sampling based on region division for wireless sensor networks by Wei Wang, Xiaoping Jin, Daying Quan, Mingmin Zhu, Xiaofeng Wang, Ming Zheng, Jingjian Li, Jianhua Chen (2024) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/pmc-11607344.txt.
Description
Wei Wang and seven co-authors design smarter sampling for camera sensor networks, in a 2024 paper. Wireless sensor nodes have tight energy and bandwidth budgets, so sending full images is costly. Block compressed sampling grabs fewer measurements up front and rebuilds the image later. The catch: the right sampling rate depends on how complex each block is, and the node never sees the full picture.
Their scheme first splits the image into smooth and complex regions using a cheap helper vector. Smooth blocks are divided into a mean part, kept with a single measurement, and a leftover part whose sparseness is estimated by a probability model. Complex regions get a higher base rate plus adaptive extras based on each block's own statistics. Experiments showed lower total sampling rates and clearly better rebuilt images than fixed-rate schemes.
Catalog record
| CREATOR | Wei Wang, Xiaoping Jin, Daying Quan, Mingmin Zhu, Xiaofeng Wang, Ming Zheng, Jingjian Li, Jianhua Chen |
|---|---|
| YEAR | 2024 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 64 KB |
| VERSION | 1.0 |
| LICENSE | CC BY 4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |