Lossy Image Compression -- A Frequent Sequence Mining perspective employing efficient Clustering

• URL: http://arxiv.org/abs/2601.18821v1
• Date: Sat, 24 Jan 2026 20:44:55 GMT
• Title: Lossy Image Compression -- A Frequent Sequence Mining perspective employing efficient Clustering
• Authors: Avinash Kadimisetty, Oswald C, Sivaselvan B, Alekhya Kadimisetty,
• Abstract summary: This work explores the scope of Frequent Sequence Mining in the domain of Lossy Image Compression.<n>The DCT phase in JPEG is replaced with a combination of closed frequent sequence mining and k-means clustering to handle the redundant data effectively.
• Score: 0.5833117322405447
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This work explores the scope of Frequent Sequence Mining in the domain of Lossy Image Compression. The proposed work is based on the idea of clustering pixels and using the cluster identifiers in the compression. The DCT phase in JPEG is replaced with a combination of closed frequent sequence mining and k-means clustering to handle the redundant data effectively. This method focuses mainly on applying k-means clustering in parallel to all blocks of each component of the image to reduce the compression time. Conventional GSP algorithm is refined to optimize the cardinality of patterns through a novel pruning strategy, thus achieving a good reduction in the code table size. Simulations of the proposed algorithm indicate significant gains in compression ratio and quality in relation to the existing alternatives.

Related papers

• Frequent Pattern Mining approach to Image Compression [0.0]
  The paper focuses on Image Compression, explaining efficient approaches based on Frequent Pattern Mining(FPM)<n>The proposed compression mechanism is based on clustering similar pixels in the image and thus using cluster identifiers in image compression.<n>Redundant data in the image is effectively handled by replacing the DCT phase of conventional JPEG through a mixture of k-means Clustering and Closed Frequent Sequence Mining.
  arXiv  Detail & Related papers  (2026-01-24T20:32:16Z)
• COLI: A Hierarchical Efficient Compressor for Large Images [18.697445453003983]
  Implicit Neural Representations (INRs) present a promising alternative by learning continuous mappings from spatial coordinates to pixel intensities for individual images.<n>We introduce COLI (Compressor for Large Images), a novel framework leveraging Neural Representations for Videos (NeRV)<n>We show that COLI consistently achieves competitive or superior PSNR and SSIM metrics at significantly reduced bits per pixel (bpp) while accelerating NeRV training by up to 4 times.
  arXiv  Detail & Related papers  (2025-07-15T16:07:07Z)
• Continuous Patch Stitching for Block-wise Image Compression [56.97857167461269]
  We propose a novel continuous patch stitching (CPS) framework for block-wise image compression.<n>Our CPS framework achieves the state-of-the-art performance against existing baselines, whilst requiring less than half of computing resources of existing models.
  arXiv  Detail & Related papers  (2025-02-24T03:11:59Z)
• FD-LSCIC: Frequency Decomposition-based Learned Screen Content Image Compression [67.34466255300339]
  This paper addresses three key challenges in SC image compression: learning compact latent features, adapting quantization step sizes, and the lack of large SC datasets.<n>We introduce an adaptive quantization module that learns scaled uniform noise for each frequency component, enabling flexible control over quantization granularity.<n>We construct a large SC image compression dataset (SDU-SCICD10K), which includes over 10,000 images spanning basic SC images, computer-rendered images, and mixed NS and SC images from both PC and mobile platforms.
  arXiv  Detail & Related papers  (2025-02-21T03:15:16Z)
• Learned Image Compression for HE-stained Histopathological Images via Stain Deconvolution [33.69980388844034]
  In this paper, we show that the commonly used JPEG algorithm is not best suited for further compression. We propose Stain Quantized Latent Compression, a novel DL based histopathology data compression approach. We show that our approach yields superior performance in a classification downstream task, compared to traditional approaches like JPEG.
  arXiv  Detail & Related papers  (2024-06-18T13:47:17Z)
• Learned Lossless Compression for JPEG via Frequency-Domain Prediction [50.20577108662153]
  We propose a novel framework for learned lossless compression of JPEG images. To enable learning in the frequency domain, DCT coefficients are partitioned into groups to utilize implicit local redundancy. An autoencoder-like architecture is designed based on the weight-shared blocks to realize entropy modeling of grouped DCT coefficients.
  arXiv  Detail & Related papers  (2023-03-05T13:15:28Z)
• Modeling Image Quantization Tradeoffs for Optimal Compression [0.0]
  Lossy compression algorithms target tradeoffs by quantizating high frequency data to increase compression rates. We propose a new method of optimizing quantization tables using Deep Learning and a minimax loss function.
  arXiv  Detail & Related papers  (2021-12-14T07:35:22Z)
• Implicit Neural Representations for Image Compression [103.78615661013623]
  Implicit Neural Representations (INRs) have gained attention as a novel and effective representation for various data types. We propose the first comprehensive compression pipeline based on INRs including quantization, quantization-aware retraining and entropy coding. We find that our approach to source compression with INRs vastly outperforms similar prior work.
  arXiv  Detail & Related papers  (2021-12-08T13:02:53Z)
• Kullback-Leibler Divergence-Based Fuzzy $C$-Means Clustering Incorporating Morphological Reconstruction and Wavelet Frames for Image Segmentation [152.609322951917]
  We come up with a Kullback-Leibler (KL) divergence-based Fuzzy C-Means (FCM) algorithm by incorporating a tight wavelet frame transform and a morphological reconstruction operation. The proposed algorithm works well and comes with better segmentation performance than other comparative algorithms.
  arXiv  Detail & Related papers  (2020-02-21T05:19:10Z)
• Residual-Sparse Fuzzy $C$-Means Clustering Incorporating Morphological Reconstruction and Wavelet frames [146.63177174491082]
  Fuzzy $C$-Means (FCM) algorithm incorporates a morphological reconstruction operation and a tight wavelet frame transform. We present an improved FCM algorithm by imposing an $ell_0$ regularization term on the residual between the feature set and its ideal value. Experimental results reported for synthetic, medical, and color images show that the proposed algorithm is effective and efficient, and outperforms other algorithms.
  arXiv  Detail & Related papers  (2020-02-14T10:00:03Z)
• A GAN-based Tunable Image Compression System [13.76136694287327]
  This paper rethinks content-based compression by using Generative Adversarial Network (GAN) to reconstruct the non-important regions. A tunable compression scheme is also proposed in this paper to compress an image to any specific compression ratio without retraining the model.
  arXiv  Detail & Related papers  (2020-01-18T02:40:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.