IMG‐forensics: Multimedia‐enabled information hiding investigation using convolutional neural network
Bibliographic record
Abstract
Abstract Information hiding aims to embed a crucial amount of confidential data records into the multimedia, such as text, audio, static and dynamic image, and video. Image‐based information hiding has been a significantly important topic for digital forensics. Here, active image deep steganographic approaches have come forward for hiding data. The least significant bit (LSB) steganography approach is proposed to conceal a secret message into the original image. First, the lightweight stream encryption cryptography encrypts secret information in the cover image to protect embedded information from source to destination. Whereas the encrypted embedded cover information into the carrier of stego‐image with the help of the LSB and then transmit. In the proposed investigational scheme, a convolutional neural net is used. A model is trained to detect and extract patterns of image hidden features, encrypted stego‐image optimization, and classify original and cover images of steganography. Through the experiment result on the forensic image database for mobile steganography of the Center for Statistics and Application in Forensic Evidence, the overall embedded and extracting that the proposed scheme can achieve information hiding as well as revealing with an accuracy rate of 95.1%. The experimental result shows the robustness of the model in terms of efficiency as compared to other state‐of‐the‐art schemes.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".