MétaCan
Menu
Back to cohort
Record W2136070424 · doi:10.5539/cis.v6n2p31

A Digital Watermarking Algorithm Based on Chaos in Interpolatory Orthogonal Multiwavelets Domain

2013· article· en· W2136070424 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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueComputer and Information Science · 2013
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Steganography and Watermarking Techniques
Canadian institutionsnot available
FundersNational Science Foundation
KeywordsDigital watermarkingScramblingComputer scienceChaoticImage (mathematics)AlgorithmCHAOS (operating system)WatermarkDomain (mathematical analysis)Logistic mapScheme (mathematics)Image processingSecrecyWaveletComputer visionArtificial intelligenceMathematicsComputer security

Abstract

fetched live from OpenAlex

Based on chaotic scrambling, we proposed a digital image watermarking scheme in interpolatory orthogonal multiwavelets transforming domain. At first, the logistic chaotic mapping and arnold transformating are employed to scramble the original watermarking image, then the watermark information is embedded into the middle frequency interpolatory orthogonal multiwavelets transforming coefficients of the image. Experimental results showed that the scheme has high secrecy intensity and ability against the general image processing attack.

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 categoriesScholarly communication
Consensus categoriesScholarly communication
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.993
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.015
Open science0.0010.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.006
GPT teacher head0.214
Teacher spread0.208 · 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