Results 11 to 20 of about 1,551,520 (284)
Integer-Forcing Source Coding [PDF]
IEEE Transactions on Information Theory, 2014 Integer-Forcing (IF) is a new framework, based on compute-and-forward, for decoding multiple integer linear combinations from the output of a Gaussian multiple-input multiple-output channel. This work applies the IF approach to arrive at a new low-complexity scheme, IF source coding, for distributed lossy compression of correlated Gaussian sources ...
Or Ordentlich, Uri Erez
openaire +3 more sources
Hyperspectral Pansharpening Based on Homomorphic Filtering and Weighted Tensor Matrix
Remote Sensing, 2019 Hyperspectral pansharpening is an effective technique to obtain a high spatial resolution hyperspectral (HS) image. In this paper, a new hyperspectral pansharpening algorithm based on homomorphic filtering and weighted tensor matrix (HFWT) is proposed ...
Jiahui Qu +4 more
doaj +1 more source
Structure Tensor-Based Algorithm for Hyperspectral and Panchromatic Images Fusion
Remote Sensing, 2018 Restricted by technical and budget constraints, hyperspectral (HS) image which contains abundant spectral information generally has low spatial resolution. Fusion of hyperspectral and panchromatic (PAN) images can merge spectral information of the former
Jiahui Qu +5 more
doaj +1 more source
Polar codes for distributed source coding [PDF]
Electronics Letters, 2013 A polar coding method to construct a distributed source coding scheme which can achieve any point on the dominant face of the Slepian‐Wolf rate region for sources with uniform marginals is proposed.
openaire +6 more sources
Source Coding with a Causal Helper
Information, 2020 A multi-terminal network, in which an encoder is assisted by a side-information-aided helper, describes a memoryless identically distributed source to a receiver, is considered. The encoder provides a non-causal one-shot description of the source to both
Shraga I. Bross
doaj +1 more source
Robust 2-bit Quantization of Weights in Neural Network Modeled by Laplacian Distribution
Advances in Electrical and Computer Engineering, 2021 Significant efforts are constantly involved in finding manners to decrease the number of bits required for quantization of neural network parameters. Although in addition to compression, in neural networks, the application of quantizer models that are ...
PERIC, Z. +3 more
doaj +1 more source
Entropy, 2018 In this paper, we give upper bounds for the rate-distortion function (RDF) of any Gaussian vector, and we propose coding strategies to achieve such bounds.
Jesús Gutiérrez-Gutiérrez +3 more
doaj +1 more source
Efficient and Compact Representations of Deep Neural Networks via Entropy Coding
IEEE Access, 2023 Matrix operations are nowadays central in many Machine Learning techniques, including in particular Deep Neural Networks (DNNs), whose core of any inference is represented by a sequence of dot product operations.
Giosue Cataldo Marino +3 more
doaj +1 more source
The Three-Terminal Interactive Lossy Source Coding Problem [PDF]
, 2016 The three-node multiterminal lossy source coding problem is investigated. We derive an inner bound to the general rate-distortion region of this problem which is a natural extension of the seminal work by Kaspi'85 on the interactive two-terminal source ...
Hero III, Alfred +2 more
core +4 more sources
On feedback in network source coding [PDF]
, 2009 We consider source coding over networks with unlimited feedback from the sinks to the sources. We first show examples of networks where the rate region with feedback is a strict superset of that without feedback.
Bakshi, Mayank, Effros, Michelle
core +2 more sources