Lecture Outline. Basics of Spatial Filtering Smoothing Spatial Filters. Sharpening Spatial Filters
|
|
- Valerie Robinson
- 5 years ago
- Views:
Transcription
1 1
2 Lecture Outline Basics o Spatial Filtering Smoothing Spatial Filters Averaging ilters Order-Statistics ilters Sharpening Spatial Filters Laplacian ilters High-boost ilters Gradient Masks Combining Spatial Enhancement Methods
3 Spatial Domain Spatial Domain Operations procedures that operate directl on piels g = T[F] where is the input image g is the processed image T is an operator on deined over some neighborhood o 4
4 Mask / Filter Neighborhood o a point can be deined b using a square/rectangular commonl used or circular subimage area centered at mask or ilter The center o the subimage is moved rom piel to piel starting at the top let corner o the image 5
5 Spatial Filtering Use ilter can also be called as mask / kernel / template / window The values o a ilter subimage are reerred to as coeicients rather than piel intensities. Our ocus will be on masks o odd sizes e.g. 3X3 55. Can a ilter be o even size? 6
6 Spatial Filtering Process Simpl move the ilter mask rom point to point in an image At each point the response o the ilter at that point is calculated using a predeined relationship R = w z w z... = 1 mn i= i 1 w z i i w mn z mn Linear Filtering 7
7 Spatial Filtering Approaches Linear Filtering Non-linear Filtering Order-Statistics iltering Morphological iltering Adaptive Filtering 8
8 How Does Linear Filtering Work? 9
9 Linear Filtering Linear Filtering o an image o size MN b ilter b mask o size mn is given b the epression a g = s=a To generate a complete iltered image this equation must be applied or = 1... M-1 and = 1... N-1 Convolution process b t=b where a = m-1/ and b = n-1/ w s t s t 1
10 What Happens at the Borders? The mask alls outside the edge! Solutions? Ignore the edges The resultant image is smaller than the original Pad with zeros Introducing unwanted artiacts What else? 11
11 Smoothing Spatial Filters Use: For blurring images & noise reduction Blurring is used in preprocessing steps such as Removal o small details rom an image prior to object etraction Bridging o small gaps in lines or curves Noise Reduction can be accomplished b blurring with linear or non-linear ilters 1
12 Smoothing Linear Filters Output is simpl the average o the piels contained in the neighborhood o the ilter mask Also reerred to as averaging ilters or lowpass ilters eplained in uture lecture 13
13 Averaging Filter: An Intuitive Approach Replace each piel b the average o piels in a square window surrounding this piel 33 averaging ilter What happens i we use an averaging ilter with a larger window? 14
14 Eample: Appling 33 Averaging Filter Assume edges ignored thus resultant image is 33 15
15 More Eamples Original image size 55 piels Results o smoothing with averaging ilter masks o size n= respectivel order: let to right top to bottom 16
16 Eample: Space Imager 17
17 Smoothing Linear Filters Able to reduce sharp transitions in gra levels Random noise in the image Edges o objects in the image Smoothing can reduce noises desirable and blur edges undesirable 18
18 33 Smoothing Linear Filters bo ilter weighted average 19
19 Weighted Averaging Filter Instead o averaging all the piel values in the window give the closer-b piels higher weighting and ar-awa piels lower weighting Reduce value o coeicients as a unction o increasing distance rom the origin An attempt to reduce blurring in the smoothing process
20 1 General orm: Smoothing Mask Filter o size m n m and n odd = = = = = a a s b b t a a s b b t t s w t s t s w g Summation o all coeicients o the mask
21 Eample: Lena 'Smoothen'
22 Other Common Smoothing Filters Criteria or designing a smoothing ilter ws t unction as averaging a s=a b t=b w st =1 mean value is preserved Another popular smoothing ilter: Gaussian ilter 3
23 Order-Statistics Filters Non-linear ilters Response is based on ordering ranking the piels contained in the image area encompassed b the ilter Eample: Median ilter: Ma ilter: Min ilter: R=median z k k=1...n n R=ma z k k=1...n n R=min z k k=1...n n Note: n n is the size o the mask 4
24 Median Filters Replaces the value o a piel b the median o the gra levels in the speciied neighborhood o that piel Original value o the piel is included in the computation o the median Popularl used or certain tpes o random noise impulse noise salt and pepper noise Ecellent noise-reduction capabilities Less blurring eect that linear smoothing ilters o similar size Intuitivel how do the work? 5
25 Eample: Fighting Salt and Pepper Noise 6
26 Sharpening Spatial Filters Sharpening: to enhance line structures or other details in an image Sharpening Spatial Filters: To highlight ine detail or edges in an image To enhance and ocus on details that has been blurred either in error or as a natural eect o a particular method o image acquisition 7
27 Image Sharpening g = ± c Blur the original image Add the Laplacian 6
28 Blurring vs. Sharpening Blurring can be done in spatial domain b piel averaging in the neighborhood o a piel Since averaging is analogous to integration... Can we conclude that sharpening is accomplished b spatial dierentiation? 8
29 Derivative Operator The strength o the response o a derivative operator is proportional to the degree o discontinuit o the image at the point at which the operator is applied Image dierentiation Enhances edges and other discontinuities such as noise De-emphasizes area with slowl varing gra-level values 9
30 First-order Derivative A basic deinition o the irst-order derivative o a one-dimensional unction is the dierence = 1 3
31 Second-order Derivative Similarl the second-order derivative o a onedimensional unction is the dierence =
32 3 First & Second Derivatives o Consider an image unction o two variables we are dealing with partial derivatives along the two spatial aes. = = = Laplacian operator Gradient operator
33 33 Discrete orm o Laplacian From ield 1 1 = 1 1 = ] [ =
34 Laplacian Mask The Laplacian mask contains the coeicients o the Laplacian operator second-order derivatives 34
35 Laplacian Mask witih Diagonal Terms This Laplacian mask is implemented dierentl b incorporating the diagonal directions. The center value is now -8 due to the total subtracted rom the dierence terms. 35
36 Other Implementations o Laplacian Masks These masks dierence in sign give the same result as the previous two masks. The dierence in sign must be kept in mind when combining add / subtract a Laplacian-iltered image with another image 36
37 Eect o Laplacian Operator Tends to produce images that have Graish edge lines and other discontinuities in brighter intensities all superimposed on a dark eatureless background To correct the eect o eatureless background Add the original and Laplacian-iltered image together Be careul with the Laplacian ilter used g = i the center coeicient o the Laplacian mask is negative i the center coeicient o the Laplacian mask is positive 37
38 Eample: Moon Images Image o the moon Laplacian-iltered image with Laplacian image scaled or displa purposes Image enhanced sharpened b adding Laplacian-iltered image to the original image Note: let to right top to bottom 38
39 39 Simpliications To simpli the computation we can create a mask which do both operations Laplacian ilter and Addition o original image Composite Laplacian Mask 1] [ 5 4 1] [ = = g
40 Composite Laplacian Mask 4
41 Composite Laplacian Mask Which composite mask normal Laplacian / Laplacian with diagonal terms can produce better image sharpening?
42 4 Composite Laplacian Mask = g = =
43 Unsharp Masking A process used man ears in the publishing industr to sharpen images Sharpened image: Subtracting a blurred version o an image rom the image itsel s = sharpened image = original image blurred image 43
44 Unsharp Masking Can ou make sense o unsharp masking? 44
45 45 High-Boost Filtering High-boost Filtering: A urther generalization o unsharp masking A hb = 1 1 A A s hb = = A 1 where
46 High-Boost Filtering This general equation does not state eplicitl how the sharp image is obtained... I we choose to use Laplacian operator to sharpen the image we get hb = A 1 hb A = A s i the center coeicient o the Laplacian mask is negative i the center coeicient o the Laplacian mask is positive 46
47 High-Boost Filtering A 1 I A = 1 it becomes a standard Laplacian sharpening 47
48 Eample: High-Boost Filtering 48
49 Eample: Lena 'Sharpened' 49
50 5 First Derivatives: Gradient Operator First derivatives are implemented using the magnitude o the gradient = = G G 1 1 ] [ = = = G G mag The magnitude becomes nonlinear G G Approimation:
51
52 Gradient Mask On the basis o a irst-order derivative o a -D unction the simplest approimation o the gradient mask: G = = z8 z5 and G = z6 z5 1 [ G G ] = [ z8 z5 z6 z5 z 8 z5 z6 z5 ] 1 z 1 z z 3 z 4 z 5 z 6 z 7 z 8 z 9 51
53 Gradient Mask Roberts cross-gradient operators [1965] G = z9 z5 and G = z8 z6 z 1 z z = [ G G ] = [ z9 z5 z8 z6 ] z 4 z 5 z 6 z z 7 z 8 z 9 9 z5 z8 z6 5
54 Sobel operators 33 Gradient Mask G G = = z z 7 3 z z 8 6 G G z z 9 9 z z 1 1 z z 4 z z 3 7 z 1 z z 3 z 4 z 5 z 6 z 7 z 8 z 9 The weight value is to achieve smoothing b giving more important to the center point 53
55 Eample: Gradient Filtering More on gradient masks will be covered under Edge Detection Image Segmentation 54
56 Gradient Mask The summation o coeicients in gradient masks equals indicating that the would give a response o in an area o constant gra level 55
57 Figure out! The summation o coeicients in a mask equals or both gradient operators 1 st derivative and Laplacian operators nd derivative The summation o coeicients in a smoothing mask equals 1 Wh??? 56
58 Separable Filters In D iltering some ilters can be implemented b successive application o two simpler ilters One horizontal ollowed b another vertical This can signiicantl lower the computational compleit B how much? For a mask o size n n Originall n multiplications and n 1 additions Ater separation n multiplications and n additions 57
59 Values Outside the Range? Linear iltering might bring the intensit outside the displa range Solutions? Clip values = 55 Scaling transormation g L = 55 g g H L i < i 55 i > 55 Transorm values in [g L g H ] to [ 55] 58
60 Eample: Combining Spatial Enhancement Methods Target: To sharpen the original image and bring out more skeletal detail Problems: Narrow dnamic range o gra level High noise content makes image diicult to enhance 59
61 Eample: Combining Spatial Enhancement Methods Solution: I. Laplacian to highlight ine details II.Gradient to enhance prominent edges III.Gra level transormation to increase the dnamic range o gra levels 6
62 Eample: Combining Spatial Enhancement Methods 61
63 Eample: Combining Spatial Enhancement Methods 6
Digital Image Processing. Lecture 6 (Enhancement) Bu-Ali Sina University Computer Engineering Dep. Fall 2009
Digital Image Processing Lecture 6 (Enhancement) Bu-Ali Sina University Computer Engineering Dep. Fall 009 Outline Image Enhancement in Spatial Domain Spatial Filtering Smoothing Filters Median Filter
More informationChapter 3: Image Enhancement in the. Office room : 841
Chapter 3: Image Enhancement in the Spatial Domain Lecturer: Jianbing Shen Email : shenjianbing@bit.edu.cn Oice room : 841 http://cs.bit.edu.cn/shenjianbing cn/shenjianbing Principle Objective o Enhancement
More informationEnhancement Using Local Histogram
Enhancement Using Local Histogram Used to enhance details over small portions o the image. Deine a square or rectangular neighborhood hose center moves rom piel to piel. Compute local histogram based on
More informationEDGES AND CONTOURS(1)
KOM31 Image Processing in Industrial Sstems Dr Muharrem Mercimek 1 EDGES AND CONTOURS1) KOM31 Image Processing in Industrial Sstems Some o the contents are adopted rom R. C. Gonzalez, R. E. Woods, Digital
More informationImage Enhancement (Spatial Filtering 2)
Image Enhancement (Spatial Filtering ) Dr. Samir H. Abdul-Jauwad Electrical Engineering Department College o Engineering Sciences King Fahd University o Petroleum & Minerals Dhahran Saudi Arabia samara@kupm.edu.sa
More informationReview Smoothing Spatial Filters Sharpening Spatial Filters. Spatial Filtering. Dr. Praveen Sankaran. Department of ECE NIT Calicut.
Spatial Filtering Dr. Praveen Sankaran Department of ECE NIT Calicut January 7, 203 Outline 2 Linear Nonlinear 3 Spatial Domain Refers to the image plane itself. Direct manipulation of image pixels. Figure:
More informationComputer Vision & Digital Image Processing
Computer Vision & Digital Image Processing Image Segmentation Dr. D. J. Jackson Lecture 6- Image segmentation Segmentation divides an image into its constituent parts or objects Level of subdivision depends
More informationCAP 5415 Computer Vision Fall 2011
CAP 545 Computer Vision Fall 2 Dr. Mubarak Sa Univ. o Central Florida www.cs.uc.edu/~vision/courses/cap545/all22 Oice 247-F HEC Filtering Lecture-2 General Binary Gray Scale Color Binary Images Y Row X
More informationCAP 5415 Computer Vision
CAP 545 Computer Vision Dr. Mubarak Sa Univ. o Central Florida Filtering Lecture-2 Contents Filtering/Smooting/Removing Noise Convolution/Correlation Image Derivatives Histogram Some Matlab Functions General
More informationQuadratic Functions. The graph of the function shifts right 3. The graph of the function shifts left 3.
Quadratic Functions The translation o a unction is simpl the shiting o a unction. In this section, or the most part, we will be graphing various unctions b means o shiting the parent unction. We will go
More information. This is the Basic Chain Rule. x dt y dt z dt Chain Rule in this context.
Math 18.0A Gradients, Chain Rule, Implicit Dierentiation, igher Order Derivatives These notes ocus on our things: (a) the application o gradients to ind normal vectors to curves suraces; (b) the generaliation
More informationECE Digital Image Processing and Introduction to Computer Vision. Outline
2/9/7 ECE592-064 Digital Image Processing and Introduction to Computer Vision Depart. of ECE, NC State University Instructor: Tianfu (Matt) Wu Spring 207. Recap Outline 2. Sharpening Filtering Illustration
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 information9.1 The Square Root Function
Section 9.1 The Square Root Function 869 9.1 The Square Root Function In this section we turn our attention to the square root unction, the unction deined b the equation () =. (1) We begin the section
More informationImage Enhancement: Methods. Digital Image Processing. No Explicit definition. Spatial Domain: Frequency Domain:
Image Enhancement: No Explicit definition Methods Spatial Domain: Linear Nonlinear Frequency Domain: Linear Nonlinear 1 Spatial Domain Process,, g x y T f x y 2 For 1 1 neighborhood: Contrast Enhancement/Stretching/Point
More information3. Several Random Variables
. Several Random Variables. Two Random Variables. Conditional Probabilit--Revisited. Statistical Independence.4 Correlation between Random Variables. Densit unction o the Sum o Two Random Variables. Probabilit
More informationObjectives. By the time the student is finished with this section of the workbook, he/she should be able
FUNCTIONS Quadratic Functions......8 Absolute Value Functions.....48 Translations o Functions..57 Radical Functions...61 Eponential Functions...7 Logarithmic Functions......8 Cubic Functions......91 Piece-Wise
More informationExample: When describing where a function is increasing, decreasing or constant we use the x- axis values.
Business Calculus Lecture Notes (also Calculus With Applications or Business Math II) Chapter 3 Applications o Derivatives 31 Increasing and Decreasing Functions Inormal Deinition: A unction is increasing
More informationDigital Image Processing COSC 6380/4393
Digital Image Processing COSC 6380/4393 Lecture 11 Oct 3 rd, 2017 Pranav Mantini Slides from Dr. Shishir K Shah, and Frank Liu Review: 2D Discrete Fourier Transform If I is an image of size N then Sin
More informationMidterm Summary Fall 08. Yao Wang Polytechnic University, Brooklyn, NY 11201
Midterm Summary Fall 8 Yao Wang Polytechnic University, Brooklyn, NY 2 Components in Digital Image Processing Output are images Input Image Color Color image image processing Image Image restoration Image
More informationLocal enhancement. Local Enhancement. Local histogram equalized. Histogram equalized. Local Contrast Enhancement. Fig 3.23: Another example
Local enhancement Local Enhancement Median filtering Local Enhancement Sometimes Local Enhancement is Preferred. Malab: BlkProc operation for block processing. Left: original tire image. 0/07/00 Local
More informationNew Functions from Old Functions
.3 New Functions rom Old Functions In this section we start with the basic unctions we discussed in Section. and obtain new unctions b shiting, stretching, and relecting their graphs. We also show how
More informationDigital Image Processing COSC 6380/4393
Digital Image Processing COSC 6380/4393 Lecture 13 Oct 2 nd, 2018 Pranav Mantini Slides from Dr. Shishir K Shah, and Frank Liu Review f 0 0 0 1 0 0 0 0 w 1 2 3 2 8 Zero Padding 0 0 0 0 0 0 0 1 0 0 0 0
More informationComputed Tomography Notes, Part 1. The equation that governs the image intensity in projection imaging is:
Noll 3 CT Notes : Page Compute Tomograph Notes Part Challenges with Projection X-ra Sstems The equation that governs the image intensit in projection imaging is: z I I ep µ z Projection -ra sstems are
More informationIncreasing and Decreasing Functions and the First Derivative Test. Increasing and Decreasing Functions. Video
SECTION and Decreasing Functions and the First Derivative Test 79 Section and Decreasing Functions and the First Derivative Test Determine intervals on which a unction is increasing or decreasing Appl
More information9.3 Graphing Functions by Plotting Points, The Domain and Range of Functions
9. Graphing Functions by Plotting Points, The Domain and Range o Functions Now that we have a basic idea o what unctions are and how to deal with them, we would like to start talking about the graph o
More information3.8 Combining Spatial Enhancement Methods 137
3.8 Combining Spatial Enhancement Methods 137 a b FIGURE 3.45 Optical image of contact lens (note defects on the boundary at 4 and 5 o clock). (b) Sobel gradient. (Original image courtesy of Mr. Pete Sites,
More informationFiltering and Edge Detection
Filtering and Edge Detection Local Neighborhoods Hard to tell anything from a single pixel Example: you see a reddish pixel. Is this the object s color? Illumination? Noise? The next step in order of complexity
More informationDepartment of Physics and Astronomy 2 nd Year Laboratory. L2 Light Scattering
nd ear laborator script L Light Scattering Department o Phsics and Astronom nd Year Laborator L Light Scattering Scientiic aims and objectives To determine the densit o nano-spheres o polstrene suspended
More informationEdge Detection. Introduction to Computer Vision. Useful Mathematics Funcs. The bad news
Edge Detection Introduction to Computer Vision CS / ECE 8B Thursday, April, 004 Edge detection (HO #5) Edge detection is a local area operator that seeks to find significant, meaningful changes in image
More informationy2 = 0. Show that u = e2xsin(2y) satisfies Laplace's equation.
Review 1 1) State the largest possible domain o deinition or the unction (, ) = 3 - ) Determine the largest set o points in the -plane on which (, ) = sin-1( - ) deines a continuous unction 3) Find the
More informationy,z the subscript y, z indicating that the variables y and z are kept constant. The second partial differential with respect to x is written x 2 y,z
8 Partial dierentials I a unction depends on more than one variable, its rate o change with respect to one o the variables can be determined keeping the others ied The dierential is then a partial dierential
More informationProbabilistic Model of Error in Fixed-Point Arithmetic Gaussian Pyramid
Probabilistic Model o Error in Fixed-Point Arithmetic Gaussian Pyramid Antoine Méler John A. Ruiz-Hernandez James L. Crowley INRIA Grenoble - Rhône-Alpes 655 avenue de l Europe 38 334 Saint Ismier Cedex
More informationImage Enhancement in the frequency domain. GZ Chapter 4
Image Enhancement in the frequency domain GZ Chapter 4 Contents In this lecture we will look at image enhancement in the frequency domain The Fourier series & the Fourier transform Image Processing in
More informationColorado School of Mines Image and Multidimensional Signal Processing
Image and Multidimensional Signal Processing Professor William Hoff Department of Electrical Engineering and Computer Science Spatial Filtering Main idea Spatial filtering Define a neighborhood of a pixel
More informationChapter 4 Image Enhancement in the Frequency Domain
Chapter 4 Image Enhancement in the Frequency Domain Yinghua He School of Computer Science and Technology Tianjin University Background Introduction to the Fourier Transform and the Frequency Domain Smoothing
More informationInverse of a Function
. Inverse o a Function Essential Question How can ou sketch the graph o the inverse o a unction? Graphing Functions and Their Inverses CONSTRUCTING VIABLE ARGUMENTS To be proicient in math, ou need to
More informationHistogram Processing
Histogram Processing The histogram of a digital image with gray levels in the range [0,L-] is a discrete function h ( r k ) = n k where r k n k = k th gray level = number of pixels in the image having
More informationMachine vision. Summary # 4. The mask for Laplacian is given
1 Machine vision Summary # 4 The mask for Laplacian is given L = 0 1 0 1 4 1 (6) 0 1 0 Another Laplacian mask that gives more importance to the center element is L = 1 1 1 1 8 1 (7) 1 1 1 Note that the
More informationLab on Taylor Polynomials. This Lab is accompanied by an Answer Sheet that you are to complete and turn in to your instructor.
Lab on Taylor Polynomials This Lab is accompanied by an Answer Sheet that you are to complete and turn in to your instructor. In this Lab we will approimate complicated unctions by simple unctions. The
More informationLocal Enhancement. Local enhancement
Local Enhancement Local Enhancement Median filtering (see notes/slides, 3.5.2) HW4 due next Wednesday Required Reading: Sections 3.3, 3.4, 3.5, 3.6, 3.7 Local Enhancement 1 Local enhancement Sometimes
More informationLecture 7: Edge Detection
#1 Lecture 7: Edge Detection Saad J Bedros sbedros@umn.edu Review From Last Lecture Definition of an Edge First Order Derivative Approximation as Edge Detector #2 This Lecture Examples of Edge Detection
More informationThis is only a list of questions use a separate sheet to work out the problems. 1. (1.2 and 1.4) Use the given graph to answer each question.
Mth Calculus Practice Eam Questions NOTE: These questions should not be taken as a complete list o possible problems. The are merel intended to be eamples o the diicult level o the regular eam questions.
More informationMachine vision, spring 2018 Summary 4
Machine vision Summary # 4 The mask for Laplacian is given L = 4 (6) Another Laplacian mask that gives more importance to the center element is given by L = 8 (7) Note that the sum of the elements in the
More information(One Dimension) Problem: for a function f(x), find x 0 such that f(x 0 ) = 0. f(x)
Solving Nonlinear Equations & Optimization One Dimension Problem: or a unction, ind 0 such that 0 = 0. 0 One Root: The Bisection Method This one s guaranteed to converge at least to a singularity, i not
More informationLecture 04 Image Filtering
Institute of Informatics Institute of Neuroinformatics Lecture 04 Image Filtering Davide Scaramuzza 1 Lab Exercise 2 - Today afternoon Room ETH HG E 1.1 from 13:15 to 15:00 Work description: your first
More informationIMAGE ENHANCEMENT II (CONVOLUTION)
MOTIVATION Recorded images often exhibit problems such as: blurry noisy Image enhancement aims to improve visual quality Cosmetic processing Usually empirical techniques, with ad hoc parameters ( whatever
More informationEdge Detection. Image Processing - Computer Vision
Image Processing - Lesson 10 Edge Detection Image Processing - Computer Vision Low Level Edge detection masks Gradient Detectors Compass Detectors Second Derivative - Laplace detectors Edge Linking Image
More informationMathematical Preliminaries. Developed for the Members of Azera Global By: Joseph D. Fournier B.Sc.E.E., M.Sc.E.E.
Mathematical Preliminaries Developed or the Members o Azera Global B: Joseph D. Fournier B.Sc.E.E., M.Sc.E.E. Outline Chapter One, Sets: Slides: 3-27 Chapter Two, Introduction to unctions: Slides: 28-36
More information18-660: Numerical Methods for Engineering Design and Optimization
8-66: Numerical Methods or Engineering Design and Optimization Xin Li Department o ECE Carnegie Mellon University Pittsburgh, PA 53 Slide Overview Linear Regression Ordinary least-squares regression Minima
More informationSaturday X-tra X-Sheet: 8. Inverses and Functions
Saturda X-tra X-Sheet: 8 Inverses and Functions Ke Concepts In this session we will ocus on summarising what ou need to know about: How to ind an inverse. How to sketch the inverse o a graph. How to restrict
More informationTangent Line Approximations
60_009.qd //0 :8 PM Page SECTION.9 Dierentials Section.9 EXPLORATION Tangent Line Approimation Use a graphing utilit to graph. In the same viewing window, graph the tangent line to the graph o at the point,.
More informationPerception III: Filtering, Edges, and Point-features
Perception : Filtering, Edges, and Point-features Davide Scaramuzza Universit of Zurich Margarita Chli, Paul Furgale, Marco Hutter, Roland Siegwart 1 Toda s outline mage filtering Smoothing Edge detection
More informationELEG 3143 Probability & Stochastic Process Ch. 4 Multiple Random Variables
Department o Electrical Engineering University o Arkansas ELEG 3143 Probability & Stochastic Process Ch. 4 Multiple Random Variables Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Two discrete random variables
More informationSyllabus Objective: 2.9 The student will sketch the graph of a polynomial, radical, or rational function.
Precalculus Notes: Unit Polynomial Functions Syllabus Objective:.9 The student will sketch the graph o a polynomial, radical, or rational unction. Polynomial Function: a unction that can be written in
More informationMath Review and Lessons in Calculus
Math Review and Lessons in Calculus Agenda Rules o Eponents Functions Inverses Limits Calculus Rules o Eponents 0 Zero Eponent Rule a * b ab Product Rule * 3 5 a / b a-b Quotient Rule 5 / 3 -a / a Negative
More informationLeast-Squares Spectral Analysis Theory Summary
Least-Squares Spectral Analysis Theory Summary Reerence: Mtamakaya, J. D. (2012). Assessment o Atmospheric Pressure Loading on the International GNSS REPRO1 Solutions Periodic Signatures. Ph.D. dissertation,
More information( x) f = where P and Q are polynomials.
9.8 Graphing Rational Functions Lets begin with a deinition. Deinition: Rational Function A rational unction is a unction o the orm ( ) ( ) ( ) P where P and Q are polynomials. Q An eample o a simple rational
More informationComputed Tomography Notes, Part 1. The equation that governs the image intensity in projection imaging is:
Noll 6 CT Notes : Page Compute Tomograph Notes Part Challenges with Projection X-ra Sstems The equation that governs the image intensit in projection imaging is: z I I ep μ z Projection -ra sstems are
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 information8.4 Inverse Functions
Section 8. Inverse Functions 803 8. Inverse Functions As we saw in the last section, in order to solve application problems involving eponential unctions, we will need to be able to solve eponential equations
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 informationWind-Driven Circulation: Stommel s gyre & Sverdrup s balance
Wind-Driven Circulation: Stommel s gyre & Sverdrup s balance We begin by returning to our system o equations or low o a layer o uniorm density on a rotating earth. du dv h + [ u( H + h)] + [ v( H t y d
More informationThe concept of limit
Roberto s Notes on Dierential Calculus Chapter 1: Limits and continuity Section 1 The concept o limit What you need to know already: All basic concepts about unctions. What you can learn here: What limits
More informationA NOVEL METHOD OF INTERPOLATION AND EXTRAPOLATION OF FUNCTIONS BY A LINEAR INITIAL VALUE PROBLEM
A OVEL METHOD OF ITERPOLATIO AD EXTRAPOLATIO OF FUCTIOS BY A LIEAR IITIAL VALUE PROBLEM Michael Shatalov Sensor Science and Technolog o CSIR Manuacturing and Materials, P.O.Bo 395, Pretoria, CSIR and Department
More informationCEE598 - Visual Sensing for Civil Infrastructure Eng. & Mgmt.
CEE598 - Visual Sensing for Civil nfrastructure Eng. & Mgmt. Session 9- mage Detectors, Part Mani Golparvar-Fard Department of Civil and Environmental Engineering 3129D, Newmark Civil Engineering Lab e-mail:
More informationChapter 4 Imaging. Lecture 21. d (110) Chem 793, Fall 2011, L. Ma
Chapter 4 Imaging Lecture 21 d (110) Imaging Imaging in the TEM Diraction Contrast in TEM Image HRTEM (High Resolution Transmission Electron Microscopy) Imaging or phase contrast imaging STEM imaging a
More information0,0 B 5,0 C 0, 4 3,5. y x. Recitation Worksheet 1A. 1. Plot these points in the xy plane: A
Math 13 Recitation Worksheet 1A 1 Plot these points in the y plane: A 0,0 B 5,0 C 0, 4 D 3,5 Without using a calculator, sketch a graph o each o these in the y plane: A y B 3 Consider the unction a Evaluate
More informationSpatial Enhancement Region operations: k'(x,y) = F( k(x-m, y-n), k(x,y), k(x+m,y+n) ]
CEE 615: Digital Image Processing Spatial Enhancements 1 Spatial Enhancement Region operations: k'(x,y) = F( k(x-m, y-n), k(x,y), k(x+m,y+n) ] Template (Windowing) Operations Template (window, box, kernel)
More informationIntensity Transformations and Spatial Filtering: WHICH ONE LOOKS BETTER? Intensity Transformations and Spatial Filtering: WHICH ONE LOOKS BETTER?
: WHICH ONE LOOKS BETTER? 3.1 : WHICH ONE LOOKS BETTER? 3.2 1 Goal: Image enhancement seeks to improve the visual appearance of an image, or convert it to a form suited for analysis by a human or a machine.
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 informationRATIONAL FUNCTIONS. Finding Asymptotes..347 The Domain Finding Intercepts Graphing Rational Functions
RATIONAL FUNCTIONS Finding Asymptotes..347 The Domain....350 Finding Intercepts.....35 Graphing Rational Functions... 35 345 Objectives The ollowing is a list o objectives or this section o the workbook.
More informationRolle s Theorem and the Mean Value Theorem. Rolle s Theorem
0_00qd //0 0:50 AM Page 7 7 CHAPTER Applications o Dierentiation Section ROLLE S THEOREM French mathematician Michel Rolle irst published the theorem that bears his name in 9 Beore this time, however,
More informationComputational Methods for Domains with! Complex Boundaries-I!
http://www.nd.edu/~gtrggva/cfd-course/ Computational Methods or Domains with Comple Boundaries-I Grétar Trggvason Spring For most engineering problems it is necessar to deal with comple geometries, consisting
More information18/10/2017. Image Enhancement in the Spatial Domain: Gray-level transforms. Image Enhancement in the Spatial Domain: Gray-level transforms
Gray-level transforms Gray-level transforms Generic, possibly nonlinear, pointwise operator (intensity mapping, gray-level transformation): Basic gray-level transformations: Negative: s L 1 r Generic log:
More informationEstimation of the Vehicle Sideslip Angle by Means of the State Dependent Riccati Equation Technique
Proceedings o the World Congress on Engineering 7 Vol II WCE 7, Jul 5-7, 7, London, U.K. Estimation o the Vehicle Sideslip Angle b Means o the State Dependent Riccati Equation Technique S. Strano, M. Terzo
More informationMODULE 6 LECTURE NOTES 1 REVIEW OF PROBABILITY THEORY. Most water resources decision problems face the risk of uncertainty mainly because of the
MODULE 6 LECTURE NOTES REVIEW OF PROBABILITY THEORY INTRODUCTION Most water resources decision problems ace the risk o uncertainty mainly because o the randomness o the variables that inluence the perormance
More informationCHAPTER 8 ANALYSIS OF AVERAGE SQUARED DIFFERENCE SURFACES
CAPTER 8 ANALYSS O AVERAGE SQUARED DERENCE SURACES n Chapters 5, 6, and 7, the Spectral it algorithm was used to estimate both scatterer size and total attenuation rom the backscattered waveorms by minimizing
More information( 1) ( 2) ( 1) nan integer, since the potential is no longer simple harmonic.
. Anharmonic Oscillators Michael Fowler Landau (para 8) considers a simple harmonic oscillator with added small potential energy terms mα + mβ. We ll simpliy slightly by dropping the term, to give an equation
More informationShai Avidan Tel Aviv University
Image Editing in the Gradient Domain Shai Avidan Tel Aviv Universit Slide Credits (partial list) Rick Szeliski Steve Seitz Alosha Eros Yacov Hel-Or Marc Levo Bill Freeman Fredo Durand Slvain Paris Image
More informationBasic properties of limits
Roberto s Notes on Dierential Calculus Chapter : Limits and continuity Section Basic properties o its What you need to know already: The basic concepts, notation and terminology related to its. What you
More informationAsymptote. 2 Problems 2 Methods
Asymptote Problems Methods Problems Assume we have the ollowing transer unction which has a zero at =, a pole at = and a pole at =. We are going to look at two problems: problem is where >> and problem
More informationFunctions. Essential Question What are some of the characteristics of the graph of a logarithmic function?
5. Logarithms and Logarithmic Functions Essential Question What are some o the characteristics o the graph o a logarithmic unction? Ever eponential unction o the orm () = b, where b is a positive real
More informationAnalog Computing Technique
Analog Computing Technique by obert Paz Chapter Programming Principles and Techniques. Analog Computers and Simulation An analog computer can be used to solve various types o problems. It solves them in
More informationENSC327 Communications Systems 2: Fourier Representations. School of Engineering Science Simon Fraser University
ENSC37 Communications Systems : Fourier Representations School o Engineering Science Simon Fraser University Outline Chap..5: Signal Classiications Fourier Transorm Dirac Delta Function Unit Impulse Fourier
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 information4. References. words, the pseudo Laplacian is given by max {! 2 x,! 2 y}.
words, the pseudo Laplacian is given by ma {! 2,! 2 y}. 4. References [Ar72] Arbib, M.A., The Metaphorical Brain, John Wiley, New York, 1972. [BB82] Ballard, D. H. and Brown, C. M., Computer Vision, Prentice-Hall,
More informationFeedback Linearization
Feedback Linearization Peter Al Hokayem and Eduardo Gallestey May 14, 2015 1 Introduction Consider a class o single-input-single-output (SISO) nonlinear systems o the orm ẋ = (x) + g(x)u (1) y = h(x) (2)
More informationComputer Vision Lecture 3
Computer Vision Lecture 3 Linear Filters 03.11.2015 Bastian Leibe RWTH Aachen http://www.vision.rwth-aachen.de leibe@vision.rwth-aachen.de Demo Haribo Classification Code available on the class website...
More informationPart I: Thin Converging Lens
Laboratory 1 PHY431 Fall 011 Part I: Thin Converging Lens This eperiment is a classic eercise in geometric optics. The goal is to measure the radius o curvature and ocal length o a single converging lens
More informationOptical Flow, KLT Feature Tracker.
Optical Flow, KL Feature racker E-mail: hogijung@hanang.ac.kr Motion in Computer Vision Motion Structure rom motion Detection/segmentation with direction [1] E-mail: hogijung@hanang.ac.kr Motion Field.s..
More informationChapter 4 Image Enhancement in the Frequency Domain
Chapter 4 Image Enhancement in the Frequency Domain 3. Fourier transorm -D Let be a unction o real variable,the ourier transorm o is F { } F u ep jπu d j F { F u } F u ep[ jπ u ] du F u R u + ji u or F
More informationImage Gradients and Gradient Filtering Computer Vision
Image Gradients and Gradient Filtering 16-385 Computer Vision What is an image edge? Recall that an image is a 2D function f(x) edge edge How would you detect an edge? What kinds of filter would you use?
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 informationDifferentiation. The main problem of differential calculus deals with finding the slope of the tangent line at a point on a curve.
Dierentiation The main problem o dierential calculus deals with inding the slope o the tangent line at a point on a curve. deinition() : The slope o a curve at a point p is the slope, i it eists, o the
More informationDigital Image Processing. Filtering in the Frequency Domain
2D Linear Systems 2D Fourier Transform and its Properties The Basics of Filtering in Frequency Domain Image Smoothing Image Sharpening Selective Filtering Implementation Tips 1 General Definition: System
More informationBANDELET IMAGE APPROXIMATION AND COMPRESSION
BANDELET IMAGE APPOXIMATION AND COMPESSION E. LE PENNEC AND S. MALLAT Abstract. Finding eicient geometric representations o images is a central issue to improve image compression and noise removal algorithms.
More informationMat 267 Engineering Calculus III Updated on 9/19/2010
Chapter 11 Partial Derivatives Section 11.1 Functions o Several Variables Deinition: A unction o two variables is a rule that assigns to each ordered pair o real numbers (, ) in a set D a unique real number
More informationImage Segmentation: Definition Importance. Digital Image Processing, 2nd ed. Chapter 10 Image Segmentation.
: Definition Importance Detection of Discontinuities: 9 R = wi z i= 1 i Point Detection: 1. A Mask 2. Thresholding R T Line Detection: A Suitable Mask in desired direction Thresholding Line i : R R, j
More informationAnnouncements. Filtering. Image Filtering. Linear Filters. Example: Smoothing by Averaging. Homework 2 is due Apr 26, 11:59 PM Reading:
Announcements Filtering Homework 2 is due Apr 26, :59 PM eading: Chapter 4: Linear Filters CSE 52 Lecture 6 mage Filtering nput Output Filter (From Bill Freeman) Example: Smoothing by Averaging Linear
More information