A modified Vector Quantization based image compression technique using wavelet transform
Bibliographic record
Abstract
An image compression method combining discrete wavelet transform (DWT) and vector quantization (VQ) is presented. First, a three-level DWT is performed on the original image resulting in ten separate subbands (ten codebooks are generated using the Self Organizing Feature Map algorithm, which are then used in Vector Quantization, of the wavelet transformed subband images, i.e. one codebook for one subband). These subbands are then vector quantized. VQ indices are Huffman coded to increase the compression ratio. A novel iterative error correction scheme is proposed to continuously check the image quality after sending the Huffman coded bit stream of the error codebook indices through the channel so as to improve the peak signal to noise ratio (PSNR) of the reconstructed image. Ten error codebooks (each for each subband of the wavelet transformed image) are also generated for the error correction scheme using the difference between the original and the reconstructed images in the wavelet domain. The proposed method shows better image quality in terms of PSNR at the same compression ratio as compared to other DWT and VQ based image compression techniques found in the literature. The proposed method of image compression is useful for various applications in which high quality (i.e. high precision) are critical (like criminal investigation, medical imaging, etc).
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.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 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".