MétaCan
Menu
Back to cohort
Record W2048276776 · doi:10.1109/mlsp.2013.6661920

An adaptive encryption based genetic algorithms for medical images

2013· article· en· W2048276776 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicChaos-based Image/Signal Encryption
Canadian institutionsUniversity of Guelph
Fundersnot available
KeywordsEncryptionRobustness (evolution)Computer scienceProbabilistic encryption40-bit encryptionAlgorithmMultiple encryptionPixelEntropy (arrow of time)Computer visionComputer network

Abstract

fetched live from OpenAlex

This paper presents a novel efficient symmetric encryption technique that can be applied to medical images. It uses genetic algorithm which makes it highly adaptive. Standard DI-COM images are segmented into a number of regions based on pixel intensity and entropy measurements. The novelty of the selective encryption method lies in the use of several encryption algorithms with variable key lengths to control the processing time required for the encryption process and the robustness quality. Encryption processing time, robustness of the encrypted image and the side information required for transmission of the decryption key are the main parameters for optimization. The trade-off among them stems from the variation in processing time with the key length of encryption algorithm, image size, number of regions and the side information to reduce processing time while maintaining a high level of robustness.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.970
Threshold uncertainty score0.899

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.

Opus teacher head0.017
GPT teacher head0.269
Teacher spread0.252 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations27
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicChaos-based Image/Signal EncryptionFrench-language works237,207