Sparse Reconstruction of Compressive Sensing Multi-Spectral Data Using an Inter-Spectral Multi-Layered Conditional Random Field Model
Bibliographic record
Abstract
The broadband spectrum contains significantly more information than what the human eye can detect, with different wavelengths providing unique information about the intrinsic properties of an object. Recently, compressive sensing-based strategies for multi-spectral imaging via wavelength filtering at the pixel level on the imaging detector have been proposed for simultaneous acquisition of multi-spectral imaging data greatly reducing the acquisition times. To utilize such compressive sensing strategies for multi-spectral imaging, strong reconstruction algorithms that can reconstruct dense multi-spectral image cubes from the sparse compressively sensed observations are required. This paper proposes a comprehensive inter-spectral multi-layered conditional random field (IS-MCRF) sparse reconstruction framework for multi-spectral compressively sensed data captured using such acquisition strategies. The IS-MCRF framework leverages the information between neighboring spectral bands to better utilize the available information for reconstruction. The proposed framework was evaluated using compressively sensed multi-spectral acquisitions ranging from visible to near infrared spectral bands obtained by a simulated compressive sensing-based multi-spectral imaging system. Results show noticeable improvement over the existing sparse reconstruction techniques for compressive sensing-based multi-spectral imaging systems in preserving spatial and spectral fidelity.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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".