| HAL-Inria | Publications, software ... of Inria's scientists |
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.
Cited literature [18 references]
https://hal.inria.fr/hal-01405649
Contributor : Hal Ifip <>
Submitted on : Wednesday, November 30, 2016 - 11:24:25 AM
Last modification on : Thursday, October 4, 2018 - 10:12:02 PM
Long-term archiving on: : Monday, March 27, 2017 - 8:05:57 AM
Contributor : Hal Ifip <>
Submitted on : Wednesday, November 30, 2016 - 11:24:25 AM
Last modification on : Thursday, October 4, 2018 - 10:12:02 PM
Long-term archiving on: : Monday, March 27, 2017 - 8:05:57 AM
File
978-3-662-45237-0_52_Chapter.p...
Files produced by the author(s)
Licence
Distributed under a Creative Commons Attribution 4.0 International License