Lossy Image Compression -- A Frequent Sequence Mining perspective employing efficient Clustering
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912851309887488 |
|---|---|
| author | Kadimisetty, Avinash C, Oswald B, Sivaselvan Kadimisetty, Alekhya |
| author_facet | Kadimisetty, Avinash C, Oswald B, Sivaselvan Kadimisetty, Alekhya |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_18821 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Lossy Image Compression -- A Frequent Sequence Mining perspective employing efficient Clustering Kadimisetty, Avinash C, Oswald B, Sivaselvan Kadimisetty, Alekhya Image and Video Processing Artificial Intelligence Multimedia 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. |
| title | Lossy Image Compression -- A Frequent Sequence Mining perspective employing efficient Clustering |
| topic | Image and Video Processing Artificial Intelligence Multimedia |
| url | https://arxiv.org/abs/2601.18821 |