EE 637 Final April 30, Spring Each problem is worth 20 points for a total score of 100 points

Similar documents
Good Luck. EE 637 Final May 4, Spring Name: Instructions: This is a 120 minute exam containing five problems.

EE 438 Essential Definitions and Relations

ECE 301. Division 3, Fall 2007 Instructor: Mimi Boutin Midterm Examination 3

ECE 301. Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3

NAME: ht () 1 2π. Hj0 ( ) dω Find the value of BW for the system having the following impulse response.

ECE 301 Division 1, Fall 2006 Instructor: Mimi Boutin Final Examination

Topics: Discrete transforms; 1 and 2D Filters, sampling, and scanning

Final Exam of ECE301, Prof. Wang s section 8 10am Tuesday, May 6, 2014, EE 129.

ECE 301 Division 1, Fall 2008 Instructor: Mimi Boutin Final Examination Instructions:

Each problem is worth 25 points, and you may solve the problems in any order.

Final Exam of ECE301, Section 3 (CRN ) 8 10am, Wednesday, December 13, 2017, Hiler Thtr.

Digital Signal Processing. Midterm 1 Solution

Signals and Systems Spring 2004 Lecture #9

ELEN 4810 Midterm Exam

EE538 Final Exam Fall :20 pm -5:20 pm PHYS 223 Dec. 17, Cover Sheet

Final Exam of ECE301, Section 1 (Prof. Chih-Chun Wang) 1 3pm, Friday, December 13, 2016, EE 129.

Lecture 8 ELE 301: Signals and Systems

ECE 301 Division 1 Final Exam Solutions, 12/12/2011, 3:20-5:20pm in PHYS 114.

This examination consists of 10 pages. Please check that you have a complete copy. Time: 2.5 hrs INSTRUCTIONS

NAME: 11 December 2013 Digital Signal Processing I Final Exam Fall Cover Sheet

EE 224 Signals and Systems I Review 1/10

Signals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, Cover Sheet

Test 2 Electrical Engineering Bachelor Module 8 Signal Processing and Communications

EE538 Final Exam Fall 2007 Mon, Dec 10, 8-10 am RHPH 127 Dec. 10, Cover Sheet

New Mexico State University Klipsch School of Electrical Engineering. EE312 - Signals and Systems I Spring 2018 Exam #1

Lecture 7 ELE 301: Signals and Systems

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM. COURSE: ECE 3084A (Prof. Michaels)

ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization

ECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n.

Final Exam 14 May LAST Name FIRST Name Lab Time

Professor Fearing EECS120/Problem Set 2 v 1.01 Fall 2016 Due at 4 pm, Fri. Sep. 9 in HW box under stairs (1st floor Cory) Reading: O&W Ch 1, Ch2.

Final Exam ECE301 Signals and Systems Friday, May 3, Cover Sheet

EE 16B Final, December 13, Name: SID #:

Final Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105.

2.1 Basic Concepts Basic operations on signals Classication of signals

FINAL EXAM: 3:30-5:30pm

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM. COURSE: ECE 3084A (Prof. Michaels)

Problem Score Total

The Johns Hopkins University Department of Electrical and Computer Engineering Introduction to Linear Systems Fall 2002.

Lecture 3 January 23

Chap 4. Sampling of Continuous-Time Signals

Homework 9 Solutions

ECE 308 SIGNALS AND SYSTEMS SPRING 2013 Examination #2 14 March 2013

EE303: Communication Systems

Your solutions for time-domain waveforms should all be expressed as real-valued functions.

ECE 301 Fall 2011 Division 1 Homework 10 Solutions. { 1, for 0.5 t 0.5 x(t) = 0, for 0.5 < t 1

Final Exam January 31, Solutions

Grades will be determined by the correctness of your answers (explanations are not required).

Solution 7 August 2015 ECE301 Signals and Systems: Final Exam. Cover Sheet

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL and COMPUTER ENGINEERING

Review of Discrete-Time System

EEL3135: Homework #3 Solutions

New Mexico State University Klipsch School of Electrical Engineering. EE312 - Signals and Systems I Fall 2017 Exam #1

Discrete Time Fourier Transform

Q1 Q2 Q3 Q4 Q5 Total

Table 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients

Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is

Fourier transform representation of CT aperiodic signals Section 4.1

Solutions. Number of Problems: 10

Fourier series for continuous and discrete time signals

M408 C Fall 2011 Dr. Jeffrey Danciger Exam 2 November 3, Section time (circle one): 11:00am 1:00pm 2:00pm

Introduction to Fourier Transforms. Lecture 7 ELE 301: Signals and Systems. Fourier Series. Rect Example

EECS 20N: Structure and Interpretation of Signals and Systems Final Exam Department of Electrical Engineering and Computer Sciences 13 December 2005

EE 3054: Signals, Systems, and Transforms Summer It is observed of some continuous-time LTI system that the input signal.

STUDENT NAME: STUDENT SIGNATURE: STUDENT ID NUMBER: SECTION NUMBER RECITATION INSTRUCTOR:

Table 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients

ECE 301 Division 1 Exam 1 Solutions, 10/6/2011, 8-9:45pm in ME 1061.

Question Paper Code : AEC11T02

ECE 3084 QUIZ 2 SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING GEORGIA INSTITUTE OF TECHNOLOGY APRIL 2, Name:

NAME: 23 February 2017 EE301 Signals and Systems Exam 1 Cover Sheet

Atmospheric Flight Dynamics Example Exam 1 Solutions

Grades will be determined by the correctness of your answers (explanations are not required).

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 20, Cover Sheet

Problem Value

EE401: Advanced Communication Theory

Module 4. Related web links and videos. 1. FT and ZT

Chap 2. Discrete-Time Signals and Systems

x(t) = t[u(t 1) u(t 2)] + 1[u(t 2) u(t 3)]

Sinc Functions. Continuous-Time Rectangular Pulse

Lecture 8: Signal Reconstruction, DT vs CT Processing. 8.1 Reconstruction of a Band-limited Signal from its Samples

Homework 6 Solutions

Q1 Q2 Q3 Q4 Tot Letr Xtra

Math 241 Final Exam, Spring 2013

Lecture 4: FT Pairs, Random Signals and z-transform

This examination consists of 11 pages. Please check that you have a complete copy. Time: 2.5 hrs INSTRUCTIONS

University Question Paper Solution

Stochastic Processes. M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno

6.003: Signals and Systems. Relations among Fourier Representations

NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY DEPARTMENT OF ELECTRONICS AND TELECOMMUNICATIONS

ECE 636: Systems identification

EECE 2510 Circuits and Signals, Biomedical Applications Final Exam Section 3. Name:

6.003: Signals and Systems. Sampling and Quantization

conditional cdf, conditional pdf, total probability theorem?

Fourier Methods in Digital Signal Processing Final Exam ME 579, Spring 2015 NAME

EEE4001F EXAM DIGITAL SIGNAL PROCESSING. University of Cape Town Department of Electrical Engineering PART A. June hours.

ECE-314 Fall 2012 Review Questions for Midterm Examination II

6.003 Homework #10 Solutions

Chapter 6: Applications of Fourier Representation Houshou Chen

EE 4372 Tomography. Carlos E. Davila, Dept. of Electrical Engineering Southern Methodist University

Transcription:

EE 637 Final April 30, Spring 2018 Name: Instructions: This is a 120 minute exam containing five problems. Each problem is worth 20 points for a total score of 100 points You may only use your brain and a pencil (or pen) to complete this exam. You may not use your book, notes, or a calculator, or any other electronic or physical device for communicating or accessing stored information. Good Luck. 1

Function definitions { rect(t) = 1 for t < 1/2 0 otherwise CTFT Λ(t) = X(f) = x(t) = CTFT Properties { 1 t for t < 1 0 otherwise sinc(t) = sin(πt) πt x( t) CT x(t)e j2πft dt X(f)e j2πft df X( f) Fact Sheet DTFT X(e jω ) = DTFT pairs x(n) = 1 2π a n u(n) DT n= π Rep and Comb relations rep T [x(t)] = π x(n)e jωn X(e jω )e jωn dω 1 1 ae jω k= comb T [x(t)] = x(t) x(t kt ) k= δ(t kt ) CTFT pairs x(t t 0 ) CT X(f)e j2πft0 x(at) CT 1 a X(f/a) X(t) CT x( f) x(t)e j2πf0t CT X(f f 0 ) x(t)y(t) CT X(f) Y (f) x(t) y(t) CT X(f)Y (f) x(t)y (t)dt = 1 2π X(f)Y (f)df comb T [x(t)] rep T [x(t)] Sampling and Reconstruction y(n) = x(nt ) Y (e jω ) = 1 T s(t) = CT 1 T rep 1 T [X(f)] CT 1 T comb 1 T [X(f)] k= k= S(f) = Y ( e j2πft ) ( ) ω 2πk X 2πT y(k)δ(t kt ) For a > 0 sinc(t) CT rect(t) CT rect(f) sinc(f) 1 (n 1)! tn 1 e at u(t) CT 1 (j2πf + a) n CSFT F (u, v) = f(x, y) = f(x, y)e j2π(ux+vy) dxdy F (u, v)e j2π(ux+vy) dudv 2

Problem 1.(20pt) Consider an X-ray imaging system shown in the figure below. λx Y X Ray Source Material with density u(x) Pin Hole Columnator 0 Photons are emitted from an X-ray source and collimated by a pin hole in a lead shield. The collimated X-rays then pass in a straight line through an object of length T with density u(x) where x is the depth into the object measured in units of cm, and µ(x) is measured in units of cm 1. The expected number of photons at a depth x is given by λ x = E [Y x ] where Y x represents the number of photons that make it to depth x. T x a) Write a differential equation which describes the behavior of λ x as a function of x. (Hint: your differential equation should have the form dλx dx = something.) b) Solve the differential equation to form an expression for λ x in terms of u(x) and λ 0. c) Calculate an expression for the integral of the density, T 0 u(x)dx, in terms of λ 0 and λ T. d) In practice, how do you measure λ 0 and λ T in a real CT system? 3

4

5

Problem 2.(20pt) Consider a deterministic gray level image, g(m, n), which takes values on the interval [0, 1], and let T (m, n) be a random white noise threshold array of i.i.d. uniformly distributed random variables on the interval [0, 1]. Then the associated halftoned output image is given by 1 if g(m, n) T (m, n) b(m, n) = 0 otherwise Also, define the display error as d(m, n) = b(m, n) g(m, n).. a) Calculate simple expressions for the three quantities P {b(m, n) = 0}, P {b(m, n) = 1}, and E [b(m, n)]. b) Calculate a simple expressions for the variance of b(m, n). c) Calculate the mean and variance of d(m, n). For parts d) through f), assume that g(m, n) = g, i.e., is a constant gray level g. d) Calculate the autocovariance of d(m, n) denoted by R(k, l) = E [d(m, n)d(m + k, n + l)]. e) Calculate the power spectrum of d(m, n) denoted by S(e jµ, e jν ). f) Will b(m, n) be a good quality halftone for the gray level g? Justify your answer. 6

7

8

Problem 3.(20pt) Consider a 2D Gaussian random vector, X, with distribution N(0, R), and covariance R = EΛE t where Λ = diag{16, 1}, and [ ] cos θ sin θ E =. sin θ cos θ a) Determine an orthonormal transformation T, so that Y = T X, where Y = [Y 1, Y 2 ] t are independent Gaussian random variables. b) Determine a transformation H, so that Z = HX, where Z = [Z 1, Z 2 ] t are independent Gaussian random variables with mean 0 and variance 1. c) For θ = π/3, sketch a contour plot of the 2D distribution of X with X 1 as the horizontal axis and X 2 as the vertical axis and label critical dimensions of the sketch. d) For θ = π/3, sketch a contour plot of the 2D distribution of Y with Y 1 as the horizontal axis and Y 2 as the vertical axis and label critical dimensions of the sketch. e) For θ = π/3, sketch a contour plot of the 2D distribution of Z with Z 1 as the horizontal axis and Z 2 as the vertical axis and label critical dimensions of the sketch. f) Why are these transformations useful? 9

10

11

Problem 4.(20pt) Consider an linear space invariant imaging system which can be modeled by y = Ax + w, where x and y are the input and output images of the imaging system represented in raster order as a column vectors of length N, and w is a column vector of i.i.d. N(0, σ 2 ) additive white noise. Furthermore, we will model x as a Gaussian random process with distribution N(µ x, R x ). a) Is any real input image a Gaussian random process? Justify your answer. b) Are images accurately modeled by Gaussian random processes? Justify your answer. For the following c) through g), assume that the image x is a Gaussian random process. c) Calculate the mean and covariance of y denoted by µ y and R y. d) Give an expression for the probability density of y. e) Let E[x y] = f(y). Is f(y) random or deterministic? What form must the function f(y) have? f) What does the answer to part e) above tell you about the form of the minimum mean squared error (MMSE) estimator of the image x given y? g) In general, are linear filters good choices for removing noise from images? Justify your answer. 12

13

14

Problem 5.(20pt) Consider a Gaussian random variable X N(0, σ) with mean zero and variance σ 2. Then the rate R(δ) and the distortion D(δ) are functions of the parameter δ that represents the squared quantization step size. The functions are given by { ( ) } 1 σ 2 R(δ) = max 2 log, 0 (1) δ { } D(δ) = min σ 2, δ (2) Furthermore, let Z = [X 1,, X N ] be a row vector of independent Gaussian random variables with X n N(0, σ 2 n) where σ 2 n 1 σ2 n. a) Sketch the distortion-rate function for X. (Put distortion on the vertical axis and the rate on the horizontal axis.) b) Explain the meaning of the distortion-rate function. c) Calculate the mean and covariance of Z. d) Write an expression for the rate and distortion of Z. e) How can one calculate the distortion-rate function for a Gaussian vector Y with mean zero and covariance R = EΛE t where EE t = I and Λ is diagonal? 15

16

17