Securing Multimedia Using a Deep Learning Based Chaotic Logistic Map
Bibliographic record
Abstract
Telemedicine and online consultations with doctors has become very popular during the pandemic and involves the transmission of medical data through the internet. Thus this raises concern about the security of the medical data of the patient as the records to contain sensitive and confidential information. A Secure multimedia transformation approach is proposed in this paper using a deep learning-based chaotic logistic map. The proposed work achieves novelty by the integration of a lightweight encryption function using a chaotic logistic map. It also uses the ResNet model to perform classification for identifying the fake medical multimedia data. A linear feedback shift register operations and an interactive user interface facilitate ease of usage to secure the medical multimedia data. The chaotic map provides the security properties such as confusion and diffusion necessary for the encryption ciphers. At the same time, they are highly sensitive to input conditions, thus making the proposed encryption algorithm more secure and robust. The proposed encryption mechanism helps in securing the medical image and video data. On the receiver side, Multilayer perceptions (MLP) of the deep learning approach are used to classify the medical data according to the features required to make other processes. When tested, the proposed work proves efficient in securing medical data against various cyber-attacks and exhibits high entropy levels.
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.001 |
| 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".