Skip to Main content Skip to Navigation
Conference papers

Subspaces Clustering Approach to Lossy Image Compression

Abstract : In this contribution lossy image compression based on subspaces clustering is considered. Given a PCA factorization of each cluster into subspaces and a maximal compression error, we show that the selection of those subspaces that provide the optimal lossy image compression is equivalent to the 0-1 Knapsack Problem. We present a theoretical and an experimental comparison between accurate and approximate algorithms for solving the 0-1 Knapsack problem in the case of lossy image compression.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Wednesday, November 30, 2016 - 11:24:25 AM
Last modification on : Tuesday, December 7, 2021 - 3:33:15 PM
Long-term archiving on: : Monday, March 27, 2017 - 8:05:57 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Przemysław Spurek, Marek Śmieja, Krzysztof Misztal. Subspaces Clustering Approach to Lossy Image Compression. 13th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Nov 2014, Ho Chi Minh City, Vietnam. pp.571-579, ⟨10.1007/978-3-662-45237-0_52⟩. ⟨hal-01405649⟩



Record views


Files downloads