MétaCan
Menu
Back to cohort
Record W1506813957 · doi:10.1002/sec.1221

A high capacity data hiding algorithm for H.264/AVC video

2015· article· en· W1506813957 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueSecurity and Communication Networks · 2015
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Steganography and Watermarking Techniques
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceAlgorithmInformation hidingEmbeddingBlock (permutation group theory)Discrete cosine transformWatermarkSIGNAL (programming language)BitstreamDistortion (music)Real-time computingTelecommunicationsArtificial intelligenceImage (mathematics)Decoding methodsBandwidth (computing)Mathematics

Abstract

fetched live from OpenAlex

Abstract This article presents an information hiding algorithm for H.264/AVC video stream. It utilizes position of the last nonzero level of quantized discrete cosine transform block to embed information bits. Because only the high‐frequency levels are changed, it can guarantee a high peak signal‐to‐noise ratio and slight increase in bit rate after the watermark embedding. The extraction process is not complex; thus, the proposed technique is an excellent solution for real‐time applications such as broadcasting. Experimental results on several test sequences demonstrate that the proposed approach can realize blind extraction with real‐time performance; it also provides very high capacity, low distortion and increase in bit rate by about 0.5%. Copyright © 2015 John Wiley & Sons, Ltd.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.689
Threshold uncertainty score0.506

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.060
GPT teacher head0.283
Teacher spread0.223 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it