A Robust Algorithm for Digital Image Copyright Protection and Tampering Detection: Employing DWT, DCT, and Blowfish Techniques
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.
Bibliographic record
Abstract
With the rapid proliferation of digital images on the internet, the task of preserving image ownership and ensuring the detection of unauthorized alterations has become increasingly challenging.This study introduces a robust algorithm, leveraging Discrete Wavelet Transform (DWT), Discrete Cosine Transform (DCT), and Blowfish encryption techniques, designed to maintain copyright integrity and detect image tampering.The proposed algorithm operates on a given RGB host image, first isolating it into its constituent red, green, and blue components.For the purpose of copyright protection, the algorithm applies DWT and DCT to the green component, embedding a watermark logo within it.The blue component is subjected to Blowfish encryption, generating a ciphered blue component that aids in tampering detection.Subsequently, the least significant bits of this ciphered blue component are interchanged with those of the host image's red component, producing a novel red component.This process results in the creation of a watermarked green component, an original blue component, and a newly formed red component.These are then amalgamated to produce the final watermarked image.The proposed method is evaluated using five standard images, with simulation results demonstrating its resilience to various attacks.Importantly, the algorithm exhibits a capacity to detect any unauthorized modifications up to a granularity of 2×2 pixels.
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 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.001 | 0.002 |
| 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 it