A High-Capacity Reversible Data-Hiding Scheme for Medical Image Transmission Using Modified Elias Gamma Encoding
Bibliographic record
Abstract
Reversible data hiding (RDH) is a recently emerged research domain in the field of information security domain with broad applications in medical images and meta-data handling in the cloud. The amount of data required to handle the healthcare sector has exponentially increased due to the increase in the population. Medical images and various reports such as discharge summaries and diagnosis reports are the most common data in the healthcare sector. The RDH schemes are widely explored to embed the medical reports in the medical image instead of sending them as separate files. The receiver can extract the clinical reports and recover the original medical image for further diagnosis. This manuscript proposes an approach that uses a new lossless compression-based RDH scheme that creates vacant room for data hiding. The proposed scheme uses run-length encoding and a modified Elias gamma encoding scheme on higher-order bit planes for lossless compression. The conventional Elias gamma encoding process is modified in the proposed method to embed some additional data bits during the encoding process itself. The revised approach ensures a high embedding rate and lossless recovery of medical images at the receiver side. The experimental study is conducted on both natural images and medical images. The average embedding rate from the proposed scheme for the medical images is 0.75 bits per pixel. The scheme achieved a 0 bit error rate during image recovery and data extraction. The experimental study shows that the newly introduced scheme performs better when compared with the existing RDH 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.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 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".