EEE 512 ADVANCED DIGITAL SIGNAL AND IMAGE PROCESSING

Similar documents
Fatima Michael College of Engineering & Technology

Biomedical Image Analysis. Spatial Filtering

Image processing in frequency Domain

Lecture 5: Frequency Domain Transformations

Section M6: Filter blocks

Filter Bank Design and Sub-Band Coding

Image Reconstruction from Projection

Digital Image Processing. Lecture 6

Image Transformation Techniques Dr. Rajeev Srivastava Dept. of Computer Engineering, ITBHU, Varanasi

Digital Image Processing. Prof. P. K. Biswas. Department of Electronic & Electrical Communication Engineering

Chapter 6: Problem Solutions

ELEC Dr Reji Mathew Electrical Engineering UNSW

EE2S11 Signals and Systems, part 2. Ch.7.3 Analog filter design. Note differences in notation. We often write. transition band passband.

LESSON PLAN. Sub Name: Discrete Time Systems and Signal Processing. Unit: I Branch: BE (EE) Semester: IV

Digital Image Processing. Image Enhancement in the Frequency Domain

Digital Image Processing

SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road UNIT I

Digital Signal Processing Lecture Notes 22 November 2010

Central Slice Theorem

Efficient Nonlinear Image Processing Algorithms

IT Digital Image ProcessingVII Semester - Question Bank

Functions. Edexcel GCE. Core Mathematics C3

JNTUWORLD. 4. Prove that the average value of laplacian of the equation 2 h = ((r2 σ 2 )/σ 4 ))exp( r 2 /2σ 2 ) is zero. [16]

Relationship between Fourier Space and Image Space. Academic Resource Center

UNIVERSITI SAINS MALAYSIA. CCS524 Parallel Computing Architectures, Algorithms & Compilers

Digital Signal Processing with Field Programmable Gate Arrays

CoE4TN3 Medical Image Processing

Available online Journal of Scientific and Engineering Research, 2017, 4(5):1-6. Research Article

Fundamentals of Digital Image Processing

Tutorial 5. Jun Xu, Teaching Asistant March 2, COMP4134 Biometrics Authentication

4. Image Retrieval using Transformed Image Content

3.5 Filtering with the 2D Fourier Transform Basic Low Pass and High Pass Filtering using 2D DFT Other Low Pass Filters

Multimedia Communications. Transform Coding

COMPUTER VISION > OPTICAL FLOW UTRECHT UNIVERSITY RONALD POPPE

CoE4TN4 Image Processing. Chapter 5 Image Restoration and Reconstruction

Evaluating MMX Technology Using DSP and Multimedia Applications

Image Processing. Application area chosen because it has very good parallelism and interesting output.

SIGNALS AND SYSTEMS I Computer Assignment 2

ECE4703 B Term Laboratory Assignment 2 Floating Point Filters Using the TMS320C6713 DSK Project Code and Report Due at 3 pm 9-Nov-2017

Digital Filters in Radiation Detection and Spectroscopy

Digital Image Processing

Experiment 3. Getting Start with Simulink

2D Image Processing INFORMATIK. Kaiserlautern University. DFKI Deutsches Forschungszentrum für Künstliche Intelligenz

3. (a) Prove any four properties of 2D Fourier Transform. (b) Determine the kernel coefficients of 2D Hadamard transforms for N=8.

What will we learn? Neighborhood processing. Convolution and correlation. Neighborhood processing. Chapter 10 Neighborhood Processing

ECG782: Multidimensional Digital Signal Processing

Module 9 : Numerical Relaying II : DSP Perspective

1.12 Optimal Filters (Wiener Filters)

Image Sampling and Quantisation

Image Sampling & Quantisation


Image restoration. Lecture 14. Milan Gavrilovic Centre for Image Analysis Uppsala University

ADVANCED IMAGE PROCESSING METHODS FOR ULTRASONIC NDE RESEARCH C. H. Chen, University of Massachusetts Dartmouth, N.

BME I5000: Biomedical Imaging

Final Review. Image Processing CSE 166 Lecture 18

Aliasing. Can t draw smooth lines on discrete raster device get staircased lines ( jaggies ):

EE 341 Spring 2013 Lab 4: Properties of Discrete-Time Fourier Transform (DTFT)

Non-Blind Deblurring Using Partial Differential Equation Method

The diagram above shows a sketch of the curve C with parametric equations

Digital Image Processing (CS/ECE 545) Lecture 5: Edge Detection (Part 2) & Corner Detection

Computer Graphics. Texture Filtering & Sampling Theory. Hendrik Lensch. Computer Graphics WS07/08 Texturing

MEI STRUCTURED MATHEMATICS METHODS FOR ADVANCED MATHEMATICS, C3. Practice Paper C3-B

ECG782: Multidimensional Digital Signal Processing

Operators to calculate the derivative of digital signals

SYDE 575: Introduction to Image Processing

filter_designer An Interactive Tool for Designing Digital Filters

EECS 452 Midterm Closed book part Fall 2010

Computation of interpolatory splines via triadic subdivision

Lecture Image Enhancement and Spatial Filtering

Filterbanks and transforms

Integration. Edexcel GCE. Core Mathematics C4

Noise Model. Important Noise Probability Density Functions (Cont.) Important Noise Probability Density Functions

Computer Vision and Graphics (ee2031) Digital Image Processing I

Fault Tolerant Parallel Filters Based on ECC Codes

Fitting to a set of data. Lecture on fitting

Computer Vision 2. SS 18 Dr. Benjamin Guthier Professur für Bildverarbeitung. Computer Vision 2 Dr. Benjamin Guthier

Fourier Transform and Texture Filtering

Digital Image Fundamentals II

EECS490: Digital Image Processing. Lecture #16

DCSP-10: Applications

Point and Spatial Processing

Head, Dept of Electronics & Communication National Institute of Technology Karnataka, Surathkal, India

Texture. Outline. Image representations: spatial and frequency Fourier transform Frequency filtering Oriented pyramids Texture representation

Fall 2015 Dr. Michael J. Reale

Perceptual coding. A psychoacoustic model is used to identify those signals that are influenced by both these effects.

Chapter 11 Image Processing

CHAPTER 5 PALMPRINT RECOGNITION WITH ENHANCEMENT

From Fourier Transform to Wavelets

IMPROVED MOTION-BASED LOCALIZED SUPER RESOLUTION TECHNIQUE USING DISCRETE WAVELET TRANSFORM FOR LOW RESOLUTION VIDEO ENHANCEMENT

Audio-coding standards

Implementation of a Low Power Decimation Filter Using 1/3-Band IIR Filter

UNIVERSITY OF OSLO. Faculty of Mathematics and Natural Sciences

Simulation and Analysis of Interpolation Techniques for Image and Video Transcoding

MATHEMATICS (SYLLABUS D) 4024/21 Paper 2 October/November 2016 MARK SCHEME Maximum Mark: 100. Published

To Do. Advanced Computer Graphics. Sampling and Reconstruction. Outline. Sign up for Piazza

Computer Vision. Fourier Transform. 20 January Copyright by NHL Hogeschool and Van de Loosdrecht Machine Vision BV All rights reserved

UNIT 5: DISCRETE FOURIER TRANSFORM

A Image Comparative Study using DCT, Fast Fourier, Wavelet Transforms and Huffman Algorithm

Advanced Design System 1.5. Digital Filter Designer

AVR32765: AVR32 DSPLib Reference Manual. 32-bit Microcontrollers. Application Note. 1 Introduction. 2 Reference

Transcription:

UNIVERSITI SAINS MALAYSIA Semester I Examination Academic Session 27/28 October/November 27 EEE 52 ADVANCED DIGITAL SIGNAL AND IMAGE PROCESSING Time : 3 hours INSTRUCTION TO CANDIDATE: Please ensure that this examination paper contains SEVEN (7) printed pages and SIX (6) questions before answering. Answer FIVE (5) questions. Distribution of marks for each question is given accordingly. All questions must be answered in English. 2/-

- 2 - [EEE 52]. (a) Briefly state the advantages and disadvantages of infinite impulseresponse digital filters (IIR) as compared with finite impulse response (FIR) types. (25 marks) (c) Use the Fourier series approximation (windowing) method with a rectangular window to design a fourth order "low-pass" FIR digital filter whose cut-off frequency is 2 khz and whose phase-response is linear in the pass-band. The sampling frequency is 2 khz. (35 marks) Give the digital filter s system function and its impulse-response. ( marks) (d) Give a signal-flow-graph for the digital filter. ( marks) (e) How would you expect the gain and phase response of this digital filter to be affected by: (i) increasing the order and ( marks) imposing a non-rectangular window? ( marks) 2. (a) Given that the system function of a third order Butterworth type analogue low-pass analogue filter with a 3 db cut-off frequency of one radian/second is: 3/-

- 3 - [EEE 52] use the bilinear transformation to design a third order low-pass digital filter with a 3 db cut-off frequency at one quarter of the sampling frequency. (4 marks) Give a signal-flow-graph for the IIR filter in (a). (c) A band-pass digital IIR filter, based on a prototype Butterworth st. order filter, having a transfer function H(s) = /(s+), is to be designed using the bilinear z-transform. The required parameters are: Pass-band range 8 2 Hz Sampling frequency 8 khz Calculate the pulse transfer function of the required digital filter. [Low-pass to band-pass transformation is: s = (s 2 + w U w L ) / s(w U w L ), where w U and w L are the pass-band edge frequencies in rad/s] (4 marks) 3. (a) Define the following transforms and explain how they are related to each other: (i) (iii) Discrete time Fourier transform (DTFT) Discrete Fourier transform (DFT) Fast Fourier transform (FFT). (3 marks) 4/-

- 4 - [EEE 52] Explain how the DTFT is related to the analogue Fourier transform. (5 marks) (c) If the input signal to a digital filter with frequency response H(ejΩ) = (5 + 2 cos(ω) )e -jω/2 is {x[n]} with x[n] = 3 cos(.5n) for all n, what is the output signal? (d) Give H(z) for a DSP system with the following difference equation: y[n] = x[n] + x[n-2] +.8 y[n-] Determine whether it is causal and stable and sketch its gain-response. (35 marks) 4. (a) Without resorting to detailed mathematical derivation, explain the principles of image restoration based on: (i) Inverse filtering Wiener filtering List the main differences among the above methods. 5/-

- 5 - [EEE 52] During acquisition, an image undergoes uniform linear motion in both vertical x-direction and horizontal y-direction for a duration T. Therefore the blurred image g ( x, y) expressed in unblurred version f (x, y) is given by: g T ( x, y) = f ( x x y y ), Assuming that the time it takes the image to change directions is negligible, and that the shutter opening and closing times are negligibly small, (i) Derive the expression of the blurring function ( u v) dt H,. Assuming that the linear motion occurs in y-direction only, and at a rate given by y = bt, show that the blurring function is given T by the expression H T πbv jπbv ( u, v) = sin( πbv) e (3 marks) Given F + + j2π ( ) ( ) ( ux+ vy u, v f x, y e ) = dxdy j2π (, ) ( ) ( ux + vy x x y y = F u v e ) If ax e e dx = a, ax 2 j sin x = e ; a is complex or real jx e jx 6/-

- 6 - [EEE 52] 5. (a) The unsharp masking is expressed as: where ( x, y) = f ( x, y) f ( x y) f s, f s ( x, y) denotes the sharpened image and f ( x, y) is a blurred or averaged version of an input image ( x y) masks for performing the above operation digitally. f,. Derive TWO possible 3 3 Hence, show that subtracting the Laplacian from an image is approximately equivalent to unsharp masking, i.e. 2 ( x, y) f ( x, y) f ( x y) f s, 6. (a) 3 Determine the Walsh-Hadamard matrix of order 2. Hence show that this matrix is orthogonal. Consider the following image f of size 4 4 f = (i) Perform Walsh-Hadamard transformation of f. 7/-

- 7 - [EEE 52] Reconstruct f using the first two Walsh-Hadamard basis images. (iii) Hence, calculate the sum square error of the reconstruction. ( marks) oooooo