An Information-Theoretic Framework for Joint CS-ICA Recovery of Sparse Biosignals
Bibliographic record
Abstract
The aim of this study is to propose an information-theoretic framework for compressed sensing (CS)-independent component analysis (ICA) algorithms that can be used for the joint recovery of sparse biosignals. The proposed framework supports real-time patient monitoring systems that enhance the detection, tracking, and monitoring of vital signs remotely via wearable biosensors. Specifically, we address the problem of sparse signal recovery and acquisition in wearable biosensor networks, where we present a new analysis of CS-ICA algorithms from an information theory perspective to compute the sampling rate required to recover sparse biosignals corrupted by motion artifacts and interference, which to the best of our knowledge, has not been studied before. Our analysis and examples indicate that the proposed approach helps to develop low-cost, low-power edge computing devices while improving data quality and accuracy for a given measurement. We also show that, under noisy measurement conditions, the CS-ICA algorithm can outperform the standard CS method, where a biosignal can be retrieved in only a few measurements. By implementing the sensing framework, the error in reconstructing biosignals is reduced, and a digital-to-analog converter operates at low-speed and low-resolution.
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.002 | 0.005 |
| 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.002 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".