Compression of aerial ortho images based on image denoising
Bibliographic record
Abstract
Abstract only given. Discusses the compression of an important class of computer images, called aerial ortho images, that result from geodetic transformation computations [Kinsner, 1994]. The computations introduce numerical noise, making the images nearly incompressible losslessly because of their high entropy. The use of classical lossy compression schemes is also not desirable because their effects on the original image are unknown. We then propose the use of image denoising coupled with lossless image compression, that preserves selected image characteristics. Two denoising schemes for a compression ratio of 2:1 are compared. The first scheme is based on a Donoho's (1992) wavelet shrinking scheme which preserves image smoothness. We study the effect of various shrinking parameter values on the compression ratio and image quality, where 35.5 dB peak signal-to-noise ratio (PSNR) is obtained for a compression ratio of 2.03:1. This approach preserves high-frequency information, so that sharp edges do not become blurred as in classical filtering methods. This is critically important, because the main feature of ortho images is in its flatness and its precision of edge position. The second scheme is based on preserving pixel predictability [Kostelich and Schreiber, 1993), leading to a variant of planar predictive coding. This approach adds, to the edge preserving capability, the limitation in pixel deviation between the original and denoised images to be within one grayscale level. As a result, two different predictive coding schemes achieve a compression ratio of 2:1 at 49.9 dB and 51.2 dB PSNR.
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 distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| 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.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".