A Novel Approach for Digital Image Compression in Some Fixed Point Results on Complete G-metric Space Using Comparison Function
Bibliographic record
Abstract
In the present time world, digital images are crucial for various applications, that includes the medical industry, aircraft and satellite imaging, underwater imaging and so on. For this huge quantities of digital images are produced and used by these applications. For a variety of reasons, these images also need to be transmitted and stored. Therefore, a technique known as compression is applied to resolve this storage issue while transmitting these images. In this article, by extending some unique fixed point theorem results for comparison function on a complete symmetric G-metric space are used and it is a new approach. Moreover, this paper focuses on a compression method using the new structure of extended G-contraction mapping as it assists in compressing the size of the image. Thus, grayscale images are compressed using extended G-contraction mapping. And thus, grayscale images can be represented as matrices in this structure (pixel values). Also, similar images of reduced size can be obtained using an appropriate matrix G-metric and extended G-contraction mapping. The size of the matrix can be substantially reduced without losing any quality by controlling the order of sub matrices. These images are easy to store and transmit, with little variation between the original and contracted image.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".