Homework Set 3 Solutions REVISED EECS 455 Oct. 25, Revisions to solutions to problems 2, 6 and marked with ***

Size: px
Start display at page:

Download "Homework Set 3 Solutions REVISED EECS 455 Oct. 25, Revisions to solutions to problems 2, 6 and marked with ***"

Transcription

1 Homework Set 3 Solutions REVISED EECS 455 Oct. 25, 2006 Revisions to solutions to problems 2, 6 and marked with ***. Let U be a continuous random variable with pdf p U (u). Consider an N-point quantizer for U with levels ^x,..., ^x N and thresholds a,..., a N whose is denoted D U. Let V = bu + c where b>0 and c are constants. Thus, V is a scaled and shifted version of U. From random variable theory, we know that the pdf of V is related to that of U via p V (v) = b p U( v-c b ) That is the pdf of V is a scaled and shifted version of the pdf of U. Now consider a scaled and shifted quantizer for V with levels b ^x +c,..., b ^x N +c and thresholds b a +c,..., a N +c whose is denoted D V. (a) Sketch an example of p U (u) and the corresponding p V (v). U(u) = 2U + V(v) (b) Show that σ 2 V = b2 σ 2 U, where σ2 U and σ2 V denote the variances of U and V, respectively. σ 2 V = E (V-E[V])2 = E (bu+c - E[bU+c]) 2 = E (bu+c-be[u]-c) 2 since E[bU+c]=bE[U]+c = E (b(u-e[u])) 2 = b 2 E (U-E[U]) 2 = b 2 σ 2 U (c) Show that D V = b 2 D U. N b a i +c D V = (v - b ^x i -c) 2 N b a i +c p V (v) dv = (v - b ^x i -c) 2 b p U( v-c b ) dv i= b a i- +c i= b a i- +c N a i = (bu+c - b ^x i -c) 2 b p U(u) du with u = v-c b i= a i-, so v = bu+c = b 2 N a i (u - ^x i ) 2 i= a i- b p U(u) du = b 2 D V (d) Let D * U,N, respectively D* V,N, denote the least of any quantizer with N levels for U, respectively V. Show D * V,N b2 D * U,N Let ^x,..., ^x N and a,..., a N denote the levels and thresholds of an optimal N-point quantizer for U. It has distortion D U = D * U,N. Consider the scaled and shifted quantizer for V with levels b ^x +c,..., b ^x N +c and thresholds b a +c,..., a N +c whose is denoted D V. From Part (c) we know D V = b 2 D U. We also know that since D * V,N is the least distortion of any N point quantizer for V, D * V,N D V. Putting all these facts together we find D * V,N D V = b 2 D U = b 2 D * U,N

2 (e) Show D * V,N b2 D * U,N We note that U = b V - c b and we use the same approach as in Part (d) except b is replaced by /b and c is replaced by -c/b. Let ^x,..., ^x N and a,..., a N denote the levels and thresholds of an optimal N-point quantizer for V. It has distortion D V = D * V,N. Consider the scaled and shifted quantizer for U with levels ( ^x -c)/b,..., (^x N -c)/b and thresholds (a -c)/b,..., (a N -c)/b whose is denoted D U. From Part (c) we know D U = D V /b 2. We also know that since D * U,N is the least distortion of any N point quantizer for U, D * U,N D U. Putting all these facts together we find D * U,N D U = D U /b 2 = D * U,N /b2 Important Notes:. We conclude parts (c) and (d) that D * V,N = b2 D * U,N. 2. We also conclude that if we have a quantizer that is optimal for one pdf, then an optimal quantizer for a scaled and shifted pdf is simply a scaled and shifted version of the original quantizer. 2. Problem 7.9, p. 37. Note that P X is just the variance of the random variables being quantized. You will need to make use of the conclusions Problem. () We need to design an optimal 6-level uniform scalar quantizer for a Gaussian source with variance σ 2 = 0. The step size of this quantizer is σ = 0 times the step size The other issue is the offset, i.e. the location of the levels. Since the Gaussian density is symmetric about 0 we'll make the levels and thresholds symmetric about 0. The result is thresholds levels ***(2) The resulting distortion is σ 2 = 0 times the distortion of, which is ***(3) With 8 levels, = = The improvement in SNR is 0 log = 5.88 db Problem 7., p. 372 () We need to find an optimal 6-level nonuniform scalar quantizer for a Gaussian with variance σ 2 = 0, we take the levels and thresholds found in Table 7.2 and multiply them by σ = 0. thresholds levels (2) The resulting distortion is σ 2 =0 times the distortion of Table 7.2, namely, (3) With 8 levels, = = The improvement in SNR is 0 log = 5.62 db 2

3 4. Show that for a Gaussian density, β = 2# 3 3/2, where β is the term appearing in the high-resolution for the distortion of an optimal nonuniform quantizer with N levels, when N is large, namely D 2 N 2 β (this is called the Panter-Dite ) Let the Gaussian density be p(u) = 2" exp{-u2 2 } with variance σ2 =. Then β = σ 2 p /3 (u) du 3 = - - = (2") = 2 " 3 3/2 /6 2"3-2"3 (2")/6 exp{-u2 6 } du 3 u2 exp{- 2 3 } du 3 notice that the integral equals one because it is the integral of a Gaussian 5. Consider a Gaussian density with variance σ 2 = There were errors in the s given in for and D: Here are the correct s: For an optimum uniform scalar quantizer for a Gaussian source with variance, 4 σ ln N and D σ 4 ln N N 2 3 N 2 = 4 R σ2 3 (ln 2) 2 2R (a) For an optimal uniform scalar quantizer for this pdf, complete the following table: R 2 /2 % of col 3 % of col 5 % of col % 4.3% 36.4% % 8.2% 2.8% % 23.0% 5.7% % 24.2% 25.% % 23.7% 29.3% Comment on the of the s in columns 3, 5 and 6. The of Column 3 improves as R increases. For R = 5, it is accurate to about 5%. The Columns 5 & 6 do not show improving as R increases. The theory says the s become accurate for large R. Apparently, R must be larger than 5. (b) Complete the following table for the same situation: R db 2 /2 db db col3-col4 col5-col2 col6-col % % % % %. Comment again on the of the s in columns 3, 5 and 6. The of Column 3 improves as R increases. For R = 5, it is accurate to about.7db. The Columns 5 & 6 do not show improving as R increases. The theory says the s becomes accurate for large R. At R = 5, the of column 6 for SNR is about db. Apparently, R must be larger than 5 for greater. 3

4 (c) For an optimal nonuniform quantizer for the same pdf, complete the following table: R Table 7.2 col % % % % We used the Panter-Dite D 2 σ2 β 2-2R, with β = 2" 3 3/2 = Comment on the of the in column 3. The improves steadily as R increases. It's about 0% when R=4. (d) Complete the following table for the same situation: R db Table 7.2 col3-col2 db Comment again on the of the in column 3. Again, the improves steadily as R increases. It's about.5 db when R=4. 6. (a) CD recordings are made with a uniform scalar quantizer with rate 6 bits/sample. Assuming that music samples are Gaussian with variance σ 2 and assuming that the level spacing is chosen optimally for this source model, estimate the SNR of CD recordings. As in Problem 5, Part (a), we estimate SNR using SNR = 0 log σ 2 0 D, with D 4 R σ2 3 (ln 2) 2 2R. The result is SNR = 84.6 db. (b) Suppose instead that optimal nonuniform scalar quantization were used with the same rate (6 bits/sample). Estimate how much larger the SNR would be than in Part (a). As in Problem 5, Part (a), we estimate SNR using SNR = 0 log σ 2 0 D, with D 2 σ2 β 2-2R, with β = 2" 3 3/2 = The result is SNR = 92.0 db. (c) Suppose instead that optimal nonuniform scalar quantization were used with its rate chosen to give the same SNR as in part (a). Estimate how much more music could be stored on a CD. Express your answer in percent. Approach : Solving for the rate that gives SNR = 84.6 db with nonuniform scalar quantization gives R = 4.7, which is 8.% less than rate R = 6. Therefore, one can store 8.% more music. *** NOTE: Rounding up the rate to 5 is fine. This gives a 6.25% improvement instead of 8.%. Approach 2: At high rates SNR changes at 6 db per bit, if R = 6 gives 92.0 db and we wish to reduce SNR to 84.6 db, then the rate reduction is ( )/6 =.23. So we use R = , which is 7.5% less than rate R = 6. Therefore, one can store 7.5% more music. The difference between this and the previous answer is due to round off errors 4

5 7. In this problem you will use Matlab to perform uniform scalar quantization on an image. From the Homework Auxiliary Files webpage, download the template Matlab script uniformimagequant_template.m and the image peppers.tif. The Matlab script has a couple of lines that you must complete in order that it will do uniform scalar quantization of the image 'peppers' at a variety of rates and display the results. (Two other images are supplied in case you want to try the script on other images.) (a) Complete the script and include a copy of it and a printout of the displayed figure in your homework. (Among other things, the script requires one to compute. Since we don't have a probabilistic/statistical model (e.g. pdf) for the image, one needs to compute the empirical between the original and the quantized images. Specifically, one computes the sum of the squares of the pixel-bypixel differences between the original and quantized images, divided by the number of pixels.) The printout and script are given below. (b) Compare the 's computed by the script to the 2/2. (You can do this by hand, or modify the script so that it computes.) R / We see that 2 /2 is ver accurate until R = 2 or. Answers to the following questions are somewhat subjective and will depend on how large are the images on your screeen. It is recommended that you make them as large as possible by expanding the window as much as possible. (c) Estimate the size of the individual images on your screen. 2 /4 inch by 2 /4 inch (d) What is the smallest rate at which you cannot see evidence of quantization? What is the corresponding SNR? R = 5 (e) What is the smallest rate that you think would be acceptable, i.e. not too annoying, for posting on the internet? What is the corresponding SNR? R = 3 (f) What is the smallest rate at which someone can clearly recognize what is in the image? What is the corresponding SNR? R = 2 script: %%% uniformimagequant.m %%% a script to perform uniform scalar quantization of an image x = double(imread('peppers.tif','tiff')) ; R = [ ] ; % set of rates at which to quantize %% compute variance mean = sum(sum( x ) ) / prod(size(x)) variance = sum(sum( (x-mean).^2 )) / prod(size(x)) %% perform quantization and display the quantized image for k = :length(r) L = 2^R(k) ; delta = 255/L ; %compute step size of uniform quantizer y = ( floor(x/delta) +.5 ) * delta ; %compute quantized image mse = sum(sum( (x-y).^2 )); %compute mse 5

6 end mse = mse/prod(size(x)) ; SNR = 0 * log0( variance /mse ) ; %compute SNR subplot(3,2,k) ; imagesc(y); %display image axis image; colormap gray; xlabel(['r = ' num2str(r(k)) ', = ' num2str(mse,3) ', SNR = ' num2str(snr,3) 'db']) printout: 6

7 8. In this problem you will run a Matlab script that designs and runs nonuniform scalar quantization on an image. From the Homework Auxiliary Files webpage, download the Matlab script nonuniformimagequant.m and the image peppers.tif. Run the script. (a) Include a printout of the displayed figure in your homework. Printout is given below The answers to parts (b)-(e) are somewhat subjective. and will depend somewhat on how large the images are on your screeen. As before, it is recommended that you make them as large as possible by expanding the window as much as possible. (b) What is the smallest rate at which you cannot see evidence of quantization? What is the corresponding SNR? R = 4 (c) What is the smallest rate that you think would be acceptable, i.e. not too annoying, for posting on the internet? What is the corresponding SNR? R = 3 (d) What is the smallest rate at which someone can clearly recognize what is in the image? What is the corresponding SNR? R = 2 (e) Comment on the improvement of nonuniform scalar quantization over uniform. The SNR shows sizable improvements at rates less than 4. Gains:.9 db,.7 db,.3 db,.6 db at rates 4, 3, 2,, respectively. Qualitatively, we also see improvements at these rates (f) For the quantizer with 6 levels, find the widths of the largest and smallest quantization cells and their ratio. The thresholds are The largest cell is [83.2,255] which has width 7.8. The narrowest cells are [72.5,83.2] which has width 0.7. The ratio is 6.7 This indicates that the quantizer has a lot of nonuniformity. Notice that there is another nearly equally small cell, namley, [84.0,94.8] with width 0.8. It is no coincidence that this cell and the narrowest are located where the histogram is largest. Note: In practice, one would ordinarily design a scalar quantizer based on a training set of many images, and then apply it to images that were not in the training set. For example, you might modify the script so that it designs the quantizer based on the two images baboon and camerman and then run the quantizer on peppers. It will be interesting to see how much this reduces SNR. 7

Example: for source

Example: for source Nonuniform scalar quantizer References: Sayood Chap. 9, Gersho and Gray, Chap.'s 5 and 6. The basic idea: For a nonuniform source density, put smaller cells and levels where the density is larger, thereby

More information

Gaussian source Assumptions d = (x-y) 2, given D, find lower bound of I(X;Y)

Gaussian source Assumptions d = (x-y) 2, given D, find lower bound of I(X;Y) Gaussian source Assumptions d = (x-y) 2, given D, find lower bound of I(X;Y) E{(X-Y) 2 } D

More information

Digital Signal Processing 2/ Advanced Digital Signal Processing Lecture 3, SNR, non-linear Quantisation Gerald Schuller, TU Ilmenau

Digital Signal Processing 2/ Advanced Digital Signal Processing Lecture 3, SNR, non-linear Quantisation Gerald Schuller, TU Ilmenau Digital Signal Processing 2/ Advanced Digital Signal Processing Lecture 3, SNR, non-linear Quantisation Gerald Schuller, TU Ilmenau What is our SNR if we have a sinusoidal signal? What is its pdf? Basically

More information

at Some sort of quantization is necessary to represent continuous signals in digital form

at Some sort of quantization is necessary to represent continuous signals in digital form Quantization at Some sort of quantization is necessary to represent continuous signals in digital form x(n 1,n ) x(t 1,tt ) D Sampler Quantizer x q (n 1,nn ) Digitizer (A/D) Quantization is also used for

More information

Problem Session #5. EE368/CS232 Digital Image Processing

Problem Session #5. EE368/CS232 Digital Image Processing Problem Session #5 EE368/CS232 Digital Image Processing 1. Solving a Jigsaw Puzzle Please download the image hw5_puzzle_pieces.jpg from the handouts webpage, which shows the pieces of a jigsaw puzzle.

More information

Random Signal Transformations and Quantization

Random Signal Transformations and Quantization York University Department of Electrical Engineering and Computer Science EECS 4214 Lab #3 Random Signal Transformations and Quantization 1 Purpose In this lab, you will be introduced to transformations

More information

Scalar and Vector Quantization. National Chiao Tung University Chun-Jen Tsai 11/06/2014

Scalar and Vector Quantization. National Chiao Tung University Chun-Jen Tsai 11/06/2014 Scalar and Vector Quantization National Chiao Tung University Chun-Jen Tsai 11/06/014 Basic Concept of Quantization Quantization is the process of representing a large, possibly infinite, set of values

More information

Predictive Coding. Prediction Prediction in Images

Predictive Coding. Prediction Prediction in Images Prediction Prediction in Images Predictive Coding Principle of Differential Pulse Code Modulation (DPCM) DPCM and entropy-constrained scalar quantization DPCM and transmission errors Adaptive intra-interframe

More information

Predictive Coding. Prediction

Predictive Coding. Prediction Predictive Coding Prediction Prediction in Images Principle of Differential Pulse Code Modulation (DPCM) DPCM and entropy-constrained scalar quantization DPCM and transmission errors Adaptive intra-interframe

More information

The information loss in quantization

The information loss in quantization The information loss in quantization The rough meaning of quantization in the frame of coding is representing numerical quantities with a finite set of symbols. The mapping between numbers, which are normally

More information

Quantization. Introduction. Roadmap. Optimal Quantizer Uniform Quantizer Non Uniform Quantizer Rate Distorsion Theory. Source coding.

Quantization. Introduction. Roadmap. Optimal Quantizer Uniform Quantizer Non Uniform Quantizer Rate Distorsion Theory. Source coding. Roadmap Quantization Optimal Quantizer Uniform Quantizer Non Uniform Quantizer Rate Distorsion Theory Source coding 2 Introduction 4 1 Lossy coding Original source is discrete Lossless coding: bit rate

More information

Review of Quantization. Quantization. Bring in Probability Distribution. L-level Quantization. Uniform partition

Review of Quantization. Quantization. Bring in Probability Distribution. L-level Quantization. Uniform partition Review of Quantization UMCP ENEE631 Slides (created by M.Wu 004) Quantization UMCP ENEE631 Slides (created by M.Wu 001/004) L-level Quantization Minimize errors for this lossy process What L values to

More information

Digital Signal Processing

Digital Signal Processing COMP ENG 4TL4: Digital Signal Processing Notes for Lecture #3 Wednesday, September 10, 2003 1.4 Quantization Digital systems can only represent sample amplitudes with a finite set of prescribed values,

More information

Computer projects for Mathematical Statistics, MA 486. Some practical hints for doing computer projects with MATLAB:

Computer projects for Mathematical Statistics, MA 486. Some practical hints for doing computer projects with MATLAB: Computer projects for Mathematical Statistics, MA 486. Some practical hints for doing computer projects with MATLAB: You can save your project to a text file (on a floppy disk or CD or on your web page),

More information

EE368B Image and Video Compression

EE368B Image and Video Compression EE368B Image and Video Compression Homework Set #2 due Friday, October 20, 2000, 9 a.m. Introduction The Lloyd-Max quantizer is a scalar quantizer which can be seen as a special case of a vector quantizer

More information

Course on Inverse Problems

Course on Inverse Problems Stanford University School of Earth Sciences Course on Inverse Problems Albert Tarantola Third Lesson: Probability (Elementary Notions) Let u and v be two Cartesian parameters (then, volumetric probabilities

More information

Problem Set III Quantization

Problem Set III Quantization Problem Set III Quantization Christopher Tsai Problem #2.1 Lloyd-Max Quantizer To train both the Lloyd-Max Quantizer and our Entropy-Constrained Quantizer, we employ the following training set of images,

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Lesson 7 Delta Modulation and DPCM Instructional Objectives At the end of this lesson, the students should be able to: 1. Describe a lossy predictive coding scheme.

More information

Chapter 6 The Standard Deviation as a Ruler and the Normal Model

Chapter 6 The Standard Deviation as a Ruler and the Normal Model Chapter 6 The Standard Deviation as a Ruler and the Normal Model Overview Key Concepts Understand how adding (subtracting) a constant or multiplying (dividing) by a constant changes the center and/or spread

More information

EE-597 Notes Quantization

EE-597 Notes Quantization EE-597 Notes Quantization Phil Schniter June, 4 Quantization Given a continuous-time and continuous-amplitude signal (t, processing and storage by modern digital hardware requires discretization in both

More information

University of Delaware Department of Mathematical Sciences Math 353 Engineering Mathematics III 06S C. Bacuta

University of Delaware Department of Mathematical Sciences Math 353 Engineering Mathematics III 06S C. Bacuta University of Delaware Department of Mathematical Sciences Math 353 Engineering Mathematics III 06S C. Bacuta Homework 4: Due Friday, 0/4/06, 10:00am Part I) (1) Section., Problems #3(a,d), 9, 11. () Apply

More information

Designing Information Devices and Systems I Fall 2018 Homework 5

Designing Information Devices and Systems I Fall 2018 Homework 5 Last Updated: 08-09-9 0:6 EECS 6A Designing Information Devices and Systems I Fall 08 Homework 5 This homework is due September 8, 08, at 3:59. Self-grades are due October, 08, at 3:59. Submission Format

More information

Quantization 2.1 QUANTIZATION AND THE SOURCE ENCODER

Quantization 2.1 QUANTIZATION AND THE SOURCE ENCODER 2 Quantization After the introduction to image and video compression presented in Chapter 1, we now address several fundamental aspects of image and video compression in the remaining chapters of Section

More information

Mathematical Tools for Neuroscience (NEU 314) Princeton University, Spring 2016 Jonathan Pillow. Homework 8: Logistic Regression & Information Theory

Mathematical Tools for Neuroscience (NEU 314) Princeton University, Spring 2016 Jonathan Pillow. Homework 8: Logistic Regression & Information Theory Mathematical Tools for Neuroscience (NEU 34) Princeton University, Spring 206 Jonathan Pillow Homework 8: Logistic Regression & Information Theory Due: Tuesday, April 26, 9:59am Optimization Toolbox One

More information

Image and Multidimensional Signal Processing

Image and Multidimensional Signal Processing Image and Multidimensional Signal Processing Professor William Hoff Dept of Electrical Engineering &Computer Science http://inside.mines.edu/~whoff/ Image Compression 2 Image Compression Goal: Reduce amount

More information

4. Quantization and Data Compression. ECE 302 Spring 2012 Purdue University, School of ECE Prof. Ilya Pollak

4. Quantization and Data Compression. ECE 302 Spring 2012 Purdue University, School of ECE Prof. Ilya Pollak 4. Quantization and Data Compression ECE 32 Spring 22 Purdue University, School of ECE Prof. What is data compression? Reducing the file size without compromising the quality of the data stored in the

More information

Pulse-Code Modulation (PCM) :

Pulse-Code Modulation (PCM) : PCM & DPCM & DM 1 Pulse-Code Modulation (PCM) : In PCM each sample of the signal is quantized to one of the amplitude levels, where B is the number of bits used to represent each sample. The rate from

More information

Ch. 10 Vector Quantization. Advantages & Design

Ch. 10 Vector Quantization. Advantages & Design Ch. 10 Vector Quantization Advantages & Design 1 Advantages of VQ There are (at least) 3 main characteristics of VQ that help it outperform SQ: 1. Exploit Correlation within vectors 2. Exploit Shape Flexibility

More information

Designing Information Devices and Systems I Spring 2018 Homework 13

Designing Information Devices and Systems I Spring 2018 Homework 13 EECS 16A Designing Information Devices and Systems I Spring 2018 Homework 13 This homework is due April 30, 2018, at 23:59. Self-grades are due May 3, 2018, at 23:59. Submission Format Your homework submission

More information

C.M. Liu Perceptual Signal Processing Lab College of Computer Science National Chiao-Tung University

C.M. Liu Perceptual Signal Processing Lab College of Computer Science National Chiao-Tung University Quantization C.M. Liu Perceptual Signal Processing Lab College of Computer Science National Chiao-Tung University http://www.csie.nctu.edu.tw/~cmliu/courses/compression/ Office: EC538 (03)5731877 cmliu@cs.nctu.edu.tw

More information

Navneet Agrawal Deptt. Of Electronics & Communication Engineering CTAE,MPUAT,Udaipur,India

Navneet Agrawal Deptt. Of Electronics & Communication Engineering CTAE,MPUAT,Udaipur,India Navneet Agrawal et al / (IJCSE) International Journal on Computer Science and Engineering, Saturation Adaptive Quantizer Design for Synthetic Aperture Radar Data Compression Navneet Agrawal Deptt. Of Electronics

More information

MAT 275 Laboratory 4 MATLAB solvers for First-Order IVP

MAT 275 Laboratory 4 MATLAB solvers for First-Order IVP MAT 275 Laboratory 4 MATLAB solvers for First-Order IVP In this laboratory session we will learn how to. Use MATLAB solvers for solving scalar IVP 2. Use MATLAB solvers for solving higher order ODEs and

More information

Signal types. Signal characteristics: RMS, power, db Probability Density Function (PDF). Analogue-to-Digital Conversion (ADC).

Signal types. Signal characteristics: RMS, power, db Probability Density Function (PDF). Analogue-to-Digital Conversion (ADC). Signal types. Signal characteristics:, power, db Probability Density Function (PDF). Analogue-to-Digital Conversion (ADC). Signal types Stationary (average properties don t vary with time) Deterministic

More information

Audio /Video Signal Processing. Lecture 2, Quantization, SNR Gerald Schuller, TU Ilmenau

Audio /Video Signal Processing. Lecture 2, Quantization, SNR Gerald Schuller, TU Ilmenau Audio /Video Signal Processing Lecture 2, Quantization, SNR Gerald Schuller, TU Ilmenau Quantization Signal to Noise Ratio (SNR). Assume we have a A/D converter with a quantizer with a certain number of

More information

Waveform-Based Coding: Outline

Waveform-Based Coding: Outline Waveform-Based Coding: Transform and Predictive Coding Yao Wang Polytechnic University, Brooklyn, NY11201 http://eeweb.poly.edu/~yao Based on: Y. Wang, J. Ostermann, and Y.-Q. Zhang, Video Processing and

More information

CSC2515 Assignment #2

CSC2515 Assignment #2 CSC2515 Assignment #2 Due: Nov.4, 2pm at the START of class Worth: 18% Late assignments not accepted. 1 Pseudo-Bayesian Linear Regression (3%) In this question you will dabble in Bayesian statistics and

More information

CODING SAMPLE DIFFERENCES ATTEMPT 1: NAIVE DIFFERENTIAL CODING

CODING SAMPLE DIFFERENCES ATTEMPT 1: NAIVE DIFFERENTIAL CODING 5 0 DPCM (Differential Pulse Code Modulation) Making scalar quantization work for a correlated source -- a sequential approach. Consider quantizing a slowly varying source (AR, Gauss, ρ =.95, σ 2 = 3.2).

More information

LEC1: Instance-based classifiers

LEC1: Instance-based classifiers LEC1: Instance-based classifiers Dr. Guangliang Chen February 2, 2016 Outline Having data ready knn kmeans Summary Downloading data Save all the scripts (from course webpage) and raw files (from LeCun

More information

Digital Image Processing Lectures 25 & 26

Digital Image Processing Lectures 25 & 26 Lectures 25 & 26, Professor Department of Electrical and Computer Engineering Colorado State University Spring 2015 Area 4: Image Encoding and Compression Goal: To exploit the redundancies in the image

More information

Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi

Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 41 Pulse Code Modulation (PCM) So, if you remember we have been talking

More information

ADSP ADSP ADSP ADSP. Advanced Digital Signal Processing (18-792) Spring Fall Semester, Department of Electrical and Computer Engineering

ADSP ADSP ADSP ADSP. Advanced Digital Signal Processing (18-792) Spring Fall Semester, Department of Electrical and Computer Engineering Advanced Digital Signal rocessing (18-792) Spring Fall Semester, 201 2012 Department of Electrical and Computer Engineering ROBLEM SET 8 Issued: 10/26/18 Due: 11/2/18 Note: This problem set is due Friday,

More information

Analysis of Finite Wordlength Effects

Analysis of Finite Wordlength Effects Analysis of Finite Wordlength Effects Ideally, the system parameters along with the signal variables have infinite precision taing any value between and In practice, they can tae only discrete values within

More information

WFC3 TV2 Testing: IR Channel Read Noise

WFC3 TV2 Testing: IR Channel Read Noise Instrument Science Report WFC3 2008-04 WFC3 TV2 Testing: IR Channel Read B. Hilbert 12 Feb 2008 ABSTRACT Using data taken during WFC3's Thermal Vacuum 2 (TV2) testing campaign, we have characterized the

More information

Vector Quantization Encoder Decoder Original Form image Minimize distortion Table Channel Image Vectors Look-up (X, X i ) X may be a block of l

Vector Quantization Encoder Decoder Original Form image Minimize distortion Table Channel Image Vectors Look-up (X, X i ) X may be a block of l Vector Quantization Encoder Decoder Original Image Form image Vectors X Minimize distortion k k Table X^ k Channel d(x, X^ Look-up i ) X may be a block of l m image or X=( r, g, b ), or a block of DCT

More information

Tutorial Three: Loops and Conditionals

Tutorial Three: Loops and Conditionals Tutorial Three: Loops and Conditionals Imad Pasha Chris Agostino February 18, 2015 1 Introduction In lecture Monday we learned that combinations of conditionals and loops could make our code much more

More information

EXAMPLE OF SCALAR AND VECTOR QUANTIZATION

EXAMPLE OF SCALAR AND VECTOR QUANTIZATION EXAMPLE OF SCALAR AD VECTOR QUATIZATIO Source sequence : This could be the output of a highly correlated source. A scalar quantizer: =1, M=4 C 1 = {w 1,w 2,w 3,w 4 } = {-4, -1, 1, 4} = codeboo of quantization

More information

Random signals II. ÚPGM FIT VUT Brno,

Random signals II. ÚPGM FIT VUT Brno, Random signals II. Jan Černocký ÚPGM FIT VUT Brno, cernocky@fit.vutbr.cz 1 Temporal estimate of autocorrelation coefficients for ergodic discrete-time random process. ˆR[k] = 1 N N 1 n=0 x[n]x[n + k],

More information

EE263 homework 3 solutions

EE263 homework 3 solutions EE263 Prof. S. Boyd EE263 homework 3 solutions 2.17 Gradient of some common functions. Recall that the gradient of a differentiable function f : R n R, at a point x R n, is defined as the vector f(x) =

More information

PHY131H1F Class 3. From Knight Chapter 1:

PHY131H1F Class 3. From Knight Chapter 1: PHY131H1F Class 3 Today: Error Analysis Significant Figures Unit Conversion Normal Distribution Standard Deviation Reading Error Propagation of Errors Error in the Mean From Knight Chapter 1: 1 Significant

More information

Image Processing. Waleed A. Yousef Faculty of Computers and Information, Helwan University. April 3, 2010

Image Processing. Waleed A. Yousef Faculty of Computers and Information, Helwan University. April 3, 2010 Image Processing Waleed A. Yousef Faculty of Computers and Information, Helwan University. April 3, 2010 Ch3. Image Enhancement in the Spatial Domain Note that T (m) = 0.5 E. The general law of contrast

More information

Number Representation and Waveform Quantization

Number Representation and Waveform Quantization 1 Number Representation and Waveform Quantization 1 Introduction This lab presents two important concepts for working with digital signals. The first section discusses how numbers are stored in memory.

More information

Proyecto final de carrera

Proyecto final de carrera UPC-ETSETB Proyecto final de carrera A comparison of scalar and vector quantization of wavelet decomposed images Author : Albane Delos Adviser: Luis Torres 2 P a g e Table of contents Table of figures...

More information

ENGN1300: Structural Analysis

ENGN1300: Structural Analysis ENGN1300: Structural Analysis Homework 4 Due Wednesday, March 3, 2010 Division of Engineering Brown University 1. For the statically indeterminate structure shown below, all members have identical values

More information

Overview. Analog capturing device (camera, microphone) PCM encoded or raw signal ( wav, bmp, ) A/D CONVERTER. Compressed bit stream (mp3, jpg, )

Overview. Analog capturing device (camera, microphone) PCM encoded or raw signal ( wav, bmp, ) A/D CONVERTER. Compressed bit stream (mp3, jpg, ) Overview Analog capturing device (camera, microphone) Sampling Fine Quantization A/D CONVERTER PCM encoded or raw signal ( wav, bmp, ) Transform Quantizer VLC encoding Compressed bit stream (mp3, jpg,

More information

Problem Set 2. MAS 622J/1.126J: Pattern Recognition and Analysis. Due: 5:00 p.m. on September 30

Problem Set 2. MAS 622J/1.126J: Pattern Recognition and Analysis. Due: 5:00 p.m. on September 30 Problem Set 2 MAS 622J/1.126J: Pattern Recognition and Analysis Due: 5:00 p.m. on September 30 [Note: All instructions to plot data or write a program should be carried out using Matlab. In order to maintain

More information

1 A Support Vector Machine without Support Vectors

1 A Support Vector Machine without Support Vectors CS/CNS/EE 53 Advanced Topics in Machine Learning Problem Set 1 Handed out: 15 Jan 010 Due: 01 Feb 010 1 A Support Vector Machine without Support Vectors In this question, you ll be implementing an online

More information

Convergence of Random Processes

Convergence of Random Processes Convergence of Random Processes DS GA 1002 Probability and Statistics for Data Science http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall17 Carlos Fernandez-Granda Aim Define convergence for random

More information

E303: Communication Systems

E303: Communication Systems E303: Communication Systems Professor A. Manikas Chair of Communications and Array Processing Imperial College London Principles of PCM Prof. A. Manikas (Imperial College) E303: Principles of PCM v.17

More information

PHYS 114 Exam 1 Answer Key NAME:

PHYS 114 Exam 1 Answer Key NAME: PHYS 4 Exam Answer Key AME: Please answer all of the questions below. Each part of each question is worth points, except question 5, which is worth 0 points.. Explain what the following MatLAB commands

More information

MAT 275 Laboratory 4 MATLAB solvers for First-Order IVP

MAT 275 Laboratory 4 MATLAB solvers for First-Order IVP MATLAB sessions: Laboratory 4 MAT 275 Laboratory 4 MATLAB solvers for First-Order IVP In this laboratory session we will learn how to. Use MATLAB solvers for solving scalar IVP 2. Use MATLAB solvers for

More information

Lab 1: Introduction to Measurement

Lab 1: Introduction to Measurement Lab 1: Introduction to Measurement Instructor: Professor Dr. K. H. Chu Measurement is the foundation of gathering data in science. In order to perform successful experiments, it is vitally important to

More information

EE4304 C-term 2007: Lecture 17 Supplemental Slides

EE4304 C-term 2007: Lecture 17 Supplemental Slides EE434 C-term 27: Lecture 17 Supplemental Slides D. Richard Brown III Worcester Polytechnic Institute, Department of Electrical and Computer Engineering February 5, 27 Geometric Representation: Optimal

More information

Lab 2 Worksheet. Problems. Problem 1: Geometry and Linear Equations

Lab 2 Worksheet. Problems. Problem 1: Geometry and Linear Equations Lab 2 Worksheet Problems Problem : Geometry and Linear Equations Linear algebra is, first and foremost, the study of systems of linear equations. You are going to encounter linear systems frequently in

More information

Introduction to Computer Vision

Introduction to Computer Vision Introduction to Computer Vision Michael J. Black Oct 2009 PCA and applications Probability and classification Admin Assignment 1 grades back shortly. Assignment 2, parts 1 and 2 due October 22 at 11:00am

More information

Lesson 8: Velocity. Displacement & Time

Lesson 8: Velocity. Displacement & Time Lesson 8: Velocity Two branches in physics examine the motion of objects: Kinematics: describes the motion of objects, without looking at the cause of the motion (kinematics is the first unit of Physics

More information

Image Compression Using the Haar Wavelet Transform

Image Compression Using the Haar Wavelet Transform College of the Redwoods http://online.redwoods.cc.ca.us/instruct/darnold/laproj/fall2002/ames/ 1/33 Image Compression Using the Haar Wavelet Transform Greg Ames College of the Redwoods Math 45 Linear Algebra

More information

Lab 4: Quantization, Oversampling, and Noise Shaping

Lab 4: Quantization, Oversampling, and Noise Shaping Lab 4: Quantization, Oversampling, and Noise Shaping Due Friday 04/21/17 Overview: This assignment should be completed with your assigned lab partner(s). Each group must turn in a report composed using

More information

Density Estimation: ML, MAP, Bayesian estimation

Density Estimation: ML, MAP, Bayesian estimation Density Estimation: ML, MAP, Bayesian estimation CE-725: Statistical Pattern Recognition Sharif University of Technology Spring 2013 Soleymani Outline Introduction Maximum-Likelihood Estimation Maximum

More information

Inverse Problems in Image Processing

Inverse Problems in Image Processing H D Inverse Problems in Image Processing Ramesh Neelamani (Neelsh) Committee: Profs. R. Baraniuk, R. Nowak, M. Orchard, S. Cox June 2003 Inverse Problems Data estimation from inadequate/noisy observations

More information

MAT 275 Laboratory 4 MATLAB solvers for First-Order IVP

MAT 275 Laboratory 4 MATLAB solvers for First-Order IVP MAT 75 Laboratory 4 MATLAB solvers for First-Order IVP In this laboratory session we will learn how to. Use MATLAB solvers for solving scalar IVP. Use MATLAB solvers for solving higher order ODEs and systems

More information

Structural Geology, GEOL 330 Spring 2012

Structural Geology, GEOL 330 Spring 2012 Developing the Magic Eye for folds This lab exercise is designed to get you thinking about the chronology of structural processes and and the resultant map patterns in areas with flat topography. You may

More information

DS-GA 1002 Lecture notes 11 Fall Bayesian statistics

DS-GA 1002 Lecture notes 11 Fall Bayesian statistics DS-GA 100 Lecture notes 11 Fall 016 Bayesian statistics In the frequentist paradigm we model the data as realizations from a distribution that depends on deterministic parameters. In contrast, in Bayesian

More information

1. In Activity 1-1, part 3, how do you think graph a will differ from graph b? 3. Draw your graph for Prediction 2-1 below:

1. In Activity 1-1, part 3, how do you think graph a will differ from graph b? 3. Draw your graph for Prediction 2-1 below: PRE-LAB PREPARATION SHEET FOR LAB 1: INTRODUCTION TO MOTION (Due at the beginning of Lab 1) Directions: Read over Lab 1 and then answer the following questions about the procedures. 1. In Activity 1-1,

More information

Objectives of Image Coding

Objectives of Image Coding Objectives of Image Coding Representation of an image with acceptable quality, using as small a number of bits as possible Applications: Reduction of channel bandwidth for image transmission Reduction

More information

Optimizing Motion Vector Accuracy in Block-Based Video Coding

Optimizing Motion Vector Accuracy in Block-Based Video Coding revised and resubmitted to IEEE Trans. Circuits and Systems for Video Technology, 2/00 Optimizing Motion Vector Accuracy in Block-Based Video Coding Jordi Ribas-Corbera Digital Media Division Microsoft

More information

HOMEWORK #4: LOGISTIC REGRESSION

HOMEWORK #4: LOGISTIC REGRESSION HOMEWORK #4: LOGISTIC REGRESSION Probabilistic Learning: Theory and Algorithms CS 274A, Winter 2018 Due: Friday, February 23rd, 2018, 11:55 PM Submit code and report via EEE Dropbox You should submit a

More information

Soft-Output Trellis Waveform Coding

Soft-Output Trellis Waveform Coding Soft-Output Trellis Waveform Coding Tariq Haddad and Abbas Yongaçoḡlu School of Information Technology and Engineering, University of Ottawa Ottawa, Ontario, K1N 6N5, Canada Fax: +1 (613) 562 5175 thaddad@site.uottawa.ca

More information

E&CE 358, Winter 2016: Solution #2. Prof. X. Shen

E&CE 358, Winter 2016: Solution #2. Prof. X. Shen E&CE 358, Winter 16: Solution # Prof. X. Shen Email: xshen@bbcr.uwaterloo.ca Prof. X. Shen E&CE 358, Winter 16 ( 1:3-:5 PM: Solution # Problem 1 Problem 1 The signal g(t = e t, t T is corrupted by additive

More information

7.1 Sampling and Reconstruction

7.1 Sampling and Reconstruction Haberlesme Sistemlerine Giris (ELE 361) 6 Agustos 2017 TOBB Ekonomi ve Teknoloji Universitesi, Guz 2017-18 Dr. A. Melda Yuksel Turgut & Tolga Girici Lecture Notes Chapter 7 Analog to Digital Conversion

More information

Bloomsburg University Weather Viewer Quick Start Guide. Software Version 1.2 Date 4/7/2014

Bloomsburg University Weather Viewer Quick Start Guide. Software Version 1.2 Date 4/7/2014 Bloomsburg University Weather Viewer Quick Start Guide Software Version 1.2 Date 4/7/2014 Program Background / Objectives: The Bloomsburg Weather Viewer is a weather visualization program that is designed

More information

Consider the joint probability, P(x,y), shown as the contours in the figure above. P(x) is given by the integral of P(x,y) over all values of y.

Consider the joint probability, P(x,y), shown as the contours in the figure above. P(x) is given by the integral of P(x,y) over all values of y. ATMO/OPTI 656b Spring 009 Bayesian Retrievals Note: This follows the discussion in Chapter of Rogers (000) As we have seen, the problem with the nadir viewing emission measurements is they do not contain

More information

MATH0328: Numerical Linear Algebra Homework 3 SOLUTIONS

MATH0328: Numerical Linear Algebra Homework 3 SOLUTIONS MATH038: Numerical Linear Algebra Homework 3 SOLUTIONS Due Wednesday, March 8 Instructions Complete the following problems. Show all work. Only use Matlab on problems that are marked with (MATLAB). Include

More information

ECE 501b Homework #6 Due: 11/26

ECE 501b Homework #6 Due: 11/26 ECE 51b Homework #6 Due: 11/26 1. Principal Component Analysis: In this assignment, you will explore PCA as a technique for discerning whether low-dimensional structure exists in a set of data and for

More information

Image Compression. 1. Introduction. Greg Ames Dec 07, 2002

Image Compression. 1. Introduction. Greg Ames Dec 07, 2002 Image Compression Greg Ames Dec 07, 2002 Abstract Digital images require large amounts of memory to store and, when retrieved from the internet, can take a considerable amount of time to download. The

More information

Analysis of methods for speech signals quantization

Analysis of methods for speech signals quantization INFOTEH-JAHORINA Vol. 14, March 2015. Analysis of methods for speech signals quantization Stefan Stojkov Mihajlo Pupin Institute, University of Belgrade Belgrade, Serbia e-mail: stefan.stojkov@pupin.rs

More information

Understanding 1D Motion

Understanding 1D Motion Understanding 1D Motion OBJECTIVE Analyze the motion of a student walking across the room. Predict, sketch, and test position vs. time kinematics graphs. Predict, sketch, and test velocity vs. time kinematics

More information

CHAPITRE I-5 ETUDE THEORIQUE DE LA ROBUSTESSE DU QUANTIFICATEUR UNIFORME OPTIMUM

CHAPITRE I-5 ETUDE THEORIQUE DE LA ROBUSTESSE DU QUANTIFICATEUR UNIFORME OPTIMUM CHAPITRE I-5 ETUDE THEORIQUE DE LA ROBUSTESSE DU QUANTIFICATEUR UNIFORME OPTIMUM - 96 - Présentation Après avoir mis au point et validé une méthode d allocation de bits avec un découpage de la DCT en bandes

More information

Vector Quantization. Institut Mines-Telecom. Marco Cagnazzo, MN910 Advanced Compression

Vector Quantization. Institut Mines-Telecom. Marco Cagnazzo, MN910 Advanced Compression Institut Mines-Telecom Vector Quantization Marco Cagnazzo, cagnazzo@telecom-paristech.fr MN910 Advanced Compression 2/66 19.01.18 Institut Mines-Telecom Vector Quantization Outline Gain-shape VQ 3/66 19.01.18

More information

Notes on Noncoherent Integration Gain

Notes on Noncoherent Integration Gain Notes on Noncoherent Integration Gain Mark A. Richards July 2014 1 Noncoherent Integration Gain Consider threshold detection of a radar target in additive complex Gaussian noise. To achieve a certain probability

More information

MA 580; Numerical Analysis I

MA 580; Numerical Analysis I MA 580; Numerical Analysis I C. T. Kelley NC State University tim kelley@ncsu.edu Version of October 23, 2016 NCSU, Fall 2016 c C. T. Kelley, I. C. F. Ipsen, 2016 MA 580, Fall 2016 1 / 43 Contents 1 Introduction

More information

ECE Homework Set 2

ECE Homework Set 2 1 Solve these problems after Lecture #4: Homework Set 2 1. Two dice are tossed; let X be the sum of the numbers appearing. a. Graph the CDF, FX(x), and the pdf, fx(x). b. Use the CDF to find: Pr(7 X 9).

More information

Column: The Physics of Digital Information 1

Column: The Physics of Digital Information 1 Column: The Physics of Digital Information 1 Fred Cohen One of the interesting questions underlying creating a science of digital forensics is what form that science might take. At the end of the IEEE

More information

Data Analysis II. PHY310: Lecture 18. Road Map

Data Analysis II. PHY310: Lecture 18. Road Map 03/22/07 PHY310: Statistical Data Analysis 1 PHY310: Lecture 18 Data Analysis II Road Map Choosing the number of bins in a histogram Correcting Histograms for Systematic Uncertainty Weighting Events 03/22/07

More information

CS 1124Media computation. Oct 6, 2008 Steve Harrison

CS 1124Media computation. Oct 6, 2008 Steve Harrison CS 1124Media computation Oct 6, 2008 Steve Harrison Today Midterm Introduction to working with sound HW 5 - Faster and Faster Today Midterm Introduction to working with sound HW 5 - Faster and Faster Mid

More information

Integration by Parts Logarithms and More Riemann Sums!

Integration by Parts Logarithms and More Riemann Sums! Integration by Parts Logarithms and More Riemann Sums! James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 16, 2013 Outline 1 IbyP with

More information

Transform Coding. Transform Coding Principle

Transform Coding. Transform Coding Principle Transform Coding Principle of block-wise transform coding Properties of orthonormal transforms Discrete cosine transform (DCT) Bit allocation for transform coefficients Entropy coding of transform coefficients

More information

Central Limit Theorem for Averages

Central Limit Theorem for Averages Last Name First Name Class Time Chapter 7-1 Central Limit Theorem for Averages Suppose that we are taking samples of size n items from a large population with mean and standard deviation. Each sample taken

More information

Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture - 12 Marginal Quantity Discount, Multiple Item Inventory Constraint

More information

Linear Neural Networks

Linear Neural Networks Chapter 10 Linear Neural Networks In this chapter, we introduce the concept of the linear neural network. 10.1 Introduction and Notation 1. The linear neural cell, or node has the schematic form as shown

More information

EL2450: Hybrid and Embedded Control Systems: Homework 1

EL2450: Hybrid and Embedded Control Systems: Homework 1 EL2450: Hybrid and Embedded Control Systems: Homework 1 [To be handed in February 11] Introduction The objective of this homework is to understand the basics of digital control including modelling, controller

More information