MétaCan
Menu
Back to cohort
Record W3083134464 · doi:10.1186/s13640-020-00524-4

Coverless information hiding based on the generation of anime characters

2020· article· en· W3083134464 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

VenueEURASIP Journal on Image and Video Processing · 2020
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Steganography and Watermarking Techniques
Canadian institutionsUniversity of Windsor
FundersPriority Academic Program Development of Jiangsu Higher Education InstitutionsNational Natural Science Foundation of China
KeywordsAnimeComputer scienceSteganalysisInformation hidingBiometricsArtificial intelligenceRobustness (evolution)CovertSteganographyPattern recognition (psychology)Data miningImage (mathematics)

Abstract

fetched live from OpenAlex

Abstract To fundamentally resist the steganalysis, coverless information hiding has been proposed, and it has become a research hotspot in the field of covert communication. However, the current methods not only require a huge image database, but also have a very low hidden capacity, making it difficult to apply practically. In order to solve the above problems, we propose a coverless information hiding method based on the generation of anime characters, which first converts the secret information into an attribute label set of the anime characters, and then uses the label set as a driver to directly generate anime characters by using the generative adversarial networks (GANs). The experimental results show that compared with the current methods, the hidden capacity of the proposed method is improved by nearly 60 times, and it also has good performance in image quality and robustness.

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.000
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: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.901
Threshold uncertainty score0.492

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.002
Open science0.0000.000
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.033
GPT teacher head0.257
Teacher spread0.224 · 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