Joint watermarking and compression using scalar quantization for maximizing robustness in the presence of additive Gaussian attacks
Bibliographic record
Abstract
In joint watermarking and compression (JWC), a key process is quantization which embeds watermarks into a host signal while digitizing the host signal subject to requirements on the embedding rate, compression rate, quantization distortion, and robustness. Using fixed-rate scalar quantization for watermarking and compression, in this paper, we mainly consider how to design binary JWC systems to maximize the robustness of the systems in the presence of additive Gaussian attacks under constraints on the compression rate and quantization distortion. We first investigate optimum decoding of a binary JWC system, and demonstrate by experiments that in the distortion-to-noise ratio (DNR) region of practical interest, the minimum distance (MD) decoder achieves performance comparable to that of the maximum likelihood decoder in addition to having advantages of low computation complexity and being independent of the statistics of the host signal. We then present optimum binary JWC encoding schemes using fixed-rate scalar quantization and the MD decoder. Simulation results show that optimum binary JWC systems using nonuniform quantization are better than optimum binary JWC systems using uniform quantization. Furthermore, in comparison with separate watermarking and compression systems, optimum binary JWC systems using nonuniform quantization achieve significant DNR gains in the DNR region of practical interest. Finally, spread transform dither modulation is applied to improving the robustness of the JWC systems at low DNRs.
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.001 |
| 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".