Skip to Main content Skip to Navigation
New interface
Journal articles

Large Database Compression Based on Perceived Information

Abstract : Lossy compression algorithms trade bits for quality, aiming at reducing as much as possible the bitrate needed to represent the original source (or set of sources), while preserving the source quality. In this letter, we propose a novel paradigm of compression algorithms, aimed at minimizing the information loss perceived by the final user instead of the actual source quality loss, under compression rate constraints. As main contributions, we first introduce the concept of perceived information (PI), which reflects the information perceived by a given user experiencing a data collection, and which is evaluated as the volume spanned by the sources features in a personalized latent space. We then formalize the rate-PI optimization problem and propose an algorithm to solve this compression problem. Finally, we validate our algorithm against benchmark solutions with simulation results, showing the gain in taking into account users' preferences while also maximizing the perceived information in the feature domain.
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Thomas Maugey Connect in order to contact the contributor
Submitted on : Thursday, September 17, 2020 - 6:26:34 PM
Last modification on : Friday, August 5, 2022 - 2:54:52 PM
Long-term archiving on: : Thursday, December 3, 2020 - 10:36:00 AM


Files produced by the author(s)



Thomas Maugey, Laura Toni. Large Database Compression Based on Perceived Information. IEEE Signal Processing Letters, 2020, 27, pp.1735 - 1739. ⟨10.1109/LSP.2020.3025478⟩. ⟨hal-02942418⟩



Record views


Files downloads