Digital Image Processing

Slides:



Advertisements
Similar presentations
Z-Plane Analysis DR. Wajiha Shah. Content Introduction z-Transform Zeros and Poles Region of Convergence Important z-Transform Pairs Inverse z-Transform.
Advertisements

[1] AN ANALYSIS OF DIGITAL WATERMARKING IN FREQUENCY DOMAIN.
Digital Kommunikationselektronik TNE027 Lecture 5 1 Fourier Transforms Discrete Fourier Transform (DFT) Algorithms Fast Fourier Transform (FFT) Algorithms.
1 / 13 Fourier, bandwidth, filter. 2 / 13 The important roles of Fourier series and Fourier transforms: –To analysis and synthesis signals in frequency.
Basis beeldverwerking (8D040) dr. Andrea Fuster Prof.dr. Bart ter Haar Romeny dr. Anna Vilanova Prof.dr.ir. Marcel Breeuwer The Fourier Transform II.
Chapter 4 Image Enhancement in the Frequency Domain.
Sep 15, 2005CS477: Analog and Digital Communications1 Modulation and Sampling Analog and Digital Communications Autumn
Week 14. Review 1.Signals and systems 2.State machines 3.Linear systems 4.Hybrid systems 5.LTI systems & frequency response 6.Convolution 7.Fourier Transforms.
Course 2007-Supplement Part 11 NTSC (1) NTSC: 2:1 interlaced, 525 lines per frame, 60 fields per second, and 4:3 aspect ratio horizontal sweep frequency,
Digital Image Processing Chapter 4: Image Enhancement in the Frequency Domain.
Chapter 4 Image Enhancement in the Frequency Domain.
Image (and Video) Coding and Processing Lecture 2: Basic Filtering Wade Trappe.
Basics of Signal Processing. frequency = 1/T  speed of sound × T, where T is a period sine wave period (frequency) amplitude phase.
G52IIP, School of Computer Science, University of Nottingham 1 Image Transforms Fourier Transform Basic idea.
Fourier representation for discrete-time signals And Sampling Theorem
EE421, Fall 1998 Michigan Technological University Timothy J. Schulz 08-Sept, 98EE421, Lecture 11 Digital Signal Processing (DSP) Systems l Digital processing.
DTFT And Fourier Transform
Numerical Analysis – Digital Signal Processing Hanyang University Jong-Il Park.
Basics of Signal Processing. SIGNALSOURCE RECEIVER describe waves in terms of their significant features understand the way the waves originate effect.
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: Introduction to the IEEE Derivation of the DFT Relationship to DTFT DFT of Truncated.
Fourier series. The frequency domain It is sometimes preferable to work in the frequency domain rather than time –Some mathematical operations are easier.
Chapter 4: Image Enhancement in the Frequency Domain Chapter 4: Image Enhancement in the Frequency Domain.
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
(Lecture #08)1 Digital Signal Processing Lecture# 8 Chapter 5.
Part I: Image Transforms DIGITAL IMAGE PROCESSING.
Digital Image Processing Chapter 4 Image Enhancement in the Frequency Domain Part I.
Notice  HW problems for Z-transform at available on the course website  due this Friday (9/26/2014) 
Fourier Analysis of Discrete Time Signals
Digital Signal Processing
Lecture 7 Transformations in frequency domain 1.Basic steps in frequency domain transformation 2.Fourier transformation theory in 1-D.
CS654: Digital Image Analysis
CS654: Digital Image Analysis Lecture 13: Discrete Fourier Transformation.
Fourier and Wavelet Transformations Michael J. Watts
Fast Fourier Transforms. 2 Discrete Fourier Transform The DFT pair was given as Baseline for computational complexity: –Each DFT coefficient requires.
Image Enhancement (Frequency Domain)
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Derivation of the DFT Relationship to DTFT DFT of Truncated Signals.
1 “Figures and images used in these lecture notes by permission, copyright 1997 by Alan V. Oppenheim and Alan S. Willsky” Signals and Systems Spring 2003.
Chapter 2. Characteristics of Signal ※ Signal : transmission of information The quality of the information depends on proper selection of a measurement.
Digital Image Processing Lecture 7: Image Enhancement in Frequency Domain-I Naveed Ejaz.
Dr. Michael Nasief Digital Signal Processing Lec 7 1.
Equations of Circles.
Image Enhancement and Restoration
Section II Digital Signal Processing ES & BM.
Digital Signal Processing Lecture 4 DTFT
Equations of Circles.
Fourier and Wavelet Transformations
Discrete Fourier Transform (DFT)
Fourier Transform.
Image Acquisition.
ENG4BF3 Medical Image Processing
Frequency Domain Analysis
2D Fourier transform is separable
Equations of Circles.
Digital Image Processing
IMAGE SAMPLING AND IMAGE QUANTIZATION 1. Introduction
Images reconstruction. Radon transform.
1-D DISCRETE COSINE TRANSFORM DCT
Discrete Fourier Transform
Digital Image Procesing Discrete CosineTrasform (DCT) in Image Processing DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL.
 = N  N matrix multiplication N = 3 matrix N = 3 matrix N = 3 matrix
Discrete Fourier Transform
Continuous-Time Fourier Transform
Digital Image Procesing Unitary Transforms Discrete Fourier Trasform (DFT) in Image Processing DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
Lecture 4 Image Enhancement in Frequency Domain
Discrete Fourier Transform
EE150: Signals and Systems 2016-Spring
The Frequency Domain Any wave shape can be approximated by a sum of periodic (such as sine and cosine) functions. a--amplitude of waveform f-- frequency.
Chapter Equations of Circles.
Signals and Systems Lecture 18
Presentation transcript:

Digital Image Processing Lecture 2 Digital Image Processing

Image sensors

Sampling and Quantization

Representing digital images

1D sampling Bandlimited real 1D - signal: F F

2D Sampling y f(x,y) x y x

Fourier transform 1D –FT: 2D – FT:

Separability of 2D - FT

Discrete Fourier transform 1D – DFT: 2D – DFT: 2D DFT is also separable!

What do u and v mean? y x v u Magnitude of Fourier transform

2D DFT

2D DFT Centering the DFT:

2D DFT Log of the magnitude

2D Sampling f(x,y) y x

Sampling

Question Given that the Fourier transform of an image is non zero over a circular area of radius , what happens if Can we do any better?

Hexagonal Sampling grid Best packing density for circles

Fuji super CCD sensor