DOCSLIB.ORG

CSE 589 Applied Algorithms Binary Golomb Codes Example

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
CSE 589 Applied Algorithms Binary Golomb Codes Example Binary Golomb Codes • Binary source with 0’s much more frequent than 1’s. • Variable-to-variable length code CSE 589 • Prefix code. Applied Algorithms • Golomb code of order 4 Autumn 2001 input output 0000 0 Golomb Coding 0001 100 Arithmetic Coding 001 101 LZW 01 110 Sequitur 1 111 CSE 589 - Lecture 6 - Autumn 2 2001 Example Constructing a Binary Golomb Code input output 0000 0 • Let p be the probability of 0 0001 100 • Choose the order k such that 001 101 k +1 ≤ − k < k −1 01 110 p 1 p p 1 111 0 1 0 1 0 1 000000001001000000010001 least likely most likely 001111010100100 001 01 1 0k-11 CSE 589 - Lecture 6 - Autumn 3 CSE 589 - Lecture 6 - Autumn 4 2001 2001 Example Comparison of GC with Entropy p = .89 0 1 7 p = .442 0 1 0 1 1- p6 = .503 0 1 0 1 5 01 1 p = .558 000001 00001 0001 001 GC – entropy Order = 6 entropy input output order 000000 0 000001 1000 00001 1001 0001 1010 001 1011 01 110 p 1 111 CSE 589 - Lecture 6 - Autumn 5 CSE 589 - Lecture 6 - Autumn 6 2001 2001 1 Arithmetic Coding Notes on Binary Golomb Code • Huffman coding works well for larger alphabets and gets to within one bit of the entropy lower • Very effective as a binary run-length code bound. Can we do better. Yes • As p goes to 1 effectiveness near entropy • Basic idea in arithmetic coding: • There are adaptive Golomb codes, so that – represent each string x of length n by an interval [l,r) the order can change according to observed in [0,1). We assume n is known. frequency of 0’s. – The width r-l of the interval [l,r) represents the probability of x occurring. – The interval [l,r) can itself be represented by any number, called a tag, within the half open interval. – The k significant bits of the tag .t1t2t3... is the code of x. That is, . .t1t2t3...tk000... is in the interval [l,r). CSE 589 - Lecture 6 - Autumn 7 CSE 589 - Lecture 6 - Autumn 8 2001 2001 Example of Arithmetic Coding (1) Some Tags are Better than Others 0 1. tag must be in the half open interval. 0 2. tag can be chosen to be (l+r)/2. 1/3 a 3. code is significant bits of the tag. 1/3 a 11/27 .011010000... ba bab 15/27 .100011100... 2/3 15/27 .100011100... 2/3 b bba b 19/27 .101101000... bb Using tag = (l+r)/2 tag = 13/27 = .011110110... code = 0111 1 tag = 17/27 = .101000010... 1 code = 101 Alternative tag = 14/37 = .100001001... code = 1 CSE 589 - Lecture 6 - Autumn 9 CSE 589 - Lecture 6 - Autumn 10 2001 2001 Code Generation from Tag Example of Codes • If binary tag is .t1t2t3... = (r+l)/2 in [l,r) then we want to choose k to form the code t1t2...tk. • P(a) = 1/3, P(b) = 2/3. tag = (l+r)/2 code • Short code: 0 0/27 .000000000... – choose k to be as small as possible so that aa aaa 1/27 .000010010... .000001001... 0 aaa aab 3/27 .000111000... .000100110... 0001 aab l < .t1t2...tk000... < r. a aba 5/27 .001011110... .001001100... 001 aba ab – Good if n is known. abb .010000101... 01 abb 9/27 .010101010... • Guaranteed code: baa 11/27 .011010000... .010111110... 01011 baa ba k = − log (r − l) +1 bab .011110111... 0111 bab – choose 2 15/27 .100011100... – l < .t1t2...tkb1b2b3... < r for any bits b1b2b3... b bba .101000010... 101 bba 19/27 .101101000... – for fixed length strings provides a good prefix code. bb bbb .110110100... 11 bbb – example: [.000000000..., .000010010...), tag = .000001001... Short code: 0 1 27/27 .111111111... .95 bits/symbol Guaranteed code: 000001 .92 entropy lower bound CSE 589 - Lecture 6 - Autumn 11 CSE 589 - Lecture 6 - Autumn 12 2001 2001 2 Guaranteed Code Example Arithmetic Coding Algorithm • P(a) = 1/3, P(b) = 2/3. • P(a1), P(a2), … , P(am) short Prefix tag = (l+r)/2 code code • C(ai) = P(a1) + P(a2) + … + P(ai-1) 0 0/27 aa aaa 1/27 .000001001... 0 0000 aaa • Encode x1x2...xn aab 3/27 .000100110... 0001 0001 aab a aba 5/27 .001001100... 001 001 aba ab abb .010000101... 01 0100 abb Initialize l := 0 and r := 1; 9/27 for i = 1 to n do baa 11/27 .010111110... 01011 01011 baa ba w := r - l; bab .011110111... 0111 0111 bab l := l + w * C(x); 15/27 i r := l + w * P(x); b bba .101000010... 101 101 bba i 19/27 t := (l+r)/2; bb choose code for the tag bbb .110110100... 11 11 bbb 1 27/27 CSE 589 - Lecture 6 - Autumn 13 CSE 589 - Lecture 6 - Autumn 14 2001 2001 Arithmetic Coding Example Arithmetic Coding Exercise • P(a) = 1/4, P(b) = 1/2, P(c) = 1/4 • P(a) = 1/4, P(b) = 1/2, P(c) = 1/4 • C(a) = 0, C(b) = 1/4, C(c) = 3/4 • C(a) = 0, C(b) = 1/4, C(c) = 3/4 • abca • bbbb symbol w l r symbol w l r 0 1 0 1 a 1 0 1/4 b 1 w := r - l; w := r - l; b 1/4 1/16 3/16 b l := l + w C(x); l := l + w C(x); c 1/8 5/32 6/32 b r := l + w P(x) r := l + w P(x) a 1/32 5/32 21/128 b tag = (5/32 + 21/128)/2 = 41/256 = .001010010... tag = l = .001010000... l = r = .001010100... r = code = 00101 code = prefix code = 00101001 prefix code = CSE 589 - Lecture 6 - Autumn 15 CSE 589 - Lecture 6 - Autumn 16 2001 2001 Decoding (1) Decoding (2) • Assume the length is known to be 3. • Assume the length is known to be 3. • 0001 which converts to the tag .0001000... • 0001 which converts to the tag .0001000... 0 0 .0001000... output a .0001000... aa output a a a ab b b 1 1 CSE 589 - Lecture 6 - Autumn 17 CSE 589 - Lecture 6 - Autumn 18 2001 2001 3 Decoding (3) Arithmetic Decoding Algorithm • Assume the length is known to be 3. • P(a1), P(a2), … , P(am) • 0001 which converts to the tag .0001000... • C(ai) = P(a1) + P(a2) + … + P(ai-1) 0 • Decode b1b2...bm, number of symbols is n. .0001000... aa aab output b a Initialize l := 0 and r := 1; ab t := .b1b2...bm000... for i = 1 to n do w := r - l; find j such that l + w * C(aj) < t < l + w * (C(aj)+P(aj)) b output aj; l := l + w * C(aj); r := l + w * P(aj); 1 CSE 589 - Lecture 6 - Autumn 19 CSE 589 - Lecture 6 - Autumn 20 2001 2001 Decoding Example Practical Arithmetic Coding • P(a) = 1/4, P(b) = 1/2, P(c) = 1/4 • Scaling: • C(a) = 0, C(b) = 1/4, C(c) = 3/4 – By scaling we can keep l and r in a reasonable range of values so that w = r - l does not • 00101 underflow. tag = .00101000... = 5/32 w l r output – The code can be produced progressively, not at 0 1 the end. 1 0 1/4 a – Complicates decoding some. 1/4 1/16 3/16 b 1/8 5/32 6/32 c • Integer arithmetic coding avoids floating point 1/32 5/32 21/128 a altogether. CSE 589 - Lecture 6 - Autumn 21 CSE 589 - Lecture 6 - Autumn 22 2001 2001 Notes on Arithmetic Coding Dictionary Coding • Arithmetic codes come close to the entropy lower bound. • Does not use statistical knowledge of data. • Grouping symbols is effective for arithmetic coding. • Arithmetic codes can be used effectively on small • Encoder: As the input is processed develop a symbol sets. Advantage over Huffman. dictionary and transmit the index of strings • Context can be added so that more than one found in the dictionary. probability distribution can be used. • Decoder: As the code is processed – The best coders in the world use this method. reconstruct the dictionary to invert the • There are very effective adaptive arithmetic coding process of encoding. methods. • Examples: LZW, LZ77, Unix Compress, gzip, GIF CSE 589 - Lecture 6 - Autumn 23 CSE 589 - Lecture 6 - Autumn 24 2001 2001 4 LZW Encoding Algorithm LZW Encoding Example (1) Dictionary a b a b a b a b a Repeat 0 a find the longest match w in the dictionary 1 b output the index of w put wa in the dictionary where a was the unmatched symbol CSE 589 - Lecture 6 - Autumn 25 CSE 589 - Lecture 6 - Autumn 26 2001 2001 LZW Encoding Example (2) LZW Encoding Example (3) Dictionary Dictionary a b a b a b a b a a b a b a b a b a 0 a 0 0 a 0 1 1 b 1 b 2 ab 2 ab 3 ba CSE 589 - Lecture 6 - Autumn 27 CSE 589 - Lecture 6 - Autumn 28 2001 2001 LZW Encoding Example (4) LZW Encoding Example (5) Dictionary Dictionary a b a b a b a b a a b a b a b a b a 0 a 0 1 2 0 a 0 1 2 4 1 b 1 b 2 ab 2 ab 3 ba 3 ba 4 aba 4 aba 5 abab CSE 589 - Lecture 6 - Autumn 29 CSE 589 - Lecture 6 - Autumn 30 2001 2001 5 LZW Encoding Example (6) LZW Decoding Algorithm • Emulate the encoder in building the dictionary.
Load more

Recommended publications
  • Error Correction Capacity of Unary Coding
    Error Correction Capacity of Unary Coding Pushpa Sree Potluri1 Abstract Unary coding has found applications in data compression, neural network training, and in explaining the production mechanism of birdsong. Unary coding is redundant; therefore it should have inherent error correction capacity. An expression for the error correction capability of unary coding for the correction of single errors has been derived in this paper. 1. Introduction The unary number system is the base-1 system. It is the simplest number system to represent natural numbers. The unary code of a number n is represented by n ones followed by a zero or by n zero bits followed by 1 bit [1]. Unary codes have found applications in data compression [2],[3], neural network training [4]-[11], and biology in the study of avian birdsong production [12]-14]. One can also claim that the additivity of physics is somewhat like the tallying of unary coding [15],[16]. Unary coding has also been seen as the precursor to the development of number systems [17]. Some representations of unary number system use n-1 ones followed by a zero or with the corresponding number of zeroes followed by a one. Here we use the mapping of the left column of Table 1. Table 1. An example of the unary code N Unary code Alternative code 0 0 0 1 10 01 2 110 001 3 1110 0001 4 11110 00001 5 111110 000001 6 1111110 0000001 7 11111110 00000001 8 111111110 000000001 9 1111111110 0000000001 10 11111111110 00000000001 The unary number system may also be seen as a space coding of numerical information where the location determines the value of the number.
    [Show full text]
  • Soft Compression for Lossless Image Coding
    1 Soft Compression for Lossless Image Coding Gangtao Xin, and Pingyi Fan, Senior Member, IEEE Abstract—Soft compression is a lossless image compression method, which is committed to eliminating coding redundancy and spatial redundancy at the same time by adopting locations and shapes of codebook to encode an image from the perspective of information theory and statistical distribution. In this paper, we propose a new concept, compressible indicator function with regard to image, which gives a threshold about the average number of bits required to represent a location and can be used for revealing the performance of soft compression. We investigate and analyze soft compression for binary image, gray image and multi-component image by using specific algorithms and compressible indicator value. It is expected that the bandwidth and storage space needed when transmitting and storing the same kind of images can be greatly reduced by applying soft compression. Index Terms—Lossless image compression, information theory, statistical distributions, compressible indicator function, image set compression. F 1 INTRODUCTION HE purpose of image compression is to reduce the where H(X1;X2; :::; Xn) is the joint entropy of the symbol T number of bits required to represent an image as much series fXi; i = 1; 2; :::; ng. as possible under the condition that the fidelity of the It’s impossible to reach the entropy rate and everything reconstructed image to the original image is higher than a we can do is to make great efforts to get close to it. Soft com- required value. Image compression often includes two pro- pression [1] was recently proposed, which uses locations cesses, encoding and decoding.
    [Show full text]
  • Generalized Golomb Codes and Adaptive Coding of Wavelet-Transformed Image Subbands
    IPN Progress Report 42-154 August 15, 2003 Generalized Golomb Codes and Adaptive Coding of Wavelet-Transformed Image Subbands A. Kiely1 and M. Klimesh1 We describe a class of prefix-free codes for the nonnegative integers. We apply a family of codes in this class to the problem of runlength coding, specifically as part of an adaptive algorithm for compressing quantized subbands of wavelet- transformed images. On test images, our adaptive coding algorithm is shown to give compression effectiveness comparable to the best performance achievable by an alternate algorithm that has been previously implemented. I. Generalized Golomb Codes A. Introduction Suppose we wish to use a variable-length binary code to encode integers that can take on any non- negative value. This problem arises, for example, in runlength coding—encoding the lengths of runs of a dominant output symbol from a discrete source. Encoding cannot be accomplished by simply looking up codewords from a table because the table would be infinite, and Huffman’s algorithm could not be used to construct the code anyway. Thus, one would like to use a simply described code that can be easily encoded and decoded. Although in practice there is generally a limit to the size of the integers that need to be encoded, a simple code for the nonnegative integers is often still the best choice. We now describe a class of variable-length binary codes for the nonnegative integers that contains several useful families of codes. Each code in this class is completely specified by an index function f from the nonnegative integers onto the nonnegative integers.
    [Show full text]
  • The Pillars of Lossless Compression Algorithms a Road Map and Genealogy Tree
    International Journal of Applied Engineering Research ISSN 0973-4562 Volume 13, Number 6 (2018) pp. 3296-3414 © Research India Publications. http://www.ripublication.com The Pillars of Lossless Compression Algorithms a Road Map and Genealogy Tree Evon Abu-Taieh, PhD Information System Technology Faculty, The University of Jordan, Aqaba, Jordan. Abstract tree is presented in the last section of the paper after presenting the 12 main compression algorithms each with a practical This paper presents the pillars of lossless compression example. algorithms, methods and techniques. The paper counted more than 40 compression algorithms. Although each algorithm is The paper first introduces Shannon–Fano code showing its an independent in its own right, still; these algorithms relation to Shannon (1948), Huffman coding (1952), FANO interrelate genealogically and chronologically. The paper then (1949), Run Length Encoding (1967), Peter's Version (1963), presents the genealogy tree suggested by researcher. The tree Enumerative Coding (1973), LIFO (1976), FiFO Pasco (1976), shows the interrelationships between the 40 algorithms. Also, Stream (1979), P-Based FIFO (1981). Two examples are to be the tree showed the chronological order the algorithms came to presented one for Shannon-Fano Code and the other is for life. The time relation shows the cooperation among the Arithmetic Coding. Next, Huffman code is to be presented scientific society and how the amended each other's work. The with simulation example and algorithm. The third is Lempel- paper presents the 12 pillars researched in this paper, and a Ziv-Welch (LZW) Algorithm which hatched more than 24 comparison table is to be developed.
    [Show full text]
  • New Approaches to Fine-Grain Scalable Audio Coding
    New Approaches to Fine-Grain Scalable Audio Coding Mahmood Movassagh Department of Electrical & Computer Engineering McGill University Montreal, Canada December 2015 Research Thesis submitted to McGill University in partial fulfillment of the requirements for the degree of PhD. c 2015 Mahmood Movassagh In memory of my mother whom I lost in the last year of my PhD studies To my father who has been the greatest support for my studies in my life Abstract Bit-rate scalability has been a useful feature in the multimedia communications. Without the need to re-encode the original signal, it allows for improving/decreasing the quality of a signal as more/less of a total bit stream becomes available. Using scalable coding, there is no need to store multiple versions of a signal encoded at different bit-rates. Scalable coding can also be used to provide users with different quality streaming when they have different constraints or when there is a varying channel; i.e., the receivers with lower channel capacities will be able to receive signals at lower bit-rates. It is especially useful in the client- server applications where the network nodes are able to drop some enhancement layer bits to satisfy link capacity constraints. In this dissertation, we provide three contributions to practical scalable audio coding systems. Our first contribution is the scalable audio coding using watermarking. The proposed scheme uses watermarking to embed some of the information of each layer into the previous layer. This approach leads to a saving in bitrate, so that it outperforms (in terms of rate-distortion) the common scalable audio coding based on the reconstruction error quantization (REQ) as used in MPEG-4 audio.
    [Show full text]
  • Critical Assessment of Advanced Coding Standards for Lossless Audio Compression
    TONNY HIDAYAT et al: A CRITICAL ASSESSMENT OF ADVANCED CODING STANDARDS FOR LOSSLESS .. A Critical Assessment of Advanced Coding Standards for Lossless Audio Compression Tonny Hidayat Mohd Hafiz Zakaria, Ahmad Naim Che Pee Department of Information Technology Faculty of Information and Communication Technology Universitas Amikom Yogyakarta Universiti Teknikal Malaysia Melaka Yogyakarta, Indonesia Melaka, Malaysia [email protected] [email protected], [email protected] Abstract - Image data, text, video, and audio data all require compression for storage issues and real-time access via computer networks. Audio data cannot use compression technique for generic data. The use of algorithms leads to poor sound quality, small compression ratios and algorithms are not designed for real-time access. Lossless audio compression has achieved observation as a research topic and business field of the importance of the need to store data with excellent condition and larger storage charges. This article will discuss and analyze the various lossless and standardized audio coding algorithms that concern about LPC definitely due to its reputation and resistance to compression that is audio. However, another expectation plans are likewise broke down for relative materials. Comprehension of LPC improvements, for example, LSP deterioration procedures is additionally examined in this paper. Keywords - component; Audio; Lossless; Compression; coding. I. INTRODUCTION Compression is to shrink / compress the size. Data compression is a technique to minimize the data so that files can be obtained with a size smaller than the original file size. Compression is needed to minimize the data storage (because the data size is smaller than the original), accelerate information transmission, and limit bandwidth prerequisites.
    [Show full text]
  • Answers to Exercises
    Answers to Exercises A bird does not sing because he has an answer, he sings because he has a song. —Chinese Proverb Intro.1: abstemious, abstentious, adventitious, annelidous, arsenious, arterious, face- tious, sacrilegious. Intro.2: When a software house has a popular product they tend to come up with new versions. A user can update an old version to a new one, and the update usually comes as a compressed file on a floppy disk. Over time the updates get bigger and, at a certain point, an update may not fit on a single floppy. This is why good compression is important in the case of software updates. The time it takes to compress and decompress the update is unimportant since these operations are typically done just once. Recently, software makers have taken to providing updates over the Internet, but even in such cases it is important to have small files because of the download times involved. 1.1: (1) ask a question, (2) absolutely necessary, (3) advance warning, (4) boiling hot, (5) climb up, (6) close scrutiny, (7) exactly the same, (8) free gift, (9) hot water heater, (10) my personal opinion, (11) newborn baby, (12) postponed until later, (13) unexpected surprise, (14) unsolved mysteries. 1.2: A reasonable way to use them is to code the five most-common strings in the text. Because irreversible text compression is a special-purpose method, the user may know what strings are common in any particular text to be compressed. The user may specify five such strings to the encoder, and they should also be written at the start of the output stream, for the decoder’s use.
    [Show full text]
  • Lec 05 Arithmetic Coding
    ECE 5578 Multimedia Communication Lec 05 Arithmetic Coding Zhu Li Dept of CSEE, UMKC web: http://l.web.umkc.edu/lizhu phone: x2346 Z. Li, Multimedia Communciation, 2018 p.1 Outline Lecture 04 ReCap Arithmetic Coding About Homework-1 and Lab Z. Li, Multimedia Communciation, 2018 p.2 JPEG Coding Block (8x8 pel) based coding DCT transform to find sparse * representation Quantization reflects human visual system Zig-Zag scan to convert 2D to 1D string Run-Level pairs to have even more = compact representation Hoffman Coding on Level Category Quant Table: Fixed on the Level with in the category Z. Li, Multimedia Communciation, 2018 p.3 Coding of AC Coefficients Zigzag scanning: Example 8 24 -2 0 0 0 0 0 -31 -4 6 -1 0 0 0 0 0 -12 -1 2 0 0 0 0 0 0 -2 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Example: zigzag scanning result 24 -31 0 -4 -2 0 6 -12 0 0 0 -1 -1 0 0 0 2 -2 0 0 0 0 0 -1 EOB (Run, level) representation: (0, 24), (0, -31), (1, -4), (0, -2), (1, 6), (0, -12), (3, -1), (0, -1), (3, 2), (0, -2), (5, -1), EOB Z. Li, Multimedia Communciation, 2018 p.4 Coding of AC Coefficients Run / Base Run / Base … Run / Base codeword Catg. codeword Catg. Codeword Cat. EOB 1010 - - … ZRL 1111 1111 001 0/1 00 1/1 1100 … 15/1 1111 1111 1111 0101 0/2 01 1/2 11011 … 15/2 1111 1111 1111 0110 0/3 100 1/3 1111001 … 15/3 1111 1111 1111 0111 0/4 1011 1/4 111110110 … 15/4 1111 1111 1111 1000 0/5 11010 1/5 11111110110 … 15/5 1111 1111 1111 1001 … … … … … … … ZRL: represent 16 zeros when number of zeros exceeds 15.
    [Show full text]
  • Optimization Methods for Data Compression
    OPTIMIZATION METHODS FOR DATA COMPRESSION A Dissertation Presented to The Faculty of the Graduate School of Arts and Sciences Brandeis University Computer Science James A. Storer Advisor In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy by Giovanni Motta May 2002 This dissertation, directed and approved by Giovanni Motta's Committee, has been accepted and approved by the Graduate Faculty of Brandeis University in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY _________________________ Dean of Arts and Sciences Dissertation Committee __________________________ James A. Storer ____________________________ Martin Cohn ____________________________ Jordan Pollack ____________________________ Bruno Carpentieri ii To My Parents. iii ACKNOWLEDGEMENTS I wish to thank: Bruno Carpentieri, Martin Cohn, Antonella Di Lillo, Jordan Pollack, Francesco Rizzo, James Storer for their support and collaboration. I also thank Jeanne DeBaie, Myrna Fox, Julio Santana for making my life at Brandeis easier and enjoyable. iv ABSTRACT Optimization Methods for Data Compression A dissertation presented to the Faculty of the Graduate School of Arts and Sciences of Brandeis University, Waltham, Massachusetts by Giovanni Motta Many data compression algorithms use ad–hoc techniques to compress data efficiently. Only in very few cases, can data compressors be proved to achieve optimality on a specific information source, and even in these cases, algorithms often use sub–optimal procedures in their execution. It is appropriate to ask whether the replacement of a sub–optimal strategy by an optimal one in the execution of a given algorithm results in a substantial improvement of its performance. Because of the differences between algorithms the answer to this question is domain dependent and our investigation is based on a case–by–case analysis of the effects of using an optimization procedure in a data compression algorithm.
    [Show full text]
  • Lecture 14 Announcements
    Image Compression and Watermarking Image Processing CSE 166 Lecture 14 Announcements • Assignment 4 is due May 20, 11:59 PM • Assignment 5 will be released May 20 – Due May 29, 11:59 PM • Reading – Chapter 8: Image Compression and Watermarking • Sections 8.1, 8.9, 8.10, and 8.12 CSE 166, Spring 2020 2 Data compression • Data redundancy where compression ratio where CSE 166, Spring 2020 3 Data redundancy in images Coding Spatial Irrelevant redundancy redundancy information Does not need all Information is Information is 8 bits unnecessarily not useful replicated CSE 166, Spring 2020 4 Image information • Entropy where – It is not possible to encode input image with fewer than bits/pixel CSE 166, Spring 2020 5 Fidelity criteria, objective (quantitative) • Total error • Root-mean-square error • Mean-square signal to noise ratio (SNR) CSE 166, Spring 2020 6 Fidelity criteria, subjective (qualitative) CSE 166, Spring 2020 7 Approximations Objective (quantitative) quality rms error (in intensity levels) Lower is 5.17 15.67 14.17 better (a) (b) (c) (a) is better Subjective (qualitative) quality, relative than (b), (b) is better CSE 166, Spring 2020 than (c)8 Compression system CSE 166, Spring 2020 9 Compression methods • Huffman coding • Golomb coding • Arithmetic coding • Lempel-Ziv-Welch (LZW) coding • Run-length coding • Symbol-based coding • Bit-plane coding • Block transform coding • Predictive coding • Wavelet coding CSE 166, Spring 2020 10 Symbol-based coding (0,2) (3,10) … CSE 166, Spring 2020 11 Block-transform coding Encoder Decoder
    [Show full text]
  • Optimal Prefix Codes for Pairs of Geometrically-Distributed Random Variables Frédérique Bassino, Julien Clément, Gadiel Seroussi, Alfredo Viola
    Optimal prefix codes for pairs of geometrically-distributed random variables Frédérique Bassino, Julien Clément, Gadiel Seroussi, Alfredo Viola To cite this version: Frédérique Bassino, Julien Clément, Gadiel Seroussi, Alfredo Viola. Optimal prefix codes for pairs of geometrically-distributed random variables. IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2013, 59 (4), pp.2375 - 2395. 10.1109/TIT.2012.2236915. hal-00511248 HAL Id: hal-00511248 https://hal.archives-ouvertes.fr/hal-00511248 Submitted on 24 Aug 2010 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Optimal prefix codes for pairs of geometrically-distributed random variables Fred´ erique´ Bassino LIPN UMR 7030 Universite´ Paris 13 - CNRS, France [email protected] Julien Clement´ GREYC UMR 6072 CNRS, Universite´ de Caen, ENSICAEN, France [email protected] Gadiel Seroussi HP Labs, Palo Alto, California and Universidad de la Republica,´ Montevideo, Uruguay [email protected] Alfredo Viola Universidad de la Republica,´ Montevideo, Uruguay, and LIPN UMR 7030, Universite´ Paris 13 - CNRS, France [email protected] Abstract Optimal prefix codes are studied for pairs of independent, integer-valued symbols emitted by a source with a geometric probability distribution of parameter q, 0<q<1.
    [Show full text]
  • Data Compression: Transform Coding in Practice 2 / 50 Last Lecture Last Lectures: Orthogonal Block Transforms
    Transform Coding in Practice Last Lecture Last Lectures: Basic Concept Transform Coding Transform reduces linear dependencies (correlation) between samples before scalar quantization For correlated sources: Scalar quantization in transform domain is more efficient encoder decoder 0 u0 q0 q0 u0 α0 β0 forward entropy entropy 0 inverse s u1 q1 b q1 u1 s0 transform α1 coding decoding β1 transform . γ −1 . 0 −1 A uN−1 qN−1 γ qN−1 uN−1 A αN−1 βN−1 Encoder (block-wise) Decoder (block-wise) −1 Forward transform: u = A · s Entropy decoding: fqk g = γ (b) Scalar quantization: q = α (u ) 0 k k k Inverse quantization: uk = βk (qk ) 0 −1 0 Entropy coding: b = γ( fqk g ) Inverse transform: s = A · u Heiko Schwarz (Freie Universität Berlin) — Data Compression: Transform Coding in Practice 2 / 50 Last Lecture Last Lectures: Orthogonal Block Transforms Transform matrix has property: A−1 = AT (special case of unitary matrix: A−1 = (A∗)T) 2 b0 3 2 3 6 b1 7 6 7 6 7 6 7 6 b2 7 −1 T 6 b b b ··· b 7 A = 6 7 A = A = 6 0 1 2 N−1 7 6 . 7 6 7 4 . 5 4 5 bN−1 −1 T Basis vectors bk (rows of A, columns of A = A ) form an orthonormal basis Geometric interpretation: Rotation (and potential reflection) in N-dimensional signal space Why Orthogonal Transforms ? 0 2 0 2 Same MSE distortion in sample and transform space: jju − ujj2 = jjs − sjj2 Minimum MSE in signal space can be achieved by minimization of MSE for each individual transform coefficient Heiko Schwarz (Freie Universität Berlin) — Data Compression: Transform Coding in Practice 3 / 50 Last Lecture Last Lectures: Bit
    [Show full text]