57 citations · 138 across the 10 of their papers we have counts for
7 papers · 1 filter
Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff
Albert No, Amir Ingber, Tsachy Weissman
We investigate the second order asymptotics (source dispersion) of the successive refinement problem. Similarly to the classical definition of a successively refinable source, we s…
Compression for Quadratic Similarity Queries: Finite Blocklength and Practical Schemes
Fabian Steiner, Steffen Dempfle, Amir Ingber +1
We study the problem of compression for the purpose of similarity identification, where similarity is measured by the mean square Euclidean distance between vectors. While the asym…
The Minimal Compression Rate for Similarity Identification
Amir Ingber, Tsachy Weissman
Traditionally, data compression deals with the problem of concisely representing a data source, e.g. a sequence of letters, for the purpose of eventual reproduction (either exact o…
Compression for Quadratic Similarity Queries
Amir Ingber, Thomas Courtade, Tsachy Weissman
The problem of performing similarity queries on compressed data is considered. We focus on the quadratic similarity measure, and study the fundamental tradeoff between compression…
The Dispersion of Joint Source-Channel Coding
Da Wang, Amir Ingber, Yuval Kochman
In this work we investigate the behavior of the distortion threshold that can be guaranteed in joint source-channel coding, to within a prescribed excess-distortion probability. We…
The Dispersion of Lossy Source Coding
Amir Ingber, Yuval Kochman
In this work we investigate the behavior of the minimal rate needed in order to guarantee a given probability that the distortion exceeds a prescribed threshold, at some fixed fini…