Results 211 to 220 of about 26,331 (257)
Some of the next articles are maybe not open access.
Adaptive entropy coded subband coding of images
IEEE Transactions on Image Processing, 1992The authors describe a design approach, called 2-D entropy-constrained subband coding (ECSBC), based upon recently developed 2-D entropy-constrained vector quantization (ECVQ) schemes. The output indexes of the embedded quantizers are further compressed by use of noiseless entropy coding schemes, such as Huffman or arithmetic codes, resulting in ...
J W Modestino
exaly +3 more sources
Entropy Coding and Entropy Coding Improvements of JPEG XS
2018 Data Compression Conference, 2018JPEG XS is a new standard for low-latency and low-complexity coding designed by the JPEG committee. Unlike former developments, optimal rate distortion performance is only a secondary goal; the focus of JPEG~XS is to enable cost-efficient, easy to parallelize implementations suitable for FPGAs or GPUs. In this article, we shed some light on the entropy
Thomas Richter 0005 +3 more
openaire +1 more source
Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225), 2002
Summary form only given. We present an algorithm for constructing entropy codes that allow progressive transmission. The algorithm constructs codes by forming an unbalanced tree in a similar to fashion to Huffman coding. It differs, however, in that nodes are combined in a rate-distortion sense. Because nodes are formed with both rate and distortion in
Tony S. Verma, Teresa H. Meng
openaire +1 more source
Summary form only given. We present an algorithm for constructing entropy codes that allow progressive transmission. The algorithm constructs codes by forming an unbalanced tree in a similar to fashion to Huffman coding. It differs, however, in that nodes are combined in a rate-distortion sense. Because nodes are formed with both rate and distortion in
Tony S. Verma, Teresa H. Meng
openaire +1 more source
Block truncation coding with entropy coding
IEEE Transactions on Communications, 1995Block truncation coding (BTC) is a simple and fast image compression algorithm which achieves a constant bit rate of 2.0 bits per pixel. The method is however suboptimal. We propose a modification of BTC in which the compression ratio is improved by coding the quantization data and the bit plane by arithmetic coding with an adaptive modelling scheme ...
Pasi Fränti, Olli Nevalainen
openaire +1 more source
Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171), 2002
The paper addresses several issues involved in interleaving compressed output from multiple non-prefix codes or from a combination of prefix and non-prefix codes. The technique used throughout is decoder-synchronized encoding, in which the encoder manipulates the data stream to allow just-in-time decoding.
openaire +1 more source
The paper addresses several issues involved in interleaving compressed output from multiple non-prefix codes or from a combination of prefix and non-prefix codes. The technique used throughout is decoder-synchronized encoding, in which the encoder manipulates the data stream to allow just-in-time decoding.
openaire +1 more source
Source coding and graph entropies
IEEE Transactions on Information Theory, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Noga Alon, Alon Orlitsky
openaire +1 more source
Neural Computation, 1989
To determine whether a particular sensory event is a reliable predictor of reward or punishment it is necessary to know the prior probability of that event. If the variables of a sensory representation normally occur independently of each other, then it is possible to derive the prior probability of any logical function of the variables from the prior
H. B. Barlow +2 more
openaire +1 more source
To determine whether a particular sensory event is a reliable predictor of reward or punishment it is necessary to know the prior probability of that event. If the variables of a sensory representation normally occur independently of each other, then it is possible to derive the prior probability of any logical function of the variables from the prior
H. B. Barlow +2 more
openaire +1 more source
Entropy-constrained trellis coded quantization
[1991] Proceedings. Data Compression Conference, 1992Summary: Trellis-coded quantization is generalized to allow noiseless coding of the trellis branch reproduction symbols. An entropy-constrained trellis- coded quantization (ECTCQ) design algorithm is presented, based on the generalized Lloyd algorithm for trellis code design and the entropy- constrained vector quantization design algorithm.
Thomas R. Fischer, Min Wang
openaire +2 more sources
2010
Let us consider a 2-bit quantizer that represents quantized values using the following set of quantization indexes: f0; 1; 2; 3g: Each quantization index given above is called a source symbol, or simply a symbol, and the set is called a symbol set. When applied to quantize a sequence of input samples, the quantizer produces a sequence of quantization ...
openaire +1 more source
Let us consider a 2-bit quantizer that represents quantized values using the following set of quantization indexes: f0; 1; 2; 3g: Each quantization index given above is called a source symbol, or simply a symbol, and the set is called a symbol set. When applied to quantize a sequence of input samples, the quantizer produces a sequence of quantization ...
openaire +1 more source