MétaCan
Menu
Back to cohort
Record W2270260829

Optimal Image Watermarking Algorithm Based on LWT-SVD via Multi-objective Ant Colony Optimization

2011· article· en· W2270260829 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

VenueJ. Inf. Hiding Multim. Signal Process. · 2011
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Steganography and Watermarking Techniques
Canadian institutionsUniversité Laval
Fundersnot available
KeywordsDigital watermarkingWatermarkRobustness (evolution)Ant colony optimization algorithmsSingular value decompositionAlgorithmScalingMathematical optimizationAnt colonyComputer scienceSingular valueTransparency (behavior)MathematicsImage (mathematics)Artificial intelligence
DOInot available

Abstract

fetched live from OpenAlex

In this paper, a new optimal watermarking scheme based on lifting wavelet transform (LWT) and singular value decomposition (SVD) using multi-objective ant colony optimization (MOACO) is presented. The singular values of the binary water- mark are embedded in a detail subband of host image. To achieve the highest possible robustness without losing watermark transparency, multiple scaling factors (MSF) are used instead of a single scaling factor (SSF). Determining the optimal values of the mul- tiple scaling factors (MSF) is a dicult problem. However, to determine these values, a multi-objective ant colony-based optimization method is used. Experimental results show much improved performances in terms of transparency and robustness for the proposed method compared to other watermarking schemes. Furthermore, the proposed scheme does not suer from the problem of high probability of false positive detections of the watermarks.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.465
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0010.000
Scholarly communication0.0000.002
Open science0.0010.000
Research integrity0.0000.001
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.023
GPT teacher head0.257
Teacher spread0.234 · 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