Zobrazeno 1 - 10
of 16 939
pro vyhledávání: '"Entropy coding"'
We present shuffle coding, a general method for optimal compression of sequences of unordered objects using bits-back coding. Data structures that can be compressed using shuffle coding include multisets, graphs, hypergraphs, and others. We release a
Externí odkaz:
http://arxiv.org/abs/2408.08837
Relative entropy coding (REC) algorithms encode a random sample following a target distribution $Q$, using a coding distribution $P$ shared between the sender and receiver. Sadly, general REC algorithms suffer from prohibitive encoding times, at leas
Externí odkaz:
http://arxiv.org/abs/2405.12203
Autor:
Abolfazli, Mojtaba, Amirani, Mohammad Zaeri, Høst-Madsen, Anders, Zhang, June, Bratincsak, Andras
Given a default distribution $P$ and a set of test data $x^M=\{x_1,x_2,\ldots,x_M\}$ this paper seeks to answer the question if it was likely that $x^M$ was generated by $P$. For discrete distributions, the definitive answer is in principle given by
Externí odkaz:
http://arxiv.org/abs/2404.17023
Publikováno v:
Proc. IEEE International Conference on Multimedia, Dec. 2023
Video compression systems must support increasing bandwidth and data throughput at low cost and power, and can be limited by entropy coding bottlenecks. Efficiency can be greatly improved by parallelizing coding, which can be done at much larger scal
Externí odkaz:
http://arxiv.org/abs/2312.00921
Publikováno v:
IEEE Access, Vol 12, Pp 17541-17551 (2024)
In this paper, we propose deep video compression with hyperprior-based entropy coding, named HDVC. The proposed method is based on the deep video compression (DVC) framework that replaces traditional block-based video compression with end-to-end vide
Externí odkaz:
https://doaj.org/article/1b599391042b404491a820436c4a1947
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Relative entropy coding (REC) algorithms encode a sample from a target distribution $Q$ using a proposal distribution $P$ using as few bits as possible. Unlike entropy coding, REC does not assume discrete distributions or require quantisation. As suc
Externí odkaz:
http://arxiv.org/abs/2309.15746
Learning-based video compression has been extensively studied over the past years, but it still has limitations in adapting to various motion patterns and entropy models. In this paper, we propose multi-mode video compression (MMVC), a block wise mod
Externí odkaz:
http://arxiv.org/abs/2304.02273
The necessity of radix conversion of numeric data is an indispensable component in any complete analysis of digital computation. In this paper, we propose a binary encoding for mixed-radix digits. Second, a variant of rANS coding based on this conver
Externí odkaz:
http://arxiv.org/abs/2307.15864
Publikováno v:
IEEE International Conference on Image Processing (ICIP), Bordeaux, France, 2022, pp. 661-665
Neural-based image and video codecs are significantly more power-efficient when weights and activations are quantized to low-precision integers. While there are general-purpose techniques for reducing quantization effects, large losses can occur when
Externí odkaz:
http://arxiv.org/abs/2301.08752