A Novel Steganography Scheme Combining Coverless Information Hiding and Steganography
Bibliographic record
Abstract
At present, the coverless information hiding has been developed. However, due to the limited mapping relationship between secret information and feature selection, it is challenging to further enhance the hiding capacity of coverless information hiding. At the same time, the steganography algorithm based on object detection only hides secret information in foreground objects, which contribute to the steganography capacity is reduced. Since object recognition contains multiple objects and location, secret information can be mapped to object categories, the relationship of location and so on. Therefore, this paper proposes a new steganography algorithm based on object detection and relationship mapping, which integrates coverless information hiding and steganography. In this method, the coverless information hiding is realized by mapping the object type, color and secret information in object detection method. At the same time, the object detection method is used to find the safe area to hide secret messages. The proposed algorithm can not only improve the steganographic capacity of the two information hiding methods but also make the coverless information hiding more secure and robust.
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 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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.016 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".