Linear Systems Review Objective

Slides:



Advertisements
Similar presentations
ECON 397 Macroeconometrics Cunningham
Advertisements

Engineering Mathematics Class #15 Fourier Series, Integrals, and Transforms (Part 3) Sheng-Fang Huang.
EE-2027 SaS 06-07, L11 1/12 Lecture 11: Fourier Transform Properties and Examples 3. Basis functions (3 lectures): Concept of basis function. Fourier series.
Ch 5.2: Series Solutions Near an Ordinary Point, Part I
MULTIPLE INTEGRALS MULTIPLE INTEGRALS Recall that it is usually difficult to evaluate single integrals directly from the definition of an integral.
7. Neighbourhood operations A single pixel considered in isolation conveys information on the intensity and colour at a single location in an image, but.
Ch. 4: Velocity Kinematics
Digital Image Processing, 2nd ed. www. imageprocessingbook.com © 2001 R. C. Gonzalez & R. E. Woods 1 Objective To provide background material in support.
MULTIPLE INTEGRALS MULTIPLE INTEGRALS 16.9 Change of Variables in Multiple Integrals In this section, we will learn about: The change of variables.
Lecture 9: Fourier Transform Properties and Examples
DEPARTMENT OF MATHEMATI CS [ YEAR OF ESTABLISHMENT – 1997 ] DEPARTMENT OF MATHEMATICS, CVRCE.
9.6 Other Heat Conduction Problems
The sampling of continuous-time signals is an important topic It is required by many important technologies such as: Digital Communication Systems ( Wireless.
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
Random Process The concept of random variable was defined previously as mapping from the Sample Space S to the real line as shown below.
ME 2304: 3D Geometry & Vector Calculus Dr. Faraz Junejo Double Integrals.
Copyright © Cengage Learning. All rights reserved.
Digital Image Processing, 3rd ed. © 1992–2008 R. C. Gonzalez & R. E. Woods Gonzalez & Woods Matrices and Vectors Objective.
1 7. Two Random Variables In many experiments, the observations are expressible not as a single quantity, but as a family of quantities. For example to.
INTEGRALS Areas and Distances INTEGRALS In this section, we will learn that: We get the same special type of limit in trying to find the area under.
1 Week 5 Linear operators and the Sturm–Liouville theory 1.Complex differential operators 2.Properties of self-adjoint operators 3.Sturm-Liouville theory.
INTEGRALS 5. INTEGRALS In Chapter 2, we used the tangent and velocity problems to introduce the derivative—the central idea in differential calculus.
Integrals  In Chapter 2, we used the tangent and velocity problems to introduce the derivative—the central idea in differential calculus.  In much the.
lecture 4, Convolution and Fourier Convolution Convolution Fourier Convolution Outline  Review linear imaging model  Instrument response function.
Chapter 2 One Dimensional Continuous Time System.
BYST CPE200 - W2003: LTI System 79 CPE200 Signals and Systems Chapter 2: Linear Time-Invariant Systems.
SECTION 12.8 CHANGE OF VARIABLES IN MULTIPLE INTEGRALS.
Lecture 7 Transformations in frequency domain 1.Basic steps in frequency domain transformation 2.Fourier transformation theory in 1-D.
( II ) This property is known as “convolution” ( الإلتواء التفاف ) From Chapter 2, we have Proof is shown next Chapter 3.
DOUBLE INTEGRALS OVER RECTANGLES
In Chapters 6 and 8, we will see how to use the integral to solve problems concerning:  Volumes  Lengths of curves  Population predictions  Cardiac.
Signals and Systems Analysis NET 351 Instructor: Dr. Amer El-Khairy د. عامر الخيري.
Topics 1 Specific topics to be covered are: Discrete-time signals Z-transforms Sampling and reconstruction Aliasing and anti-aliasing filters Sampled-data.
Digital Image Processing, 2nd ed. www. imageprocessingbook.com © 2001 R. C. Gonzalez & R. E. Woods 1 Review: Linear Systems Some Definitions With reference.
Signals and Systems Lecture #6 EE3010_Lecture6Al-Dhaifallah_Term3321.
Description and Analysis of Systems Chapter 3. 03/06/06M. J. Roberts - All Rights Reserved2 Systems Systems have inputs and outputs Systems accept excitation.
Chapter 2. Signals and Linear Systems
1 Objective To provide background material in support of topics in Digital Image Processing that are based on matrices and/or vectors. Review Matrices.
 What is a function?  What are the differences between a function and a relationship?  Describe the following types of functions verbally, algebraically.
EE 4780: Introduction to Computer Vision Linear Systems.
Math for CS Fourier Transforms
Chapter 2 The z-transform and Fourier Transforms The Z Transform The Inverse of Z Transform The Prosperity of Z Transform System Function System Function.
Announcements Topics: -sections 7.3 (definite integrals), 7.4 (FTC), and 7.5 (additional techniques of integration) * Read these sections and study solved.
Review of DSP.
Time Domain Representations of Linear Time-Invariant Systems
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Review of DSP.
Boyce/DiPrima 9th ed, Ch 10.8 Appendix A: Derivation of the Heat Conduction Equation Elementary Differential Equations and Boundary Value Problems, 9th.
Lecture 22 Definite Integrals.
Matrices and Vectors Review Objective
Description and Analysis of Systems
Mathematical Descriptions of Systems
Random Process The concept of random variable was defined previously as mapping from the Sample Space S to the real line as shown below.
CT-321 Digital Signal Processing
The sampling of continuous-time signals is an important topic
Review: Linear Systems
Ch 5.2: Series Solutions Near an Ordinary Point, Part I
Signal and Systems Chapter 2: LTI Systems
7. Two Random Variables In many experiments, the observations are expressible not as a single quantity, but as a family of quantities. For example to record.
§1-3 Solution of a Dynamical Equation
Fundamentals of Electric Circuits Chapter 15
Objective To provide background material in support of topics in Digital Image Processing that are based on matrices and/or vectors.
Signals & Systems (CNET - 221) Chapter-3 Linear Time Invariant System
Signals and Systems Lecture 2
Signals and Systems Revision Lecture 1
Concept of frequency in Discrete Signals & Introduction to LTI Systems
Review of DSP.
پردازش تصاویر دیجیتالی
1st semester a.y. 2018/2019 – November 22, 2018
Presentation transcript:

Linear Systems Review Objective To provide background material in support of topics in Digital Image Processing that are based on linear system theory.

Review: Linear Systems Some Definitions With reference to the following figure, we define a system as a unit that converts an input function f(x) into an output (or response) function g(x), where x is an independent variable, such as time or, as in the case of images, spatial position. We assume for simplicity that x is a continuous variable, but the results that will be derived are equally applicable to discrete variables.

Some Definitions (Con’t) Review: Linear Systems Some Definitions (Con’t) It is required that the system output be determined completely by the input, the system properties, and a set of initial conditions. From the figure in the previous page, we write where H is the system operator, defined as a mapping or assignment of a member of the set of possible outputs {g(x)} to each member of the set of possible inputs {f(x)}. In other words, the system operator completely characterizes the system response for a given set of inputs {f(x)}.

Some Definitions (Con’t) Review: Linear Systems Some Definitions (Con’t) An operator H is called a linear operator for a class of inputs {f(x)} if for all fi(x) and fj(x) belonging to {f(x)}, where the a's are arbitrary constants and is the output for an arbitrary input fi(x) {f(x)}.

Some Definitions (Con’t) Review: Linear Systems Some Definitions (Con’t) The system described by a linear operator is called a linear system (with respect to the same class of inputs as the operator). The property that performing a linear process on the sum of inputs is the same that performing the operations individually and then summing the results is called the property of additivity. The property that the response of a linear system to a constant times an input is the same as the response to the original input multiplied by a constant is called the property of homogeneity.

Some Definitions (Con’t) Review: Linear Systems Some Definitions (Con’t) An operator H is called time invariant (if x represents time), spatially invariant (if x is a spatial variable), or simply fixed parameter, for some class of inputs {f(x)} if for all fi(x) {f(x)} and for all x0. A system described by a fixed-parameter operator is said to be a fixed-parameter system. Basically all this means is that offsetting the independent variable of the input by x0 causes the same offset in the independent variable of the output. Hence, the input-output relationship remains the same.

Some Definitions (Con’t) Review: Linear Systems Some Definitions (Con’t) An operator H is said to be causal, and hence the system described by H is a causal system, if there is no output before there is an input. In other words, Finally, a linear system H is said to be stable if its response to any bounded input is bounded. That is, if where K and c are constants.

Some Definitions (Con’t) Review: Linear Systems Some Definitions (Con’t) Example: Suppose that operator H is the integral operator between the limits  and x. Then, the output in terms of the input is given by where w is a dummy variable of integration. This system is linear because

Some Definitions (Con’t) Review: Linear Systems Some Definitions (Con’t) We see also that the system is fixed parameter because where d(w + x0) = dw because x0 is a constant. Following similar manipulation it is easy to show that this system also is causal and stable.

Some Definitions (Con’t) Review: Linear Systems Some Definitions (Con’t) Example: Consider now the system operator whose output is the inverse of the input so that In this case, so this system is not linear. The system, however, is fixed parameter and causal.

Linear System Characterization-Convolution Review: Linear Systems Linear System Characterization-Convolution A unit impulse function, denoted (x  a), is defined by the expression From the previous sections, the output of a system is given by g(x) = H[f(x)]. But, we can express f(x) in terms of the impulse function just defined, so

System Characterization (Con’t) Review: Linear Systems System Characterization (Con’t) Extending the property of addivity to integrals (recall that an integral can be approximated by limiting summations) allows us to write Because f() is independent of x, and using the homogeneity property, it follows that

System Characterization (Con’t) Review: Linear Systems System Characterization (Con’t) The term is called the impulse response of H. In other words, h(x, ) is the response of the linear system to a unit impulse located at coordinate x (the origin of the impulse is the value of  that produces (0); in this case, this happens when  = x).

System Characterization (Con’t) Review: Linear Systems System Characterization (Con’t) The expression is called the superposition (or Fredholm) integral of the first kind. This expression is a fundamental result that is at the core of linear system theory. It states that, if the response of H to a unit impulse [i.e., h(x, )], is known, then response to any input f can be computed using the preceding integral. In other words, the response of a linear system is characterized completely by its impulse response.

System Characterization (Con’t) Review: Linear Systems System Characterization (Con’t) If H is a fixed-parameter operator, then and the superposition integral becomes This expression is called the convolution integral. It states that the response of a linear, fixed-parameter system is completely characterized by the convolution of the input with the system impulse response. As will be seen shortly, this is a powerful and most practical result.

System Characterization (Con’t) Review: Linear Systems System Characterization (Con’t) Because the variable  in the preceding equation is integrated out, it is customary to write the convolution of f and h (both of which are functions of x) as In other words,

System Characterization (Con’t) Review: Linear Systems System Characterization (Con’t) The Fourier transform of the preceding expression is The term inside the inner brackets is the Fourier transform of the term h(x   ). But,

System Characterization (Con’t) Review: Linear Systems System Characterization (Con’t) so, We have succeeded in proving the important result that the Fourier transform of the convolution of two functions is the product of their Fourier transforms. As noted below, this result is the foundation for linear filtering

System Characterization (Con’t) Review: Linear Systems System Characterization (Con’t) Following a similar development, it is not difficult to show that the inverse Fourier transform of the convolution of H(u) and F(u) [i.e., H(u)*F(u)] is the product f(x)g(x). This result is known as the convolution theorem, typically written as and where "  " is used to indicate that the quantity on the right is obtained by taking the Fourier transform of the quantity on the left, and, conversely, the quantity on the left is obtained by taking the inverse Fourier transform of the quantity on the right.

System Characterization (Con’t) Review: Linear Systems System Characterization (Con’t) The mechanics of convolution are explained in detail in the book. We have just filled in the details of the proof of validity in the preceding paragraphs. Because the output of our linear, fixed-parameter system is if we take the Fourier transform of both sides of this expression, it follows from the convolution theorem that

System Characterization (Con’t) Review: Linear Systems System Characterization (Con’t) The key importance of the result G(u)=H(u)F(u) is that, instead of performing a convolution to obtain the output of the system, we computer the Fourier transform of the impulse response and the input, multiply them and then take the inverse Fourier transform of the product to obtain g(x); that is, These results are the basis for all the filtering work done in Chapter 4, and some of the work in Chapter 5 of Digital Image Processing. Those chapters extend the results to two dimensions, and illustrate their application in considerable detail.