Math Review CS474/674 – Prof. Bebis.

Slides:



Advertisements
Similar presentations
10.4 Complex Vector Spaces.
Advertisements

Quantum One: Lecture 9. Graham Schmidt Orthogonalization.
Fourier Transform (Chapter 4)
Fourier Transform – Chapter 13. Image space Cameras (regardless of wave lengths) create images in the spatial domain Pixels represent features (intensity,
Chapter Four Image Enhancement in the Frequency Domain.
Math Review with Matlab:
Quantum One: Lecture 16.
Signal , Weight Vector Spaces and Linear Transformations
Signal , Weight Vector Spaces and Linear Transformations
Autumn Analog and Digital Communications Autumn
Linear Algebra, Principal Component Analysis and their Chemometrics Applications.
University of Texas at Austin CS395T - Advanced Image Synthesis Spring 2006 Don Fussell Fourier Transforms.
Matrices CS485/685 Computer Vision Dr. George Bebis.
राघव वर्मा Inner Product Spaces Physical properties of vectors  aka length and angles in case of arrows Lets use the dot product Length of Cosine of the.
Linear Algebra Review 1 CS479/679 Pattern Recognition Dr. George Bebis.
1 February 24 Matrices 3.2 Matrices; Row reduction Standard form of a set of linear equations: Chapter 3 Linear Algebra Matrix of coefficients: Augmented.
Motivation Music as a combination of sounds at different frequencies
Chapter 5: The Orthogonality and Least Squares
Chemistry 330 The Mathematics Behind Quantum Mechanics.
Fourier Series Summary (From Salivahanan et al, 2002)
Vectors CHAPTER 7. Ch7_2 Contents  7.1 Vectors in 2-Space 7.1 Vectors in 2-Space  7.2 Vectors in 3-Space 7.2 Vectors in 3-Space  7.3 Dot Product 7.3.
Fourier series: Eigenfunction Approach
Chapter 10 Real Inner Products and Least-Square
Chap. 5 Inner Product Spaces 5.1 Length and Dot Product in R n 5.2 Inner Product Spaces 5.3 Orthonormal Bases: Gram-Schmidt Process 5.4 Mathematical Models.
ME 440 Intermediate Vibrations Tu, January 27, 2009 Sections 1.10 & 1.11 © Dan Negrut, 2009 ME440, UW-Madison.
5.0 Discrete-time Fourier Transform 5.1 Discrete-time Fourier Transform Representation for discrete-time signals Chapters 3, 4, 5 Chap 3 Periodic Fourier.
Math Review Towards Fourier Transform
Chapter 4 Euclidean n-Space Linear Transformations from to Properties of Linear Transformations to Linear Transformations and Polynomials.
Fourier Transform.
Signal & Weight Vector Spaces
Instructor: Mircea Nicolescu Lecture 8 CS 485 / 685 Computer Vision.
ENEE 322: Continuous-Time Fourier Transform (Chapter 4)
Boot Camp in Linear Algebra TIM 209 Prof. Ram Akella.
The Fourier Transform.
Class 3 Linear System Solution Using the Laplace Transform
Beyond Vectors Hung-yi Lee. Introduction Many things can be considered as “vectors”. E.g. a function can be regarded as a vector We can apply the concept.
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
Convergence of Fourier series It is known that a periodic signal x(t) has a Fourier series representation if it satisfies the following Dirichlet conditions:
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
EE611 Deterministic Systems Vector Spaces and Basis Changes Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
References Jain (a text book?; IP per se; available)
CA 302 Computer Graphics and Visual Programming
CS479/679 Pattern Recognition Dr. George Bebis
Chapter 1 Linear Equations and Vectors
Lecture 4: Imaging Theory (2/6) – One-dimensional Fourier transforms
Systems of First Order Linear Equations
Lecture 03: Linear Algebra
Quantum One.
Sinusoids: continuous time
Vectors, Linear Combinations and Linear Independence
Quantum One.
CS485/685 Computer Vision Dr. George Bebis
Quantum One.
3D Transformation CS380: Computer Graphics Sung-Eui Yoon (윤성의)
Quantum One.
1.3 Vector Equations.
Signal & Weight Vector Spaces
Chapter 3 Linear Algebra
CSE 411 Computer Graphics Lecture #2 Mathematical Foundations
Signal & Weight Vector Spaces
I.4 Polyhedral Theory (NW)
Properties of Solution Sets
Elementary Linear Algebra Anton & Rorres, 9th Edition
Vector Spaces 1 Vectors in Rn 2 Vector Spaces
I.4 Polyhedral Theory.
Chapter 4 Higher Order Differential Equations
Fourier Transforms University of Texas at Austin CS384G - Computer Graphics Fall 2008 Don Fussell.
Subject :- Applied Mathematics
Approximation of Functions
Approximation of Functions
Presentation transcript:

Math Review CS474/674 – Prof. Bebis

Math Review Complex numbers Sine and Cosine Functions Sinc function Vector Basis Function Basis

Complex Numbers A complex number x is of the form: α: real part, b: imaginary part Addition: Multiplication:

Complex Numbers (cont’d) Magnitude-Phase (i.e., vector) representation: Magnitude: Phase: φ Magnitude-Phase notation:

Complex Numbers (cont’d) Multiplication using magnitude-phase representation Complex conjugate Properties

Complex Numbers (cont’d) Euler’s formula Properties j

Sine and Cosine Functions Periodic functions General form of sine and cosine functions: y(t)=Asin(αt+b) y(t)=Acos(αt+b)

Sine and Cosine Functions (cont’d) Special case: A=1, b=0, α=1 period=2π π 3π/2 π/2 π π/2 3π/2

Sine and Cosine Functions (cont’d) Changing the phase shift b: Note: cosine is a shifted sine function:

Sine and Cosine Functions (cont’d) Changing the amplitude A:

Sine and Cosine Functions (cont’d) Changing the period T=2π/|α|: Asssume A=1, b=0: y=cos(αt) α =4 period 2π/4=π/2 shorter period higher frequency (i.e., oscillates faster) frequency is defined as f=1/T Alternative notation: cos(αt) or cos(2πt/T) or cos(t/T) or cos(2πft) or cos(ft)

Sinc function The sinc function is defined as: In image processing, we use the normalized sinc function: The normalization causes the definite integral of the function over the real numbers to equal 1 (whereas the same integral of the un-normalized sinc function has a value of π). Also, it crosses the x-axis at integer locations.

Vectors An n-dimensional vector v is denoted as follows: The transpose vT is denoted as follows:

Dot product Given vT = (x1, x2, . . . , xn) and wT = (y1, y2, . . . , yn), their dot product defined as follows: (scalar) or

Linear combinations of vectors A vector v is a linear combination of the vectors v1, ..., vk: where c1, ..., ck are scalars Example: any vector in R3 can be expressed as a linear combinations of the unit vectors i = (1, 0, 0), j = (0, 1, 0), and k = (0, 0, 1)

Linear dependence A set of vectors v1, ..., vk are linearly dependent if at least one of them is a linear combination of the others. (i.e., vj does not appear at the right side)

Linear independence A set of vectors v1, ..., vk is linearly independent if implies Example:

Space spanning A set of vectors S=(v1, v2, . . . , vk ) span some space W if every vector in W can be written as a linear combination of the vectors in S Example: the vectors i, j, and k span R3 w

Vector basis A set of vectors (v1, ..., vk) is said to be a basis for a vector space W if (1) (v1, ..., vk) are linearly independent (2) (v1, ..., vk) span W Standard bases: R2 R3 Rn

Uniqueness of Vector Expansion Suppose v1, v2, . . . , vn represents a base in W, then any v є W has a unique vector expansion in this base: The coefficients of the expansion can be computed as follows:

Orthogonal Basis A basis with orthogonal/orthonormal basis vectors. Any set of basis vectors (x1, x2, . . . , xn) can be transformed to an orthogonal basis (o1, o2, . . . , on) using the Gram-Schmidt orthogonalization. k

Basis Functions We can compose arbitrary functions x(t) in “function space S” as a linear combination of simpler functions: The set of functions φi(t) are called the expansion set of S. If the expansion is unique, the set φi(t) is a basis.

Basis Functions (cont’d) The basis functions φi(t) are orthogonal in some interval [t1,t2] if: For complex valued basis sets:

Basis Functions (cont’d) The coefficients of the expansion can be computed as: Example: polynomial basis functions φi(t) = ti Taylor Series expansion