Minimum-Cost Sensor Channel Selection For Wearable Computing
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929231506702336 |
|---|---|
| author | Sah, Ramesh Kumar Ghasemzadeh, Hassan |
| author_facet | Sah, Ramesh Kumar Ghasemzadeh, Hassan |
| contents | Sensor systems are constrained by design and finding top sensor channel(s) for a given computational task is an important but hard problem. We define an optimization framework and mathematically formulate the minimum-cost channel selection problem. We then propose two novel algorithms of varying scope and complexity to solve the optimization problem. Branch and bound channel selection finds a globally optimal channel subset and the greedy channel selection finds the best intermediate subset based on the value of a score function. Proposed channel selection algorithms are conditioned with performance as well as the cost of the channel subset. We evaluate both algorithms on two publicly available time series datasets of human activity recognition and mental task detection. Branch and bound channel selection achieved a cost saving of up to 94.8% and the greedy search reduced the cost by 89.6% while maintaining performance thresholds. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_00875 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Minimum-Cost Sensor Channel Selection For Wearable Computing Sah, Ramesh Kumar Ghasemzadeh, Hassan Networking and Internet Architecture Sensor systems are constrained by design and finding top sensor channel(s) for a given computational task is an important but hard problem. We define an optimization framework and mathematically formulate the minimum-cost channel selection problem. We then propose two novel algorithms of varying scope and complexity to solve the optimization problem. Branch and bound channel selection finds a globally optimal channel subset and the greedy channel selection finds the best intermediate subset based on the value of a score function. Proposed channel selection algorithms are conditioned with performance as well as the cost of the channel subset. We evaluate both algorithms on two publicly available time series datasets of human activity recognition and mental task detection. Branch and bound channel selection achieved a cost saving of up to 94.8% and the greedy search reduced the cost by 89.6% while maintaining performance thresholds. |
| title | Minimum-Cost Sensor Channel Selection For Wearable Computing |
| topic | Networking and Internet Architecture |
| url | https://arxiv.org/abs/2402.00875 |