Generic Compressive Matrix Sensing
Generic compressive sensing framework where the measurement process is modelled as y = A*x + n with A being an explicit M x N sensing matrix (M < N). This covers any linear inverse problem including random Gaussian, Bernoulli, or structured sensing matrices. The compressed sensing theory of Candes, Romberg, and Tao guarantees exact recovery when x is sparse and A satisfies the restricted isometry property (RIP). Reconstruction uses standard proximal algorithms (FISTA, ADMM) with sparsity-promoting regularizers (L1, TV, wavelet).
Explicit Matrix
Gaussian
fista l2
GENERIC
Forward-Model Signal Chain
Each primitive represents a physical operation in the measurement process. Arrows show signal flow left to right.
M(Φ) → D(g, η₁)
Benchmark Variants & Leaderboards
Matrix
Generic Matrix Sensing
M(Φ) → D(g, η₁)
Standard Leaderboard (Top 10)
| # | Method | Score | PSNR (dB) | SSIM | Trust | Source |
|---|---|---|---|---|---|---|
| 🥇 | FlowHSI | 0.884 | 38.58 | 0.982 | ✓ Certified | Huang et al., arXiv 2025 |
| 🥈 | ScoreSCI | 0.877 | 38.22 | 0.980 | ✓ Certified | Chen et al., NeurIPS 2024 |
| 🥉 | DiffusionHSI | 0.872 | 37.95 | 0.978 | ✓ Certified | Zhang et al., ICCV 2024 |
| 4 | PromptSCI | 0.860 | 37.35 | 0.975 | ✓ Certified | Bai et al., ICCV 2024 |
| 5 | CSTrans | 0.855 | 37.12 | 0.973 | ✓ Certified | Liu et al., CVPR 2024 |
| 6 | HiSViT+ | 0.850 | 36.85 | 0.971 | ✓ Certified | Tao et al., ECCV 2024 |
| 7 | CST | 0.831 | 35.92 | 0.965 | ✓ Certified | Liu et al., ICCV 2023 |
| 8 | Restormer | 0.826 | 35.68 | 0.962 | ✓ Certified | Zamir et al., CVPR 2022 |
| 9 | MST-L | 0.820 | 35.4 | 0.960 | ✓ Certified | Cai et al., CVPR 2022 |
| 10 | EfficientSCI | 0.795 | 34.21 | 0.949 | ✓ Certified | Wang et al., IEEE TIP 2023 |
Showing top 10 of 14 methods. View all →
Mismatch Parameters (3) click to expand
| Name | Symbol | Description | Nominal | Perturbed |
|---|---|---|---|---|
| matrix_perturb | ΔΦ | Matrix element perturbation std | 0 | 0.01 |
| gain | g | Detector gain multiplier | 1.0 | 1.03 |
| sigma_y | σ_y | Measurement noise std | 0 | 0.02 |
Reconstruction Triad Diagnostics
The three diagnostic gates (G1, G2, G3) characterize how reconstruction quality degrades under different error sources. Each bar shows the relative attribution.
Model: explicit matrix — Mismatch modes: matrix perturbation, quantization error, model mismatch
Noise: gaussian — Typical SNR: 15.0–50.0 dB
Requires: sensing matrix, noise variance
Modality Deep Dive
Principle
Generic matrix sensing models the forward process as y = Ax + n, where A is an arbitrary measurement matrix (not necessarily structured like a convolution or Radon transform). This is the most general compressive sensing framework, applicable to random projections, coded apertures, and any linear dimensionality reduction scheme. The key requirement is that A satisfies the Restricted Isometry Property (RIP) for successful sparse recovery.
How to Build the System
Implementation depends on the physical sensing modality. For optical random projections, use a DMD or scattering medium to implement pseudo-random measurement vectors. Calibrate the measurement matrix A by measuring the system response to a complete basis set (e.g., Hadamard patterns). Store A as a dense or structured matrix. Ensure the measurement SNR is adequate for the desired reconstruction quality.
Common Reconstruction Algorithms
- ISTA / FISTA (Iterative Shrinkage-Thresholding Algorithm)
- Basis pursuit (L1 minimization via linear programming)
- AMP (Approximate Message Passing)
- ADMM with various regularizers (TV, wavelet sparsity, low-rank)
- Learned ISTA (LISTA) and other deep unfolding networks
Common Mistakes
- Measurement matrix does not satisfy RIP (too coherent or poorly conditioned)
- Mismatch between calibrated A and actual system behavior (model error)
- Not accounting for measurement noise level when setting regularization strength
- Using an insufficiently sparse signal model for the reconstruction
- Ignoring quantization effects of the detector in the measurement model
How to Avoid Mistakes
- Verify the condition number and coherence of A; use random or optimized designs
- Re-calibrate A periodically to account for system drift
- Set regularization parameter proportional to noise level (e.g., via cross-validation)
- Validate sparsity assumption on representative signals before deploying CS
- Include quantization noise in the forward model or use dithering techniques
Forward-Model Mismatch Cases
- The widefield fallback applies a Gaussian blur (shape-preserving convolution), but the correct compressed sensing operator applies a random measurement matrix y = Phi*x that projects the image into a lower-dimensional space
- Gaussian blur preserves spatial locality and image structure, whereas the random measurement matrix scrambles all spatial information — the fallback measurements contain no compressed-sensing-compatible encoding
How to Correct the Mismatch
- Use the correct compressed sensing operator with the measurement matrix Phi (Gaussian random, partial Fourier, or structured random), producing y = Phi * vec(x)
- Reconstruct using L1/TV-regularized optimization (ISTA, ADMM) or learned proximal operators designed for the specific measurement matrix structure
Experimental Setup
256x256
0.25
Gaussian random / partial Fourier
low-rank or sparse
FISTA-L2 / ADMM / ISTA-Net
Signal Chain Diagram
Key References
- Candes et al., 'Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information', IEEE TIT 52, 489-509 (2006)
- Donoho, 'Compressed sensing', IEEE TIT 52, 1289-1306 (2006)
Canonical Datasets
- Set11 / BSD68 (simulation benchmarks)