2D signal compression via parallel compressed sensing with permutations
Bibliographic record
Abstract
In this paper, we propose a new scheme to compress 2D signals using parallel compressed sensing. According to this scheme, the reconstruction at the decoder can be performed in parallel. By performing certain permutation on a 2D signal, all columns are insured to have approximately the same density level and can be sampled using the same measurement matrix. In this way, vectorization of a 2D signal can be avoided, and thus the size of the measurement matrix can be dramatically reduced. We prove that with a good permutation, we can have a tighter upper bound on reconstruction mean square error. To illustrate this scheme, we apply it to video compression and use two kinds of permutations for different frames: the zigzag-scan-based permutation for reference frames and the block-test-based permutation for non-reference frames. Simulation results show that under the same compression ratio, the peak signal-to-noise ratio can be improved by approximately 3-7 dB compared to the case without permutation.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".