Robust Representation Learning Solutions for Wireless Sensing Applications
Bibliographic record
Abstract
WiFi sensing, a technique for utilizing wireless signals for monitoring human activities and environmental conditions, holds substantial potential in diverse applications including human activity recognition (HAR). It offers a powerful, continuous, and non-intrusive monitoring solution. This technology eliminates the need for wearable sensors, and even functions outside the line-of-sight. However, the large-scale deployment of WiFi sensing faces several challenges: (1) limited computational power in WiFi devices, (2) the cost and complexity of annotating channel state information (CSI) data, and (3) ensuring model generalization across different environments. The first part of the thesis addresses the limited computation power of edge devices by developing a Real-time Sensing and Compression Network (RSCNet). RSCNet is a cloud-based architecture designed to alleviate computational constraints on edge devices. It achieves this through efficient CSI compression at the edge and subsequent sensing and reconstruction in the cloud. RSCNet employs window-based CSI compression and LSTM-based recurrent blocks, significantly reducing computational demands and communication overheads while maintaining high sensing accuracy. The second part of the thesis addresses the issue of limited labeled data by developing self-supervised learning (SSL) method, namely Context-Aware Predictive Coding (CAPC) method. CAPC combines contrastive predictive coding with the Barlow Twins method, enhancing the model's ability to learn robust representations from unlabeled CSI time-series data. This approach improves model generalization, particularly when labeled data is scarce. CAPC also introduces a novel augmentation technique, dual view, which isolates free space propagation information from hardware distortions, further enhancing representation quality for WiFi sensing applications. Through extensive evaluations, this thesis demonstrates the effectiveness of both RSCNet and CAPC. RSCNet achieves results on par with the state-of-the-art performance in HAR tasks while drastically reducing computational burdens on edge devices. CAPC outperforms baseline SSL approaches and traditional supervised methods, showcasing its superior generalization capabilities in unseen environments. The dual view augmentation further enhances CAPC's performance by reducing electronic distortions. This thesis concludes that RSCNet and CAPC contribute significantly to the advancement of robust and practical wireless sensing technologies. These frameworks address critical challenges in the field, paving the way for wider adoption of WiFi sensing in real-world applications.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".