Reduced bit median quantization: A middle process for Efficient Image Compression

Fikresilase Wondmeneh Abebayew

Home/Archive/arXiv

arXiv · 2409.13789

Reduced bit median quantization: A middle process for Efficient Image Compression

Fikresilase Wondmeneh Abebayew

View original source ↗Read source document ↗Export metadata ↓

Abstract

Image compression techniques have made remarkable progress when it comes to file size reduction with a tolerable quality reduction; nonetheless, they are facing some challenges when it comes to applying more compression with the same perceptible quality or in accounting for specific use cases such as deep archive files and more efficient image transfers. Previous techniques have tried to solve the former problem by applying one specific or a combination of different algorithms. However, none of these methods were able to achieve additional file size reduction beyond a certain compression. I introduce Reduced Bit Median Quantization (RBMQ), a middle-process image compression technique designed to enhance file size reduction so that it can be stored with already existing file extension formats. In RBMQ by applying only the first step in which the quantization of valued further file size reduction can be achieved without a noticeable decrease in the image quality. Furthermore, more size reduction can be achieved by reducing the representing bits for the quantized values which can be optimal for deep archival storage or big-size image transfer in which the image quality is not suitable for the human eye since it is dark and dim but can be much efficient to interact with network and storage components later to be decoded to get the only quantized value image that almost the same quality with the original one. RBMQ introduces redundancy to the pixel values to be taken advantage of by existing compression techniques furthermore it introduces bit reduction from 8 to 5 bits for image file extensions such as jpeg which substantially reduces the file size to be used for JPEG file transfers and deep archive storage.

Explore related subjects

eess.IV cs.IT math.IT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Fikresilase Wondmeneh Abebayew. 2024-10-25. Reduced bit median quantization: A middle process for Efficient Image Compression. https://arxiv.org/abs/2409.13789

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Bridging the Inter-Domain Gap through Low-Level Features for Cross-Modal Medical Image Segmentation

This paper addresses cross-modal medical image segmentation, focusing on MRI-CT transfer in a source-only domain generalization setting. During training, only source-modality samples are available, while unlabeled target-modality images are used for testing. We propose LowBridge, which builds on the observation that cross-modal images share similar low-level features (e.g. edges) as they depict the same types of anatomical structures. Specifically, we first train a generative model to recover the source images from their edge features, followed by training a segmentation model on the generated source images, separately. At test time, edge features from the target images are input to the pretrained generative model to generate source-style target domain images, which are then segmented using the pretrained segmentation network. Experiments on various public datasets demonstrate that LowBridge achieves state-of-the-art performance, outperforming ten existing approaches. Ablation studies further show that LowBridge is compatible with different types of generative and segmentation models, suggesting its generalizability and potential to benefit from future advances in these models. The code will be available at https://github.com/JoshuaLPF/LowBridge.

eess.IV↗

arXiv2026

Revolutionizing Diffusion MRI Microstructure Mapping via Global Inversion

Diffusion MRI microstructure mapping (MM) is conventionally solved voxel by voxel, ignoring the fact that tissue microstructure forms a spatially organized field. This isolation leaves each estimation problem ill-posed and nonconvex. We instead cast MM as a single global inverse problem, reconstructing the entire parameter field jointly from all measurements of a subject. An untrained neural representation supplies implicit spatial priors and eases the nonconvex optimization, requiring no training data, while coregistered T1-weighted anatomy contributes structural guidance that is freely available in standard protocols. On both synthetic and in-vivo data, our method compares favorably with established voxel-wise and learning-based baselines, suggesting global inversion is a promising alternative.

eess.IV↗

arXiv2026

LC3EM: Long-Range Context Extrapolation Enhanced Entropy Model for Coordinate-based Overfitting Image Codecs

Coordinate-based overfitting image codecs have attracted increasing attention for their low decoding complexity and independence from cross-image generalization. However, representative approaches such as COOL-CHIC face an inherent entropy-modeling trade-off: lightweight models have limited capacity, while more expressive ones incur additional bitrate overhead from transmitting image-specific parameters. Inspired by the prediction mechanism in traditional codecs, we propose a new entropy-modeling strategy that introduces complementary prediction modes with region-adaptive soft mode selection, rather than relying on a single learned predictor to model diverse types of redundancy. Based on this concept, we develop a Long-Range Context Extrapolation Enhanced Entropy Model (LC3EM), which can be integrated into coordinate-based overfitting codecs. Specifically, a parameter-free Neighborhood-based Linear Extrapolation Mode (NLEM) complements the tiny MLP-based local predictor to exploit long-range contextual redundancy and strongly directional structures. A Minimum-Entropy-Inspired Continuous Mode Selection strategy is designed to adaptively fuse these two complementary modes, while requiring the transmission of only the parameters of a single additional linear layer. Moreover, to alleviate the mismatch between training-time relaxed and actual discrete quantization, we introduce a lightweight iterative latent rounding refinement stage to improve compression performance. Experiments demonstrate consistent improvements across diverse benchmarks, particularly on highly regular computer-generated images. When integrated with COOL-CHIC 4.0, the proposed method achieves BD-rate gains of -3.43\% and -7.69\% on the SIQAD and API datasets, respectively. With COOL-CHIC 5.0 as the backbone, the corresponding gains are -2.88\% and -3.15\%, respectively. The code will be made publicly available soon.

eess.IV↗