Digital Image Processing

Similar documents
Basics on 2-D 2 D Random Signal

Stochastic Processes

Theory and Problems of Signals and Systems

Time Series: Theory and Methods

Statistical and Adaptive Signal Processing

Lecture 7 MIMO Communica2ons

Prof. Dr.-Ing. Armin Dekorsy Department of Communications Engineering. Stochastic Processes and Linear Algebra Recap Slides

Advanced Digital Signal Processing -Introduction

No. of dimensions 1. No. of centers

Lesson 1. Optimal signalbehandling LTH. September Statistical Digital Signal Processing and Modeling, Hayes, M:

Multivariate Statistical Analysis

Lecture # 3 Orthogonal Matrices and Matrix Norms. We repeat the definition an orthogonal set and orthornormal set.

Introduction to Linear Systems

AMS526: Numerical Analysis I (Numerical Linear Algebra)

New Introduction to Multiple Time Series Analysis

Probability and Statistics for Final Year Engineering Students

Probability Space. J. McNames Portland State University ECE 538/638 Stochastic Signals Ver

MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.

Linear Algebra: Matrix Eigenvalue Problems

Lecture 22: Section 4.7

Lecture 1 Systems of Linear Equations and Matrices

ADVANCED ENGINEERING MATHEMATICS MATLAB

Homework 1 Elena Davidson (B) (C) (D) (E) (F) (G) (H) (I)

(Refer Slide Time: 2:04)

Course Name: Digital Signal Processing Course Code: EE 605A Credit: 3

Hands-on Matrix Algebra Using R

Adaptive Filtering. Squares. Alexander D. Poularikas. Fundamentals of. Least Mean. with MATLABR. University of Alabama, Huntsville, AL.

Linear Algebra. Min Yan

Lecture 3: QR-Factorization

Topics for the Qualifying Examination

Syllabus for IMGS-616 Fourier Methods in Imaging (RIT #11857) Week 1: 8/26, 8/28 Week 2: 9/2, 9/4

Digital Image Processing Chapter 11 Representation and Description

Lecture notes on Quantum Computing. Chapter 1 Mathematical Background

Periodicity & State Transfer Some Results Some Questions. Periodic Graphs. Chris Godsil. St John s, June 7, Chris Godsil Periodic Graphs

1 Singular Value Decomposition and Principal Component

Computer Assisted Image Analysis

linearly indepedent eigenvectors as the multiplicity of the root, but in general there may be no more than one. For further discussion, assume matrice

Schur s Triangularization Theorem. Math 422

Review (probability, linear algebra) CE-717 : Machine Learning Sharif University of Technology

MATH 20F: LINEAR ALGEBRA LECTURE B00 (T. KEMP)

Group representations

Random Matrix Theory Lecture 3 Free Probability Theory. Symeon Chatzinotas March 4, 2013 Luxembourg

Invertibility and stability. Irreducibly diagonally dominant. Invertibility and stability, stronger result. Reducible matrices

Contents. Acknowledgments

MP 472 Quantum Information and Computation

Cyclic Redundancy Check Codes

The Z transform (2) Alexandra Branzan Albu ELEC 310-Spring 2009-Lecture 28 1

Determine whether the following system has a trivial solution or non-trivial solution:

Statistical Signal Processing Detection, Estimation, and Time Series Analysis

Toeplitz matrices. Niranjan U N. May 12, NITK, Surathkal. Definition Toeplitz theory Computational aspects References

Chapter 5 Eigenvalues and Eigenvectors

Throughout these notes we assume V, W are finite dimensional inner product spaces over C.

This property turns out to be a general property of eigenvectors of a symmetric A that correspond to distinct eigenvalues as we shall see later.

Bindel, Fall 2016 Matrix Computations (CS 6210) Notes for

Chapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals

Linear Algebra And Its Applications Chapter 6. Positive Definite Matrix

Fundamentals of Matrices

TOEPLITZ OPERATORS. Toeplitz studied infinite matrices with NW-SE diagonals constant. f e C :

Image Registration Lecture 2: Vectors and Matrices

AMS526: Numerical Analysis I (Numerical Linear Algebra)

Spectral Theorem for Self-adjoint Linear Operators

Universal Fluctuation Formulae for one-cut β-ensembles

Mathematical foundations - linear algebra

Quantum Computing Lecture 2. Review of Linear Algebra

Lecture 11 FIR Filters

«Random Vectors» Lecture #2: Introduction Andreas Polydoros

1 Unitary representations of the Virasoro algebra

Eigenvalue Statistics for Toeplitz and Circulant Ensembles

Main matrix factorizations

Gaussian channel. Information theory 2013, lecture 6. Jens Sjölund. 8 May Jens Sjölund (IMT, LiU) Gaussian channel 1 / 26

c 1 v 1 + c 2 v 2 = 0 c 1 λ 1 v 1 + c 2 λ 1 v 2 = 0

EIGENFILTERS FOR SIGNAL CANCELLATION. Sunil Bharitkar and Chris Kyriakakis

Hypothesis testing in multilevel models with block circular covariance structures

Mathematical Methods for Engineers and Scientists 1

University of Colorado at Denver Mathematics Department Applied Linear Algebra Preliminary Exam With Solutions 16 January 2009, 10:00 am 2:00 pm

The Singular Value Decomposition

Reliability Theory of Dynamically Loaded Structures (cont.)

APPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.

December 20, MAA704, Multivariate analysis. Christopher Engström. Multivariate. analysis. Principal component analysis

Constructing an orthonormal set of eigenvectors for DFT matrix using Gramians and determinants

Topics in Representation Theory: Fourier Analysis and the Peter Weyl Theorem

Math 4153 Exam 3 Review. The syllabus for Exam 3 is Chapter 6 (pages ), Chapter 7 through page 137, and Chapter 8 through page 182 in Axler.

BOUNDARY CONDITIONS FOR SYMMETRIC BANDED TOEPLITZ MATRICES: AN APPLICATION TO TIME SERIES ANALYSIS

Stochastic Dynamics of SDOF Systems (cont.).

Lecture 8 : Eigenvalues and Eigenvectors

Part 1a: Inner product, Orthogonality, Vector/Matrix norm

REPLACE ONE ROW BY ADDING THE SCALAR MULTIPLE OF ANOTHER ROW

BASIC ALGORITHMS IN LINEAR ALGEBRA. Matrices and Applications of Gaussian Elimination. A 2 x. A T m x. A 1 x A T 1. A m x

Translation-invariant optical pattern recognition without correlation

Continuous and Discrete Time Signals and Systems

Example: Filter output power. maximization. Definition. Eigenvalues, eigenvectors and similarity. Example: Stability of linear systems.

(i) Represent discrete-time signals using transform. (ii) Understand the relationship between transform and discrete-time Fourier transform

Lecture 7 Predictive Coding & Quantization

Lectures 6 7 : Marchenko-Pastur Law

Foundations of Matrix Analysis

Numerical Methods in Matrix Computations

Lecture 3 Kernel properties and design in Cohen s class time-frequency distributions

Lecture 5. Ch. 5, Norms for vectors and matrices. Norms for vectors and matrices Why?

Digital Image Processing Lectures 13 & 14

j=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent.

Transcription:

Digital Image Processing 2D SYSTEMS & PRELIMINARIES Hamid R. Rabiee Fall 2015

Outline 2 Two Dimensional Fourier & Z-transform Toeplitz & Circulant Matrices Orthogonal & Unitary Matrices Block Matrices Diagonal Forms Kronecker Products Discrete Random Fields Spectral Density Function Rate Distortion Function

Two Dimensional Delta Functions 3 Defined from one-dimensional delta functions: Continuous: Discrete: Which satisfy below equalities: Continuous: Discrete:

Impulse Response 4 Consider a system with output and input sequences y(m,n) & x(m,n). we will define Transformation function of this system as: When x is Kronecker delta at location (m,n ) the output at (m,n) is called Impulse Response of the system:

Linear Systems 5 A system is called linear iff any combination of inputs produce same combination of their respective outputs: For any linear system we have:

Shift Invariant Systems 6 A system is called Spatially Invariant or Shift Invariant if a translation of the input causes a translation of output: Which results in: For any shift invariant system we have:

The Fourier Transform 7 Fourier transform of image x(m,n) is defined as: Which is periodic with period 2π in each argument: Inverse Fourier transform of is defined as: The Fourier transform of shift invariant system is called frequency response.

Properties of Fourier Transform 8

Z-Transform 9 The Z-transform of complex sequence x(m,n) is defined as: It is simple to find Z-transform of output: Inverse of Z-transform is: Contour On ROC What is the relation of Fourier transform & Z-transform?

Properties of Z-Transform 10

Causality & Stability 11 A linear shift Invariant system is stable if: Which implies that ROC of must include unit circles: It is Causal if its impulse response is nonzero only when both arguments are positive.

Optical & Modulation Transfer 12 Functions For a shift invariant imaging system its optical transfer function is: And its modulation transfer function is:

Toeplitz Matrices 13 A matrix is called Toeplitz if or each element is only depend on difference between its indices: For an N N Toeplitz matrix how many elements is needed to completely define it? Toeplitz matrices describe: input-output transformations of one-dimensional linear shift invariant systems correlation matrices of stationary sequences.

Circulant Matrices 14 A matrix C is called circulant if each of its rows (or columns) is a circular shift of the previous row (or column), i.e. c(m, n) = c ((m - n) modulo N). For an N N Circulant matrix how many elements is needed to completely define it? Circulant Matrices describe: input-output behavior of one-dimensional linear periodic systems. correlation matrices of periodic sequences.

Orthogonal and Unitary Matrices 15 Matrix A is orthogonal if or It is unitary if : or Which is unitary? Which is orthogonal?

Diagonal Forms 16 For any Hermitian matrix R there exist a unitary matrix such that: A diagonal matrix with eigenvalues of R Eigenmatrix of R

Kronecker Products 17 Kronecker product of two matrices A and B is defined as: Are and Equal?

Properties of Kronecker Products 18

Block Matrices 19 Block Toeplitz Block Circulant Toeplitz Block Toeplitz Circulant If Both of above Doubly Block Toeplitz If Both of above Doubly Block Circulant

Discrete Random Fields 20 When each sample of a two-dimensional sequence is a random variable, we call it a discrete random field. For a complex random field: We call this random field wide-sense stationary if: It also called shift invariant, translational (or spatial) invariant and homogeneous.

Properties of Random fields 21

Spectral Density Function 22 For stationary random field covariance generating function (CGF) is: Spectral density function or (SDF) is:

Properties of SDF 23

Entropy 24

Rate Distortion Function 25 The distortion function of x (which is a Gaussian random variable with variance and y is its reproduction) is defined as: Where D is:

Relation Between Distortion and 26 Rate

End of Lecture 3 Thank You! Tables, Pictures & equations are taken from Jain Book.