MétaCan
Menu
Back to cohort
Record W2109230227 · doi:10.1109/isie.2005.1529103

Efficient encryption of compressed color images

2005· article· en· W2109230227 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicChaos-based Image/Signal Encryption
Canadian institutionsUniversity of Toronto
FundersTsinghua Shenzhen International Graduate SchoolNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceEncryptionComputer visionArtificial intelligenceComputer graphics (images)Computer security

Abstract

fetched live from OpenAlex

An efficient, secure color image coder based on color set partitioning in hierarchical trees (C-SPIHT) compression and partial encryption is presented. Confidentiality of the image data is achieved by encrypting only the significance bits of individual wavelet coefficients for K iterations of the C-SPIHT algorithm. The use of a stream cipher and the encryption of a small number of bits keeps computational demands at a minimum and makes the technique suitable for hardware implementation. By varying K, the level of confidentiality vs. processing overhead can be controlled. It was found that using K = 2 achieved an adequate level of security for test images coded at 0.8 bpp, resulting in an average of only 0.33% of the coded image being encrypted.

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.724
Threshold uncertainty score0.398

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.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.009
GPT teacher head0.234
Teacher spread0.225 · 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

Citations6
Published2005
Admission routes2
Has abstractyes

Explore more

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