Subspaces Clustering Approach to Lossy Image Compression - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Subspaces Clustering Approach to Lossy Image Compression


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.
Fichier principal
Vignette du fichier
978-3-662-45237-0_52_Chapter.pdf (1.81 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01405649 , version 1 (30-11-2016)





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⟩
29 View
94 Download



Gmail Facebook Twitter LinkedIn More