Shannon’s rate-distortion curve characterizes optimal lossy compression. I show here that the optimization principle that has to be solved to compute the rate-distortion function can be derived from a least effort principle: minimizing required thermodynamic effort necessitates the minimization of information (compatible with a given fidelity). Retaining less information costs less physical eff...

For a variety of infinite-state systems, the problem of deciding whether a given system is self-stabilizing or not is investigated from the decidability viewpoint. We develop a unified strategy through which checking self-stabilization is shown to be decidable for lossy vector addition systems with states, one-counter machines, and conflict-free Petri nets. For lossy counter machines and lossy ...

Compression refers to encoding data using bits, so that the representation uses as few bits as possible. Compression could be lossless: i.e. encoded data can be recovered exactly from its representation) or lossy where the data is compressed more than the lossless case, but can still be recovered to within prespecified distortion metric. In this paper, we prove the optimality of Codelet Parsing...

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 ap...

Lossy trapdoor functions (Peikert and Waters, STOC ’08) are an intriguing and powerful cryptographic primitive. Their main applications are simple and black-box constructions of chosen-ciphertext secure encryption, as well as collision-resistant hash functions and oblivious transfer. An appealing property of lossy trapdoor functions is the ability to realize them from a variety of number-theore...

Bloom ltering is an important technique for space e cient storage of a conservative approximation of a set S. The set stored may have up to some speci ed number of false positive members, but all elements of S are included. In this paper we consider lossy dictionaries that are also allowed to have false negatives , i.e., leave out elements of S. The aim is to maximize the weight of included key...

This paper investigates a measurement method that characterizes lossy printed multiconductor transmission lines, its accuracy, the choice of measurement representations, and some simple approximations. We illustrate the method with measurements of a pair of lossy coupled asymmetric microstrip lines.

This article presents a polynomial-based image compression scheme, which consists of using the color model (YUV) to represent contents and two-dimensional polynomial coding (first-order) with variable block size according correlation between neighbor pixels. The residual part for all bands is analyzed into two parts, most important (big) part, least (small) parts. Due significant subjective imp...

Lossy trapdoor functions (LTFs) were first introduced by Peikert and Waters (STOC’08). Since their introduction, lossy trapdoor functions have found numerous applications. They can be used as tools to construct important cryptographic primitives such as injective one-way trapdoor functions, chosen-ciphertext-secure public key encryptions, deterministic encryptions, et al. In this paper, we focu...