Image preprocessing in spatial domain
|
|
- Felicity Richard
- 5 years ago
- Views:
Transcription
1 Image preprocessing in spatial domain Sampling theorem, aliasing, interpolation, geometrical transformations Revision: 1.4, dated: May 25, 2006 Tomáš Svoboda Czech Technical University, Faculty of Electrical Engineering Center for Machine Perception, Prague, Czech Republic
2 Reminder Convolution theorem The Fourier transform of a convolution is the product of the Fourier transforms. F{f(x, y) h(x, y)} = F (u, v)h(u, v) The Fourier transform of a product is the convolution of the Fourier transforms. F{f(x, y)h(x, y)} = F (u, v) H(u, v) 2/90
3 Impulse (delta) function 3/90 δ(x) = H(x) x where H(x) is the Heaviside step function 1 Sifting property scaling property 1 f(x)δ(x a)dx = f(a) δ(ax) = a δ(x) 1 Eric W. Weisstein. Heaviside Step Function. From MathWorld A Wolfram Web Resource.
4 Replication of delta function Shah function 4/90 III(x) = k= δ(x k)
5 Replication of delta function Shah function 4/90 III(x) = k= δ(x k) 2 2 Eric W. Weisstein. Shah Function. From MathWorld A Wolfram Web Resource.
6 2D Shah function bed and nails 5/90 y x III(x, y) = k= l= δ(x k, y l)
7 For unit intervals 2D Shah function properties 6/90 III(x, y) = k= l= δ(x k, y l)
8 For unit intervals 2D Shah function properties 6/90 III(x, y) = δ(x k, y l) k= l= If we need samples spaced X and Y III ( x X, y Y ) = XY δ(x kx, y ly ) k= l= because of the scaling property of the delta function δ(ax) = 1 a δ(x)
9 2D Shah function Fourier pair 7/90 F{III ( x X, y Y ) } = XY III (Xu, Y v) The Shah function is its own transform but the frequency inverses! This will have important consequences!
10 Sampling by using the Shah function Product of a function with the Shah function. 8/90 s(x, y) = III(x, y)f(x, y) We know from convolution theorem that S(u, v) = III(u, v) F (u, v)
11 Sampling theorem 9/ Image taken from [1]
12 Sampling theorem Aliasing 10/90
13 Sampling theorem Aliasing 11/90
14 Sampling theorem Aliasing 12/90
15 Sampling theorem Aliasing 13/90
16 From continuous to discrete and back again 14/ x x 10 4
17 From continuous to discrete and back again 15/90
18 From continuous to discrete and back again 16/90
19 From continuous to discrete and back again 17/90
20 From continuous to discrete and back again 18/90
21 From continuous to discrete and back again 19/90
22 From continuous to discrete and back again 20/90
23 From continuous to discrete and back again 21/90
24 From continuous to discrete and back again 22/90
25 From continuous to discrete and back again 23/90 Sum the sinc functions up.
26 From continuous to discrete and back again 24/90 Compare the reconstructed result with the original function.
27 1D sampling T vz = T max 8 25/ x x 10 4
28 1D sampling T vz = T max 2 26/ x x 10 4
29 1D sampling T vz = T max 27/ x x 10 4
30 1D sampling T vz = 2.1 T max 28/ x x 10 4
31 Image aliasing example 100% 29/90
32 Aliasing example 90% 30/90
33 Aliasing example 80% 31/90
34 Aliasing example 70% 32/90
35 Aliasing example 60% 33/90
36 Aliasing example 50% 34/90
37 Aliasing example 40% 35/90
38 Aliasing example 30% 36/90
39 Aliasing example 20% 37/90
40 Aliasing example 10% 38/90
41 Aliasing problem in digital photography 39/90
42 Aliasing example 90% 40/90
43 Aliasing example 80% 41/90
44 Aliasing example 70% 42/90
45 Aliasing example 60% 43/90
46 Aliasing example 50% 44/90
47 Aliasing example 40% 45/90
48 Aliasing example 30% 46/90
49 Aliasing example 20% 47/90
50 Aliasing example 10% 48/90
51 What can we do against aliasing? Increase sampling frequency number of pixels (but not only, optics is also important) Decrease the frequency blurring The same snapshots but the input image blurred (convolved) with 5 5 Gaussian with σ = 2: 49/90
52 Suppressed Aliasing 50/90
53 Suppressed Aliasing example 90% 51/90
54 Suppressed Aliasing example 80% 52/90
55 Suppressed Aliasing example 70% 53/90
56 Suppressed Aliasing example 60% 54/90
57 Suppressed Aliasing example 50% 55/90
58 Suppressed Aliasing example 40% 56/90
59 Suppressed Aliasing example 30% 57/90
60 Suppressed Aliasing example 20% 58/90
61 Suppressed Aliasing example 10% 59/90
62 Sampling, Aliasing Revisited Sampling is an important issue in images. 60/90 Aliasing is typically not wanted. Aliasing is ubiquitous. Toy www example4 4
63 Sampling, Aliasing Revisited Sampling is an important issue in images. 60/90 Aliasing is typically not wanted. Aliasing is ubiquitous. Toy www example4 Defeating Aliasing Low-pass filter before subsampling Subsampling by using image interpolation (will come to that later) 4
64 Geometrical Transformation Transformation of spatial coordinates 61/90
65 Geometrical Transformation What for? intentional image transformations (you know where to go) 62/90 resizing rotation shift warping, texture mapping correction of distortions (you know how it should look) projective skew non-linear distortion (fish-eyes) Techniques shared by Image processing, Computer graphics, even Robotics or Mechanics.
66 Example of texture mapping 63/90
67 Realization Rotation and shift 64/90 x = cos(α)x + sin(α)y + t x y = sin(α)x + cos(α)y + t y More elegant and efficient x y 1 = cos(α) sin(α) t x sin(α) cos(α) t y x y 1 in a matrix form x = T x where x and x are homogeneous coordinates: x = [λx, λy, λ] T, λ 0.
68 Identity 65/90 T = identity
69 Rotation 66/90 T = cos(α) sin(α) 0 sin(α) cos(α) rotation for α = 10 T =
70 Rotation + translation 67/90 T = cos(α) sin(α) t x sin(α) cos(α) t y Euclidean for α = 10 and t = [ 50, 30] T T =
71 Affine 68/90 T = affine in general T = a b c d e f degrees of freedom
72 Projective 69/90 T = projective in general T = a b c d e f g h degrees of freedom
73 Correction of converging lines I 70/90
74 Correction of converging lines II 71/90
75 Correction of converging lines III 72/90
76 x = T x; Forward mapping 73/90 I(x,y) I (x,y )
77 Forward mapping problems Maps outside the pixel locations. 74/90 I(x,y) I (x,y )
78 Forward mapping problems Solution: Spread out the effect of each pixel 75/90 I(x,y) I (x,y )
79 Forward mapping problems May produce holes in the output 76/90 I(x,y) I (x,y )
80 Forward mapping problems May produce holes in the output 77/90 I(x,y) I (x,y )
81 Forward mapping problems May produce holes in the output 78/90 I(x,y) I (x,y )
82 Forward mapping problems May produce holes in the output 79/90 I(x,y)? I (x,y )
83 x = T 1 x Backward mapping 80/90 I(x,y) I (x,y )
84 Backward mapping problems Does not always map from a pixel 81/90 I(x,y) I (x,y )
85 Backward mapping problems Solution: Interpolate between pixels 82/90 I(x,y) I (x,y )
86 Interpolation as 2D convolution We have sampled (possibly outside the regular grid) function s(x, y) instead of the wanted f(x, y). We want to find a good approximation by convolution 83/90 ˆf(x, y) = k= l= s(k, l)h(x k, y l)
87 Interpolation nearest neighbour 84/90
88 Interpolation bilinear 85/90 ˆf(x, y) = (1 a)(1 b) s(l, k) + a(1 b) s(l + 1, k) +b(1 a) s(l, k + 1) + ab s(l + 1, k + 1), where l = round (x), a = x l, k = round (y), b = y k.
89 Just 1D, for clarity Interpolation bicubic 86/90 ˆf = 1 2 x 2 + x 3 pro 0 x < 1, 4 8 x + 5 x 2 x 3 pro 1 x < 2, 0 elsewhere. Does not remind you the shape something?
90 Just 1D, for clarity Interpolation bicubic 86/90 ˆf = 1 2 x 2 + x 3 pro 0 x < 1, 4 8 x + 5 x 2 x 3 pro 1 x < 2, 0 elsewhere. Does not remind you the shape something? sinc(x)! The ideal reconstructor.
91 Interpolation nearest vs. bilinear 87/90 rotation rotation nearest bilinear
92 Interpolation nearest vs. bilinear close up 88/90 affine affine nearest bilinear
93 Geometrical Transformation Summary Closed form solution, all pixels undergo the same transformation 89/90 rotation, scaling, translation affine, perspective General, deformation meshes. Transformation depends on position (warping, morphing)
94 References 90/90 [1] Ronald N. Bracewell. Fourier analysis and imaging. Kluwer Academic/Plenum Publishers, New York, USA, 2003.
95
96
97 y x
98
99
100
101
102
103 x x 10 4
104
105
106
107
108
109
110
111
112
113
114 x x 10 4
115 x x 10 4
116 x x 10 4
117 x x 10 4
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150 identity
151 rotation
152 Euclidean
153 affine
154 projective
155
156
157
158
159
160
161 I(x,y) I (x,y )
162 I(x,y) I (x,y )
163 I(x,y) I (x,y )
164 I(x,y) I (x,y )
165 I(x,y) I (x,y )
166 I(x,y) I (x,y )
167 I(x,y)? I (x,y )
168 I(x,y) I (x,y )
169 I(x,y) I (x,y )
170 I(x,y) I (x,y )
171
172
173
174 rotation
175 rotation
176 affine
177 affine
Image preprocessing in spatial domain
Image preprocessing in spatial domain Sampling theorem, aliasing, interpolation, geometrical transformations Revision: 1.3, dated: December 7, 2005 Tomáš Svoboda Czech Technical University, Faculty of
More informationImage preprocessing in spatial domain
Image preprocessing in spatial domain Sharpening, image derivatives, Laplacian, edges Revision: 1.2, dated: May 25, 2007 Tomáš Svoboda Czech Technical University, Faculty of Electrical Engineering Center
More informationLeast squares Solution of Homogeneous Equations
Least squares Solution of Homogeneous Equations supportive text for teaching purposes Revision: 1.2, dated: December 15, 2005 Tomáš Svoboda Czech Technical University, Faculty of Electrical Engineering
More informationRepresentation of 1D Function
Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2005 Linear Systems Lecture 2 Representation of 1D Function From the sifting property, we can write a 1D function as g(x) = g(ξ)δ(x ξ)dξ.
More informationFourier Transform in Image Processing. CS/BIOEN 6640 U of Utah Guido Gerig (slides modified from Marcel Prastawa 2012)
Fourier Transform in Image Processing CS/BIOEN 6640 U of Utah Guido Gerig (slides modified from Marcel Prastawa 2012) Basis Decomposition Write a function as a weighted sum of basis functions f ( x) wibi(
More informationLinear Operators and Fourier Transform
Linear Operators and Fourier Transform DD2423 Image Analysis and Computer Vision Mårten Björkman Computational Vision and Active Perception School of Computer Science and Communication November 13, 2013
More informationEvaluation, transformation, and parameterization of epipolar conics
Evaluation, transformation, and parameterization of epipolar conics Tomáš Svoboda svoboda@cmp.felk.cvut.cz N - CTU CMP 2000 11 July 31, 2000 Available at ftp://cmp.felk.cvut.cz/pub/cmp/articles/svoboda/svoboda-tr-2000-11.pdf
More informationSampling in 1D ( ) Continuous time signal f(t) Discrete time signal. f(t) comb
Sampling in 2D 1 Sampling in 1D Continuous time signal f(t) Discrete time signal t ( ) f [ k] = f( kt ) = f( t) δ t kt s k s f(t) comb k 2 Nyquist theorem (1D) At least 2 sample/period are needed to represent
More informationAssignment 2 Solutions
EE225E/BIOE265 Spring 2012 Principles of MRI Miki Lustig Assignment 2 Solutions 1. Read Nishimura Ch. 3 2. Non-Uniform Sampling. A student has an assignment to monitor the level of Hetch-Hetchi reservoir
More informationFourier Transform Chapter 10 Sampling and Series
Fourier Transform Chapter 0 Sampling and Series Sampling Theorem Sampling Theorem states that, under a certain condition, it is in fact possible to recover with full accuracy the values intervening between
More informationOperations depend on pixel s Coordinates. Context free. Independent of pixel values. I(x,y) I (x,y )
Geometric Transformation Operations depend on piel s Coordinates. Contet free. Independent of piel values. f f (, ) = ' (, ) = ' I(, ) = I' ( f (, ), f ( ) ), (,) (, ) I(,) I (, ) Eample: Translation =
More informationIMAGE WARPING APPLICATIONS. register multiple images (registration) correct system distortions. register image to map (rectification)
APPLICATIONS IMAGE WARPING N correct system distortions Rectification of Landsat TM image register multiple images (registration) original register image to map (rectification) N fill Speedway rectified
More informationImages have structure at various scales
Images have structure at various scales Frequency Frequency of a signal is how fast it changes Reflects scale of structure A combination of frequencies 0.1 X + 0.3 X + 0.5 X = Fourier transform Can we
More informationECE 425. Image Science and Engineering
ECE 425 Image Science and Engineering Spring Semester 2000 Course Notes Robert A. Schowengerdt schowengerdt@ece.arizona.edu (520) 62-2706 (voice), (520) 62-8076 (fa) ECE402 DEFINITIONS 2 Image science
More informationFourier Analysis and Imaging Ronald Bracewell L.M. Terman Professor of Electrical Engineering Emeritus Stanford University Stanford, California
Fourier Analysis and Imaging Ronald Bracewell L.M. Terman Professor of Electrical Engineering Emeritus Stanford University Stanford, California 4u Springer Contents fa 1 PREFACE INTRODUCTION xiii 1 11
More informationCITS 4402 Computer Vision
CITS 4402 Computer Vision Prof Ajmal Mian Adj/A/Prof Mehdi Ravanbakhsh, CEO at Mapizy (www.mapizy.com) and InFarm (www.infarm.io) Lecture 04 Greyscale Image Analysis Lecture 03 Summary Images as 2-D signals
More informationG52IVG, School of Computer Science, University of Nottingham
Image Transforms Fourier Transform Basic idea 1 Image Transforms Fourier transform theory Let f(x) be a continuous function of a real variable x. The Fourier transform of f(x) is F ( u) f ( x)exp[ j2πux]
More informationReading. 3. Image processing. Pixel movement. Image processing Y R I G Q
Reading Jain, Kasturi, Schunck, Machine Vision. McGraw-Hill, 1995. Sections 4.-4.4, 4.5(intro), 4.5.5, 4.5.6, 5.1-5.4. 3. Image processing 1 Image processing An image processing operation typically defines
More informationIMAGE INVARIANTS. Andrej Košir, Jurij F. Tasič
IMAGE INVARIANTS Andrej Košir, Jurij F. Tasič University of Ljubljana Faculty of Electrical Engineering Tržaška 25, Ljubljana, Slovenia andrej.kosir@fe.uni-lj.si ABSTRACT A pre-processing technique for
More informationOxford Scholarship Online
University Press Scholarship Online Oxford Scholarship Online Methods in Theoretical Quantum Optics Stephen Barnett and Paul Radmore Print publication date: 2002 Print ISBN-13: 9780198563617 Published
More informationWavelets and Multiresolution Processing
Wavelets and Multiresolution Processing Wavelets Fourier transform has it basis functions in sinusoids Wavelets based on small waves of varying frequency and limited duration In addition to frequency,
More informationBioE Exam 1 10/9/2018 Answer Sheet - Correct answer is A for all questions. 1. The sagittal plane
BioE 1330 - Exam 1 10/9/2018 Answer Sheet - Correct answer is A for all questions 1. The sagittal plane A. is perpendicular to the coronal plane. B. is parallel to the top of the head. C. represents a
More informationComputer Vision & Digital Image Processing
Computer Vision & Digital Image Processing Image Restoration and Reconstruction I Dr. D. J. Jackson Lecture 11-1 Image restoration Restoration is an objective process that attempts to recover an image
More information3. Lecture. Fourier Transformation Sampling
3. Lecture Fourier Transformation Sampling Some slides taken from Digital Image Processing: An Algorithmic Introduction using Java, Wilhelm Burger and Mark James Burge Separability ² The 2D DFT can be
More informationECG782: Multidimensional Digital Signal Processing
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Spring 2014 TTh 14:30-15:45 CBC C313 Lecture 05 Image Processing Basics 13/02/04 http://www.ee.unlv.edu/~b1morris/ecg782/
More informationSIMG-782 Digital Image Processing Homework 6
SIMG-782 Digital Image Processing Homework 6 Ex. 1 (Circular Convolution) Let f [1, 3, 1, 2, 0, 3] and h [ 1, 3, 2]. (a) Calculate the convolution f h assuming that both f and h are zero-padded to a length
More informationA STATISTICAL APPROACH TO IMAGE WARPING. Chris Glasbey. Biomathematics and Statistics Scotland
A STATISTICAL APPROACH TO IMAGE WARPING Chris Glasbey Biomathematics and Statistics Scotland IMAGE ANALYSIS: the extraction of information from pictures Which line is longer? Who is this? 2 The human eye/brain
More informationFourier transform. Stefano Ferrari. Università degli Studi di Milano Methods for Image Processing. academic year
Fourier transform Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Methods for Image Processing academic year 27 28 Function transforms Sometimes, operating on a class of functions
More informationA Method for Blur and Similarity Transform Invariant Object Recognition
A Method for Blur and Similarity Transform Invariant Object Recognition Ville Ojansivu and Janne Heikkilä Machine Vision Group, Department of Electrical and Information Engineering, University of Oulu,
More informationDiscrete Fourier Transform
Discrete Fourier Transform DD2423 Image Analysis and Computer Vision Mårten Björkman Computational Vision and Active Perception School of Computer Science and Communication November 13, 2013 Mårten Björkman
More informationImage Filtering. Slides, adapted from. Steve Seitz and Rick Szeliski, U.Washington
Image Filtering Slides, adapted from Steve Seitz and Rick Szeliski, U.Washington The power of blur All is Vanity by Charles Allen Gillbert (1873-1929) Harmon LD & JuleszB (1973) The recognition of faces.
More informationConvolution and Linear Systems
CS 450: Introduction to Digital Signal and Image Processing Bryan Morse BYU Computer Science Introduction Analyzing Systems Goal: analyze a device that turns one signal into another. Notation: f (t) g(t)
More informationEdges and Scale. Image Features. Detecting edges. Origin of Edges. Solution: smooth first. Effects of noise
Edges and Scale Image Features From Sandlot Science Slides revised from S. Seitz, R. Szeliski, S. Lazebnik, etc. Origin of Edges surface normal discontinuity depth discontinuity surface color discontinuity
More informationAssignment for next week
Assignment for next week Due: 6:30 PM Monday April 11 th (2016) -> PDF by email only 5 points: Pose two questions based on this lecture 5 points: what (and why) is sinc(0)? 5 points: ketch (by hand okay)
More informationTransformations. Lars Vidar Magnusson. August 24,
Transformations Lars Vidar Magnusson August 24, 2012 http://www.it.hiof.no/~larsvmag/iti43309/index.html 2D Translation To translate an object is to move it in two-dimensinal space. If we have a point
More informationDISCRETE FOURIER TRANSFORM
DD2423 Image Processing and Computer Vision DISCRETE FOURIER TRANSFORM Mårten Björkman Computer Vision and Active Perception School of Computer Science and Communication November 1, 2012 1 Terminology:
More informationLecture 3: Linear Filters
Lecture 3: Linear Filters Professor Fei Fei Li Stanford Vision Lab 1 What we will learn today? Images as functions Linear systems (filters) Convolution and correlation Discrete Fourier Transform (DFT)
More informationRepresentation of 1D Function
Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2005 Linear Systems Lecture 2 Representation of 1D Function From the sifting property, we can write a 1D function as g( = g(ξδ( ξdξ. To
More informationOutline. Convolution. Filtering
Filtering Outline Convolution Filtering Logistics HW1 HW2 - out tomorrow Recall: what is a digital (grayscale) image? Matrix of integer values Images as height fields Let s think of image as zero-padded
More informationLecture 3: Linear Filters
Lecture 3: Linear Filters Professor Fei Fei Li Stanford Vision Lab 1 What we will learn today? Images as functions Linear systems (filters) Convolution and correlation Discrete Fourier Transform (DFT)
More informationTRACKING and DETECTION in COMPUTER VISION Filtering and edge detection
Technischen Universität München Winter Semester 0/0 TRACKING and DETECTION in COMPUTER VISION Filtering and edge detection Slobodan Ilić Overview Image formation Convolution Non-liner filtering: Median
More informationECE Digital Image Processing and Introduction to Computer Vision
ECE592-064 Digital Image Processing and Introduction to Computer Vision Depart. of ECE, NC State University Instructor: Tianfu (Matt) Wu Spring 2017 Outline Recap, image degradation / restoration Template
More informationToday s lecture. Local neighbourhood processing. The convolution. Removing uncorrelated noise from an image The Fourier transform
Cris Luengo TD396 fall 4 cris@cbuuse Today s lecture Local neighbourhood processing smoothing an image sharpening an image The convolution What is it? What is it useful for? How can I compute it? Removing
More informationVlad Estivill-Castro (2016) Robots for People --- A project for intelligent integrated systems
1 Vlad Estivill-Castro (2016) Robots for People --- A project for intelligent integrated systems V. Estivill-Castro 2 Perception Concepts Vision Chapter 4 (textbook) Sections 4.3 to 4.5 What is the course
More informationDigital Image Processing
Digital Image Processing, 2nd ed. Digital Image Processing Chapter 7 Wavelets and Multiresolution Processing Dr. Kai Shuang Department of Electronic Engineering China University of Petroleum shuangkai@cup.edu.cn
More informationAdditional Pointers. Introduction to Computer Vision. Convolution. Area operations: Linear filtering
Additional Pointers Introduction to Computer Vision CS / ECE 181B andout #4 : Available this afternoon Midterm: May 6, 2004 W #2 due tomorrow Ack: Prof. Matthew Turk for the lecture slides. See my ECE
More informationECG782: Multidimensional Digital Signal Processing
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Filtering in the Frequency Domain http://www.ee.unlv.edu/~b1morris/ecg782/ 2 Outline Background
More informationMath 126 Final Exam Solutions
Math 126 Final Exam Solutions 1. (a) Give an example of a linear homogeneous PE, a linear inhomogeneous PE, and a nonlinear PE. [3 points] Solution. Poisson s equation u = f is linear homogeneous when
More informationTemplates, Image Pyramids, and Filter Banks
Templates, Image Pyramids, and Filter Banks 09/9/ Computer Vision James Hays, Brown Slides: Hoiem and others Review. Match the spatial domain image to the Fourier magnitude image 2 3 4 5 B A C D E Slide:
More informationDigital Image Processing
Digital Image Processing Part 3: Fourier Transform and Filtering in the Frequency Domain AASS Learning Systems Lab, Dep. Teknik Room T109 (Fr, 11-1 o'clock) achim.lilienthal@oru.se Course Book Chapter
More informationAffine Normalization of Symmetric Objects
Affine Normalization of Symmetric Objects Tomáš Suk and Jan Flusser Institute of Information Theory and Automation, Academy of Sciences of the Czech Republic, Pod vodárenskou věží 4, 182 08 Prague 8, Czech
More informationIntroduction to Computer Vision. 2D Linear Systems
Introduction to Computer Vision D Linear Systems Review: Linear Systems We define a system as a unit that converts an input function into an output function Independent variable System operator or Transfer
More informationIntroduction to Image Processing #5/7
Outline Introduction to Image Processing #5/7 Thierry Géraud EPITA Research and Development Laboratory (LRDE) 2006 Outline Outline 1 Introduction 2 About the Dirac Delta Function Some Useful Functions
More informationContinuous Fourier transform of a Gaussian Function
Continuous Fourier transform of a Gaussian Function Gaussian function: e t2 /(2σ 2 ) The CFT of a Gaussian function is also a Gaussian function (i.e., time domain is Gaussian, then the frequency domain
More informationGBS765 Electron microscopy
GBS765 Electron microscopy Lecture 1 Waves and Fourier transforms 10/14/14 9:05 AM Some fundamental concepts: Periodicity! If there is some a, for a function f(x), such that f(x) = f(x + na) then function
More informationIntroduction to Linear Image Processing
Introduction to Linear Image Processing 1 IPAM - UCLA July 22, 2013 Iasonas Kokkinos Center for Visual Computing Ecole Centrale Paris / INRIA Saclay Image Sciences in a nutshell 2 Image Processing Image
More informationImage Processing 1 (IP1) Bildverarbeitung 1
MIN-Fakultät Fachbereich Informatik Arbeitsbereich SAV/BV (KOGS Image Processing 1 (IP1 Bildverarbeitung 1 Lecture 5 Perspec
More informationLecture Topics GVMS Prof. Dr.-Ing. habil. Hermann Lödding Prof. Dr.-Ing. Wolfgang Hintze. PD Dr.-Ing. habil.
Lecture Topics 1. Introduction 2. Sensor Guides Robots / Machines 3. Motivation Model Calibration 4. 3D Video Metric (Geometrical Camera Model) 5. Grey Level Picture Processing for Position Measurement
More informationScience Insights: An International Journal
Available online at http://www.urpjournals.com Science Insights: An International Journal Universal Research Publications. All rights reserved ISSN 2277 3835 Original Article Object Recognition using Zernike
More informationSURF Features. Jacky Baltes Dept. of Computer Science University of Manitoba WWW:
SURF Features Jacky Baltes Dept. of Computer Science University of Manitoba Email: jacky@cs.umanitoba.ca WWW: http://www.cs.umanitoba.ca/~jacky Salient Spatial Features Trying to find interest points Points
More informationLecture 8: Interest Point Detection. Saad J Bedros
#1 Lecture 8: Interest Point Detection Saad J Bedros sbedros@umn.edu Last Lecture : Edge Detection Preprocessing of image is desired to eliminate or at least minimize noise effects There is always tradeoff
More informationSampling. Alejandro Ribeiro. February 8, 2018
Sampling Alejandro Ribeiro February 8, 2018 Signals exist in continuous time but it is not unusual for us to process them in discrete time. When we work in discrete time we say that we are doing discrete
More informationQuality Improves with More Rays
Recap Quality Improves with More Rays Area Area 1 shadow ray 16 shadow rays CS348b Lecture 8 Pat Hanrahan / Matt Pharr, Spring 2018 pixelsamples = 1 jaggies pixelsamples = 16 anti-aliased Sampling and
More informationFeature Extraction and Image Processing
Feature Extraction and Image Processing Second edition Mark S. Nixon Alberto S. Aguado :*авш JBK IIP AMSTERDAM BOSTON HEIDELBERG LONDON NEW YORK OXFORD PARIS SAN DIEGO SAN FRANCISCO SINGAPORE SYDNEY TOKYO
More informationSingle Exposure Enhancement and Reconstruction. Some slides are from: J. Kosecka, Y. Chuang, A. Efros, C. B. Owen, W. Freeman
Single Exposure Enhancement and Reconstruction Some slides are from: J. Kosecka, Y. Chuang, A. Efros, C. B. Owen, W. Freeman 1 Reconstruction as an Inverse Problem Original image f Distortion & Sampling
More informationA New Efficient Method for Producing Global Affine Invariants
A New Efficient Method for Producing Global Affine Invariants Esa Rahtu, Mikko Salo 2, and Janne Heikkilä Machine Vision Group, Department of Electrical and Information Engineering, P.O. Box 45, 94 University
More informationMIT 2.71/2.710 Optics 10/31/05 wk9-a-1. The spatial frequency domain
10/31/05 wk9-a-1 The spatial frequency domain Recall: plane wave propagation x path delay increases linearly with x λ z=0 θ E 0 x exp i2π sinθ + λ z i2π cosθ λ z plane of observation 10/31/05 wk9-a-2 Spatial
More informationVisual Object Recognition
Visual Object Recognition Lecture 2: Image Formation Per-Erik Forssén, docent Computer Vision Laboratory Department of Electrical Engineering Linköping University Lecture 2: Image Formation Pin-hole, and
More informationI Chen Lin, Assistant Professor Dept. of CS, National Chiao Tung University. Computer Vision: 4. Filtering
I Chen Lin, Assistant Professor Dept. of CS, National Chiao Tung University Computer Vision: 4. Filtering Outline Impulse response and convolution. Linear filter and image pyramid. Textbook: David A. Forsyth
More informationECE 468: Digital Image Processing. Lecture 8
ECE 68: Digital Image Processing Lecture 8 Prof. Sinisa Todorovic sinisa@eecs.oregonstate.edu 1 Point Descriptors Point Descriptors Describe image properties in the neighborhood of a keypoint Descriptors
More informationGeometric Image Manipulation
Bruce A. Draper J. Ross Beveridge, January 24, 204 Geometric Image Manipulation Lecture (part a) January 24, 204 Bruce A. Draper J. Ross Beveridge, January 24, 204 Status Update Programming assignment
More informationOn Geometric Error for Homographies
On Geometric Error for Homographies Ondra Chum, Tomás Pajdla, Peter Sturm To cite this version: Ondra Chum, Tomás Pajdla, Peter Sturm. On Geometric Error for Homographies. [Research Report] CTU-CMP-0000-00,
More informationFrequency2: Sampling and Aliasing
CS 4495 Computer Vision Frequency2: Sampling and Aliasing Aaron Bobick School of Interactive Computing Administrivia Project 1 is due tonight. Submit what you have at the deadline. Next problem set stereo
More informationSensors. Chapter Signal Conditioning
Chapter 2 Sensors his chapter, yet to be written, gives an overview of sensor technology with emphasis on how to model sensors. 2. Signal Conditioning Sensors convert physical measurements into data. Invariably,
More informationCONVOLUTION & PRODUCT THEOREMS FOR FRFT CHAPTER INTRODUCTION [45]
CHAPTER 3 CONVOLUTION & PRODUCT THEOREMS FOR FRFT M ANY properties of FRFT were derived, developed or established earlier as described in previous chapter. This includes multiplication property, differentiation
More informationDESIGN OF CMOS ANALOG INTEGRATED CIRCUITS
DESIGN OF CMOS ANALOG INEGRAED CIRCUIS Franco Maloberti Integrated Microsistems Laboratory University of Pavia Discrete ime Signal Processing F. Maloberti: Design of CMOS Analog Integrated Circuits Discrete
More informationReview: Continuous Fourier Transform
Review: Continuous Fourier Transform Review: convolution x t h t = x τ h(t τ)dτ Convolution in time domain Derivation Convolution Property Interchange the order of integrals Let Convolution Property By
More informationLecture 7 Predictive Coding & Quantization
Shujun LI (李树钧): INF-10845-20091 Multimedia Coding Lecture 7 Predictive Coding & Quantization June 3, 2009 Outline Predictive Coding Motion Estimation and Compensation Context-Based Coding Quantization
More informationCSE 473/573 Computer Vision and Image Processing (CVIP)
CSE 473/573 Computer Vision and Image Processing (CVIP) Ifeoma Nwogu inwogu@buffalo.edu Lecture 11 Local Features 1 Schedule Last class We started local features Today More on local features Readings for
More informationNyquist sampling a bandlimited function. Sampling: The connection from CT to DT. Impulse Train sampling. Interpolation: Signal Reconstruction
Sampling: he connection rom C to D Nyquist sampling a bandlimited unction ( Consider as an example sampling the bandlimited signal sinc 2 (5t F 1 5 Λ 5 An ininite number o waveorms could exactly pass through
More informationSpatial-Domain Convolution Filters
Spatial-Domain Filtering 9 Spatial-Domain Convolution Filters Consider a linear space-invariant (LSI) system as shown: The two separate inputs to the LSI system, x 1 (m) and x 2 (m), and their corresponding
More informationThe Fourier Transform
The Fourier Transorm Fourier Series Fourier Transorm The Basic Theorems and Applications Sampling Bracewell, R. The Fourier Transorm and Its Applications, 3rd ed. New York: McGraw-Hill, 2. Eric W. Weisstein.
More informationInvariant Scattering Convolution Networks
Invariant Scattering Convolution Networks Joan Bruna and Stephane Mallat Submitted to PAMI, Feb. 2012 Presented by Bo Chen Other important related papers: [1] S. Mallat, A Theory for Multiresolution Signal
More informationIB Paper 6: Signal and Data Analysis
IB Paper 6: Signal and Data Analysis Handout 5: Sampling Theory S Godsill Signal Processing and Communications Group, Engineering Department, Cambridge, UK Lent 2015 1 / 85 Sampling and Aliasing All of
More information6.869 Advances in Computer Vision. Bill Freeman, Antonio Torralba and Phillip Isola MIT Oct. 3, 2018
6.869 Advances in Computer Vision Bill Freeman, Antonio Torralba and Phillip Isola MIT Oct. 3, 2018 1 Sampling Sampling Pixels Continuous world 3 Sampling 4 Sampling 5 Continuous image f (x, y) Sampling
More informationCfAO Summer School 2007: Astronomical Instrumentation for Adaptive Optics
CfAO Summer School 2007: Astronomical Instrumentation for Adaptive Optics James R. Graham University of California, Berkeley Outline What s special about AO instruments? Spatial information in AO corrected
More informationFourier Sampling. Fourier Sampling. Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2005 Linear Systems Lecture 3.
Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2005 Linear Sstems Lecture 3 Fourier Sampling F Instead of sampling the signal, we sample its Fourier Transform Sample??? F -1 Fourier
More informationMedical Image Analysis
Medical Image Analysis CS 593 / 791 Computer Science and Electrical Engineering Dept. West Virginia University 23rd January 2006 Outline 1 Recap 2 Edge Enhancement 3 Experimental Results 4 The rest of
More information1. Projective geometry
1. Projective geometry Homogeneous representation of points and lines in D space D projective space Points at infinity and the line at infinity Conics and dual conics Projective transformation Hierarchy
More informationFROM ANALOGUE TO DIGITAL
SIGNALS AND SYSTEMS: PAPER 3C1 HANDOUT 7. Dr David Corrigan 1. Electronic and Electrical Engineering Dept. corrigad@tcd.ie www.mee.tcd.ie/ corrigad FROM ANALOGUE TO DIGITAL To digitize signals it is necessary
More informationComputational Photography
Computational Photography Si Lu Spring 208 http://web.cecs.pdx.edu/~lusi/cs50/cs50_computati onal_photography.htm 04/0/208 Last Time o Digital Camera History of Camera Controlling Camera o Photography
More informationTopics. Example. Modulation. [ ] = G(k x. ] = 1 2 G ( k % k x 0) G ( k + k x 0) ] = 1 2 j G ( k x
Topics Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2008 CT/Fourier Lecture 3 Modulation Modulation Transfer Function Convolution/Multiplication Revisit Projection-Slice Theorem Filtered
More informationConvolution Spatial Aliasing Frequency domain filtering fundamentals Applications Image smoothing Image sharpening
Frequency Domain Filtering Correspondence between Spatial and Frequency Filtering Fourier Transform Brief Introduction Sampling Theory 2 D Discrete Fourier Transform Convolution Spatial Aliasing Frequency
More informationf(x)e ikx dx. (19.1) ˆf(k)e ikx dk. (19.2)
9 Fourier transform 9 A first look at the Fourier transform In Math 66 you all studied the Laplace transform, which was used to turn an ordinary differential equation into an algebraic one There are a
More informationImage Recognition Using Modified Zernike Moments
Sensors & Transducers 204 by IFSA Publishing S. L. http://www.sensorsportal.com Image Recognition Using Modified ernike Moments Min HUANG Yaqiong MA and Qiuping GONG School of Computer and Communication
More informationMATHS & STATISTICS OF MEASUREMENT
Imperial College London BSc/MSci EXAMINATION June 2008 This paper is also taken for the relevant Examination for the Associateship MATHS & STATISTICS OF MEASUREMENT For Second-Year Physics Students Tuesday,
More information1-D MATH REVIEW CONTINUOUS 1-D FUNCTIONS. Kronecker delta function and its relatives. x 0 = 0
-D MATH REVIEW CONTINUOUS -D FUNCTIONS Kronecker delta function and its relatives delta function δ ( 0 ) 0 = 0 NOTE: The delta function s amplitude is infinite and its area is. The amplitude is shown as
More informationMultiresolution schemes
Multiresolution schemes Fondamenti di elaborazione del segnale multi-dimensionale Multi-dimensional signal processing Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Elaborazione
More informationIndex. p, lip, 78 8 function, 107 v, 7-8 w, 7-8 i,7-8 sine, 43 Bo,94-96
p, lip, 78 8 function, 107 v, 7-8 w, 7-8 i,7-8 sine, 43 Bo,94-96 B 1,94-96 M,94-96 B oro!' 94-96 BIro!' 94-96 I/r, 79 2D linear system, 56 2D FFT, 119 2D Fourier transform, 1, 12, 18,91 2D sinc, 107, 112
More information