2D DSP Basics: 2D Systems

Similar documents
ELEG3503 Introduction to Digital Signal Processing

Linear time invariant systems

Fall 2011, EE123 Digital Signal Processing

Finite-length Discrete Transforms. Chapter 5, Sections

EE123 Digital Signal Processing

ADVANCED DIGITAL SIGNAL PROCESSING

Signal Processing in Mechatronics. Lecture 3, Convolution, Fourier Series and Fourier Transform

x[0] x[1] x[2] Figure 2.1 Graphical representation of a discrete-time signal.

Chapter 8. DFT : The Discrete Fourier Transform

Olli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5

DIGITAL SIGNAL PROCESSING LECTURE 3

Practical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement

Frequency Domain Filtering

FIR Filter Design: Part II

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Signals & Systems Chapter3

Computing the output response of LTI Systems.

EECE 301 Signals & Systems

Introduction to Digital Signal Processing

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and

Ch3 Discrete Time Fourier Transform

A. Basics of Discrete Fourier Transform

Frequency Response of FIR Filters

ECE4270 Fundamentals of DSP. Lecture 2 Discrete-Time Signals and Systems & Difference Equations. Overview of Lecture 2. More Discrete-Time Systems

Signal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University.

EEO 401 Digital Signal Processing Prof. Mark Fowler

Chapter 7: The z-transform. Chih-Wei Liu

Discrete-Time Signals and Systems. Signals and Systems. Digital Signals. Discrete-Time Signals. Operations on Sequences: Basic Operations

Exam. Notes: A single A4 sheet of paper (double sided; hand-written or computer typed)

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

EE123 Digital Signal Processing

Signals and Systems. Problem Set: From Continuous-Time to Discrete-Time

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

ELEG 4603/5173L Digital Signal Processing Ch. 1 Discrete-Time Signals and Systems

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2004 Lecture 2 Linear Systems. Topics

Time-Domain Representations of LTI Systems

The Discrete Fourier Transform

EE123 Digital Signal Processing

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science. BACKGROUND EXAM September 30, 2004.

Digital signal processing: Lecture 5. z-transformation - I. Produced by Qiangfu Zhao (Since 1995), All rights reserved

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j

Analog and Digital Signals. Introduction to Digital Signal Processing. Discrete-time Sinusoids. Analog and Digital Signals

FFTs in Graphics and Vision. The Fast Fourier Transform

Optimum LMSE Discrete Transform

Chapter 2 Systems and Signals

Appendix: The Laplace Transform

Digital Signal Processing, Fall 2006

Question1 Multiple choices (circle the most appropriate one):

Solution of EECS 315 Final Examination F09

Chapter 4 : Laplace Transform

Discrete-Time Signals and Systems. Discrete-Time Signals and Systems. Signal Symmetry. Elementary Discrete-Time Signals.

Solutions. Number of Problems: 4. None. Use only the prepared sheets for your solutions. Additional paper is available from the supervisors.

Web Appendix O - Derivations of the Properties of the z Transform

EE422G Homework #13 (12 points)

Discrete-time signals and systems See Oppenheim and Schafer, Second Edition pages 8 93, or First Edition pages 8 79.

COMM 602: Digital Signal Processing

Block-by Block Convolution, FFT/IFFT, Digital Spectral Analysis

Introduction to Signals and Systems, Part V: Lecture Summary

Run-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE

Apply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.

FIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser

Chapter 7 z-transform

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course

Lecture 2 Linear and Time Invariant Systems

Lecture 3: Divide and Conquer: Fast Fourier Transform

Image pyramid example

Wavelet Transform and its relation to multirate filter banks

, then cv V. Differential Equations Elements of Lineaer Algebra Name: Consider the differential equation. and y2 cos( kx)

FIR Filter Design by Windowing

M2.The Z-Transform and its Properties

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science. Fall Problem Set 11 Solutions.

Discrete-Time System Properties. Discrete-Time System Properties. Terminology: Implication. Terminology: Equivalence. Reference: Section 2.

2D DSP Basics: Systems Stability, 2D Sampling

ECEN 644 HOMEWORK #5 SOLUTION SET

Spring 2014, EE123 Digital Signal Processing

6.003 Homework #3 Solutions

ECEN 644 ADVANCED DIGITAL SIGNAL PROCESSING HOMEWORK #3 - SOLUTIONS

Written exam Digital Signal Processing for BMT (8E070). Tuesday November 1, 2011, 09:00 12:00.

FIR Filter Design: Part I

ECE 308 Discrete-Time Signals and Systems

Principle Of Superposition

The z-transform can be used to obtain compact transform-domain representations of signals and systems. It

Generalizing the DTFT. The z Transform. Complex Exponential Excitation. The Transfer Function. Systems Described by Difference Equations

Chapter 9 Computation of the Discrete. Fourier Transform

Exponential Moving Average Pieter P

Mathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1

Advanced Training Course on FPGA Design and VHDL for Hardware Simulation and Synthesis

Solution of Linear Constant-Coefficient Difference Equations

Module 18 Discrete Time Signals and Z-Transforms Objective: Introduction : Description: Discrete Time Signal representation

6.003 Homework #12 Solutions

MAXIMALLY FLAT FIR FILTERS

Lecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.

Inverse Matrix. A meaning that matrix B is an inverse of matrix A.

TMA4205 Numerical Linear Algebra. The Poisson problem in R 2 : diagonalization methods

Digital Signal Processing, Fall 2010

T Signal Processing Systems Exercise material for autumn Solutions start from Page 16.

Chapter 3. z-transform

11. What are energy and power signals? (April/may 2011, Nov/Dec 2012) Energy signal: The energy of a discrete time signal x(n) is defined as

Transcription:

- Digital Image Processig ad Compressio D DSP Basics: D Systems

D Systems T[ ] y = T [ ] Liearity Additivity: If T y = T [ ] The + T y = y + y Homogeeity: If The T y = T [ ] a T y = ay = at [ ] Liearity superpositio priciple holds i a i i T a i y i where y i = T [ i ] i

D Systems Shift ivariace Shift i the iput results i a correspodig shift i the output Ep. If T y The -s -s T y -s -s

D Systems Why LSI Systems? Most frequetly used Easy to desig ad aalyze Need to simplify Mathematical tractable ad rich theory BUT Superpositio ot always useful for images e.g. occlusio

D Systems Impulse respose What is it? δ T h Geeral system Not SI δ -s -s T h ss Shift Ivariat SI system δ -s -s T h -s -s

Liear ad Shift Ivariat LSI Systems Impulse respose h uiquely characterizes system for iput ca compute output usig h sice: = δ = = = y = T = T δ = = [ ] [ ] = h = = = ** h D Covolutio

D Systems h y = h D filter LSI Ep. Let be a oisy image choose impulse respose h of a low-pass filter to remove high frequecy oise; y : ehaced or restored image LSI System is characterized by: impulse respose h i time/space domai frequecy respose Hω ω i frequecy domai where H jω jω ω ω = DTFT{ h } = h e e = =

D Systems Two mai possible implemetatios of LSI systems: Time/space domai implemetatio: D covolutio Use actual iput image values ad impulse respose h to get y h y = h Frequecy trasform domai implemetatio Use DTFT Xω ω of ad DTFT Hω ω of h to get y Xω ω Hω ω Yω ω = Xω ω Hω ω y = DTFT - {Yω ω }

D Systems Uique oe-to-oe relatio mappig betwee time/space domai ad frequecy domai: DTFT h Hω ωω LSI systems fully defied by h or Hω ω

D DTFT D DTFT Two-Dimesioal Discrete- Time Fourier Trasform D DTFT: ω ω X { } = = = = j j e e DTFT X ω ω ω ω Note: D Covolutio Property ω ω ω ω H X h

D DTFT D DTFT periodic with period π i ω ad ω : X ω ω = X ω + π ω = X ω ω + π ω π π π ω π Iverse D DTFT evaluated over oe period: 4 π π j ω + ω = X ω ω e dωdω 4π π π

D Systems Usually filters are implemeted i practice i the time/space domai sice: DTFT is cotiuous i the variables ω ad ω very dese grid required to represet cotiuous domai If is fiite-etet of size N N DTFT Xω ω ca be sampled i ω ad ω resultig i the N N DFT XK K : πk N XK K = Xω ω with ω = ad ω = πk N A sparse fiite grid ca be used whe of fiite size as for images DFT but size of eeded grid depeds o iput image size DTFT ad DFT are importat for trasform domai based methods such as trasform codig ad fast covolutios overlap-add ad overlap-save covolutio methods.

D Covolutio Sum y Notatio: y = h h = = = Eample L h M L M

D Covolutio Sum h- - correspods to a 80 o rotated versio of h reflect flip aroud ais ad the ais or vice-versa h- - h - - is a 80 o rotated ad shifted versio of h Sample of h- - atorigi ow is at

D Covolutio Sum Covolutio: Flip slide to multiply ad sum Repeat for other desired values of y L +M - L +M - h- - h - - : M M h : L L Covolutio Result: y : L + M - L + M -

D Covolutio Sum Summary of D Covolutio steps Graphical Method: Reflect h about both ad aes Traslate so that sample h00 lies at the poit Multiply the sequeces ad h - - poit-by-poit Sum o-zero samples of obtaied product sequece to compute the output sample y Vary ad repeat from Step Direct evaluatio of the D covolutio sum ca be sometimes easier tha usig the graphical method. Covolutio sum is directly used or is used i combiatio with the graphical method whe both or oe of the sigals caot be easily represeted graphically.

D Covolutio Sum Covolutio with a D impulse: δ - - =?

D Covolutio Sum Covolutio with a D Impulse: δ - - = - - D Covolutio Eample: All oes All oes

D Covolutio Sum Properties of D covolutio: h = h commutative h g = h g associative h g y h g y commutative h + g = h + g distributive g h y h g h + g y h + g y

Separable Systems A D LSI system is separable if its impulse respose is a separable sequece h = h h If LSI system is separable we ca implemet it more efficietly y = N N = 0 = 0 h If h is NN we eed N multiplicatios ad N - adds for each computed output sample y for a geeral D LSI system.

Separable Systems Separable Systems If h separable: = = = 0 0 N N h h y N N = = = 0 0 g h h 444 4 3 444 4 D covolutio i directio = = 0 N g h D covolutio i directio The 0 h g N = = = N h g y The =0 h g y

Separable Systems D Covolutio Algorithm:. To get g covolve each colum of with h. To get y covolve each row of the result from Step i.e. of g with h Algorithm ca be summarized as follows: D covolutio o rows the D covolutio o colums or Vice-Versa Note: Sigal does ot eed to be separable oly the system

Separable Systems Eample Cosider lowpass filterig of images Lowpass filter with rectagular support: ω π Hω ω H ω H ω π π ω = π π ω π π π Istead of a D filter we eed to desig oly D filters Hω ω = H ω H ω

Separable systems Eample Cosider lowpass filterig of images No-separable lowpass filter with circular support: ω π Hω ω π π ω π