Application of the DCT Algorithm to Protect Image Files with Key Symbols
Bibliographic record
Abstract
Image file protection is an important aspect in managing and transmitting visual data in today's digital era. One effective method for protecting images is to use the Discrete Cosine Transformation (DCT) algorithm based on the principle of randomization with key symbols. This research aims to describe the application of the DCT algorithm in the context of image protection using key symbols as a security method. This research includes the main stages, namely randomization of the original image using predetermined key symbols, transformation of the image to the DCT domain, and storage of the scrambled image. By scrambling the image using key symbols known only to authorized parties, the original image can be changed significantly so that it is difficult to reconstruct by unauthorized parties. In addition, the results of this DCT transformation can also be encrypted using a strong cryptographic algorithm, thereby increasing the security level of image protection. The research results show that this method is effective in protecting image files from unauthorized access and unwanted surveillance. The final result of implementing the DCT algorithm with this key symbol is an image that is protected with a high level of security and can be restored correctly by authorized parties using the appropriate key symbol. This research has broad potential application in a variety of contexts, including data security, confidential image storage, and secure image transmission over communications networks. Thus, this method can make a positive contribution in overcoming information security challenges in an increasingly complex digital era.
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.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".