1 Appendix 02 Linear Systems - Time-invariant systems Linear System Linear System f(t) g(t)

Slides:



Advertisements
Similar presentations
Lecture 7: Basis Functions & Fourier Series
Advertisements

EE313 Linear Systems and Signals Fall 2010 Initial conversion of content to PowerPoint by Dr. Wade C. Schwartzkopf Prof. Brian L. Evans Dept. of Electrical.
Chapter 4 Image Enhancement in the Frequency Domain.
Computer Vision Introduction to Image formats, reading and writing images, and image environments Image filtering.
Last week…. Fourier Analysis Re-writing a signal as a sum of sines and cosines.
1 HW 3: Solutions 1. The output of a particular system S is the time derivative of its input. a) Prove that system S is linear time-invariant (LTI). Solution:
EECS 20 Chapter 9 Part 21 Convolution, Impulse Response, Filters In Chapter 5 we Had our first look at LTI systems Considered discrete-time systems, some.
Discrete-Time Convolution Linear Systems and Signals Lecture 8 Spring 2008.
Analogue and digital techniques in closed loop regulation applications Digital systems Sampling of analogue signals Sample-and-hold Parseval’s theorem.
FILTERING GG313 Lecture 27 December 1, A FILTER is a device or function that allows certain material to pass through it while not others. In electronics.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 4 Image Enhancement in the Frequency Domain Chapter.
3.0 Fourier Series Representation of Periodic Signals
Systems: Definition Filter
Digital Signals and Systems
The sampling of continuous-time signals is an important topic It is required by many important technologies such as: Digital Communication Systems ( Wireless.
EE421, Fall 1998 Michigan Technological University Timothy J. Schulz 08-Sept, 98EE421, Lecture 11 Digital Signal Processing (DSP) Systems l Digital processing.
1 Methods in Image Analysis – Lecture 3 Fourier U. Pitt Bioengineering 2630 CMU Robotics Institute Spring Term, 2006 George Stetten, M.D., Ph.D.
1 Signals & Systems Spring 2009 Week 3 Instructor: Mariam Shafqat UET Taxila.
Laplace Transform BIOE 4200.
Linear Shift-Invariant Systems. Linear If x(t) and y(t) are two input signals to a system, the system is linear if H[a*x(t) + b*y(t)] = aH[x(t)] + bH[y(t)]
Outline  Fourier transforms (FT)  Forward and inverse  Discrete (DFT)  Fourier series  Properties of FT:  Symmetry and reciprocity  Scaling in time.
CISE315 SaS, L171/16 Lecture 8: Basis Functions & Fourier Series 3. Basis functions: Concept of basis function. Fourier series representation of time functions.
09/19/2002 (C) University of Wisconsin 2002, CS 559 Last Time Color Quantization Dithering.
Chapter 4 Fourier transform Prepared by Dr. Taha MAhdy.
Technion, CS department, SIPC Spring 2014 Tutorials 12,13 discrete signals and systems 1/39.
Husheng Li, UTK-EECS, Fall  Fourier transform is used to study the frequency spectrum of signals.  Basically, it says that a signal can be represented.
Image Filtering Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem 02/02/10.
Continuous-Time Convolution Impulse Response Impulse response of a system is response of the system to an input that is a unit impulse (i.e., a.
Fourier series: Eigenfunction Approach
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
1 Lecture 1: February 20, 2007 Topic: 1. Discrete-Time Signals and Systems.
Chapter 5: Neighborhood Processing
Signals and Systems Using MATLAB Luis F. Chaparro
3.0 Fourier Series Representation of Periodic Signals 3.1 Exponential/Sinusoidal Signals as Building Blocks for Many Signals.
Lecture 5 Mask/Filter Transformation 1.The concept of mask/filters 2.Mathematical model of filtering Correlation, convolution 3.Smoother filters 4.Filter.
Fourier Analysis of Signals and Systems
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Causality Linearity Time Invariance Temporal Models Response to Periodic.
7- 1 Chapter 7: Fourier Analysis Fourier analysis = Series + Transform ◎ Fourier Series -- A periodic (T) function f(x) can be written as the sum of sines.
EEE 503 Digital Signal Processing Lecture #2 : EEE 503 Digital Signal Processing Lecture #2 : Discrete-Time Signals & Systems Dr. Panuthat Boonpramuk Department.
EE313 Linear Systems and Signals Fall 2010 Initial conversion of content to PowerPoint by Dr. Wade C. Schwartzkopf Prof. Brian L. Evans Dept. of Electrical.
Lecture 7 Transformations in frequency domain 1.Basic steps in frequency domain transformation 2.Fourier transformation theory in 1-D.
1 Methods in Image Analysis – Lecture 3 Fourier CMU Robotics Institute U. Pitt Bioengineering 2630 Spring Term, 2004 George Stetten, M.D., Ph.D.
Technological Educational Institute Of Crete Department Of Applied Informatics and Multimedia Neural Networks Laboratory Slide 1 DISCRETE SIGNALS AND SYSTEMS.
11 Lecture 2 Signals and Systems (II) Principles of Communications Fall 2008 NCTU EE Tzu-Hsien Sang.
Operation in System Hany Ferdinando Dept. of Electrical Engineering Petra Christian University.
Image Enhancement (Frequency Domain)
The Chinese University of Hong Kong
Min-Plus Linear Systems Theory Min-Plus Linear Systems Theory.
1 LTI Systems; Convolution September 4, 2000 EE 64, Section 1 ©Michael R. Gustafson II Pratt School of Engineering.
Ch # 11 Fourier Series, Integrals, and Transform 1.
Eeng360 1 Chapter 2 Linear Systems Topics:  Review of Linear Systems Linear Time-Invariant Systems Impulse Response Transfer Functions Distortionless.
Description and Analysis of Systems Chapter 3. 03/06/06M. J. Roberts - All Rights Reserved2 Systems Systems have inputs and outputs Systems accept excitation.
Signal and systems LTI Systems. Linear Time-Invariant Systems.
ENEE 322: Continuous-Time Fourier Transform (Chapter 4)
1 Computing the output response of LTI Systems. By breaking or decomposing and representing the input signal to the LTI system into terms of a linear combination.
Chapter 2. Characteristics of Signal ※ Signal : transmission of information The quality of the information depends on proper selection of a measurement.
Computer Vision – 2D Signal & System Hanyang University Jong-Il Park.
Fresnel diffraction formulae
Linear systems: University of Illinois at Chicago ECE 427, Dr. D. Erricolo University of Illinois at Chicago ECE 427, Dr. D. Erricolo Consider two complex.
Review of DSP.
Jean Baptiste Joseph Fourier
The Chinese University of Hong Kong
Chapter 2. Fourier Representation of Signals and Systems
Advanced Digital Signal Processing
Fourier Series September 18, 2000 EE 64, Section 1 ©Michael R. Gustafson II Pratt School of Engineering.
Example I: F.T. Integration Property
Uses of filters To remove unwanted components in a signal
Chapter 3 Sampling.
Even Discrete Cosine Transform The Chinese University of Hong Kong
Presentation transcript:

1 Appendix 02 Linear Systems - Time-invariant systems Linear System Linear System f(t) g(t)

2 Linear System A linear system is a system that has the following two properties: Homogeneity: Scaling: The two properties together are referred to as superposition.

3 A time-invariant system is a system that has the property that the the shape of the response (output) of this system does not depend on the time at which the input was applied. If the input f is delayed by some interval T, the output g will be delayed by the same amount. Time-invariant System

4 Linear time-invariant systems have a very interesting (and useful) response when the input is a harmonic. If the input to a linear time-invariant system is a harmonic of a certain frequency , then the output is also a harmonic of the same frequency that has been scaled and delayed: Harmonic Input Function

5 The response of a shift-invariant linear system to a harmonic input is simply that input multiplied by a frequency-dependent complex number (the transferfunction H(  )). A harmonic input always produces a harmonic output at the same frequency in a shift-invariant linear system. Transfer Function H(  )

6 Transfer Function Convolution h(t) f(t) g(t) H(  ) F()F() F()F() G()G() G()G()

7 ConvolutionConvolution h(t) f(t) g(t)

8 Impulse Response [1/4]

9 Impulse Response [2/4] h(t) f(t) g(t) H(  ) F(  ) G(  )

10 Impulse Response [3/4] Convolution t g(t)

11 Impulse Response [4/4] Convolution =*

12 Convolution Rules

13 Some Useful Functions A a/2 B b

14 The Impulse Function [1/2] The impulse is the identity function under convolution

15 The Impulse Function [2/2]

16 Step Function [1/3] b b

17 Step Function [2/3] b b

18 Step Function [3/3] b

19 Smoothing a function by convolution b

20 b Edge enhancement by convolution

21 Discrete 1-Dim Convolution [1/5] Matrix

22 Discrete 1-Dim Convolution [2/5] Example

23 Discrete 1-Dim Convolution [3/5] Discrete operation

24 Discrete 1-Dim Convolution [4/5] Graph - Continuous / Discrete

25 Discrete 1-Dim Convolution [5/5] Wrapping h index array

26 Two-Dimensional Convolution

27 Discrete Two-Dimensional Convolution [1/3]

28 Discrete Two-Dimensional Convolution [2/3]

29 Discrete Two-Dimensional Convolution [3/3]   x C SummerScaling factor Kernel matrix Input image Output image Array of products Output pixel

30 Linear System - Fourier Transform h(t) H(  ) h(t) H(  ) f(t) g(t) F(  ) G(  ) Input function Spectrum of input function Output function Spectrum of output function Impulse respons Transfer function

31 End