M-Ary Phase Modulation for Digital Watermarking
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
M -Ary Phase Modulation for Digital Watermarking In spread spectrum based watermarking schemes, it is a challenging task to embed multiple bits of information into the host signal. M -ary modulation has been proposed as an effective approach to multibit watermarking. It has been proved that an M -ary modulation based watermarking system outperforms significantly a binary modulation based watermarking system. However, in the existing M -ary modulation based algorithms, the value of M is restricted to be less than 256, because as M increases, the computation workload for data extraction advances exponentially. In this paper, we propose an efficient M -ary modulation scheme, i.e., M -ary phase modulation, which reduces the computation in data extraction to a very low level. With this scheme, it is practical to implement an M -ary modulation based algorithm with a high value of M , e.g., M = 2 20 . This is significant for a watermarking system, because it can either greatly increase the data capacity of a watermark given the necessary watermark robustness, or considerably improve the watermark robustness given the amount of information of the watermark. The superiority of the proposed scheme is verified by simulation results.
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.
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.001 |
| Open science | 0.001 | 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 it