Digital Image Processing. Lecture 6 (Enhancement) Bu-Ali Sina University Computer Engineering Dep. Fall 2009
|
|
- Catherine Bradley
- 5 years ago
- Views:
Transcription
1 Digital Image Processing Lecture 6 (Enhancement) Bu-Ali Sina University Computer Engineering Dep. Fall 009
2 Outline Image Enhancement in Spatial Domain Spatial Filtering Smoothing Filters Median Filter Sharpening High Boost ilter Derivative ilter
3 Spatial Filtering Image enhancement in the spatial domain can be represented as: The transormation T maybe linear or nonlinear. We will mainly study linear operators T but will see one important nonlinear operation. How to speciy T I the operator T is linear and shit invariant (LSI), characterized by the point-spread sequence (PSS) h(m, n), then (recall convolution):
4 Spatial Filtering Origin x a b c r s t d e * u v w g h i x y z Simple 3*3 eighbourhood y Image (x, y) e 3*3 Filter Original Image Pixels Filter e processed = v*e + r*a + s*b + t*c + u*d + w* + x*g + y*h + z*i The above is repeated or every pixel in the original image to generate the smoothed image
5 Chapter 3: Image Enhancement (Spatial Filtering) Spatial Filtering I h(m, n) is a 3 by 3 mask given by :
6 Chapter 3: Image Enhancement (Spatial Filtering) Spatial Filtering- Smoothing Filters o Image smoothing reers to any image-to-image transormation designed to smooth or latten the image by reducing the rapid pixel-to-pixel variation in grayvalues. o Smoothing ilters are used or: o Blurring: This is usually a preprocessing step or removing small (unwanted) details beore extracting the relevant (large) object, bridging gaps in lines/curves, o oise reduction: Mitigate the eect o noise by linear or nonlinear operations. o Image smoothing by averaging (lowpass spatial iltering) o Smoothing is accomplished by applying an averaging mask. o An averaging mask is a mask with positive weights, which sum to 1. It computes a weighted average o the pixel values in a neighborhood. This operation is sometimes called neighborhood averaging.
7 Chapter 3: Image Enhancement (Spatial Filtering) Spatial Filtering- Smoothing Filters Some 3 x 3 averaging masks:
8 Chapter 3: Image Enhancement (Spatial Filtering) Spatial Filtering- Smoothing Filters This operation is equivalent to lowpass iltering. Example o Image Blurring
9 Chapter 3: Image Enhancement (Spatial Filtering) Spatial Filtering- Smoothing Filters
10 Chapter 3: Image Enhancement (Spatial Filtering) Spatial Filtering- Smoothing Filters Example o noise reduction :
11 Chapter 3: Image Enhancement (Spatial Filtering) Spatial Filtering- Median Filter The averaging ilter is best suited or noise whose distribution is Gaussian: The averaging ilter typically blurs edges and sharp details. The median ilter usually does a better job o preserving edges. Median ilter is particularly suited i the noise pattern exhibits strong (positive and negative) spikes. Example: salt and pepper noise. Median ilter is a nonlinear ilter, that also uses a mask. Each pixel is replaced by the median o the pixel values in a neighborhood o the given pixel. Suppose are the pixel values in a neighborhood o a given pixel with Then : Note: Median o a set o values is the center value, ater sorting. For example: I A = {0,1,,4,6,6,10,1,15}, then median(a) = 6.
12 Spatial Filtering- Median Filter
13 Chapter 3: Image Enhancement (Spatial Filtering) Spatial Filtering- Median Filter Example o noise reduction :
14 Chapter 3: Image Enhancement (Spatial Filtering) Spatial Filtering- Median Filter
15 Chapter 3: Image Enhancement (Spatial Filtering) Spatial Filtering- Median Filter
16 Spatial Filtering- Sharpening Filter To highlight ine detail or to enhance blurred detail. smoothing ~ integration sharpening ~ dierentiation Categories o sharpening ilters: Derivative operators Basic highpass spatial iltering High-boost iltering
17 Spatial Dierentiation Dierentiation measures the rate o change o a unction Let s consider a simple 1 dimensional example
18 Spatial Dierentiation A B
19 1 st Derivative The ormula or the 1 st derivative o a unction is as ollows: x = ( x + 1) ( x) It s just the dierence between subsequent values and measures the rate o change o the unction
20 1 st Derivative
21 nd Derivative The ormula or the nd derivative o a unction is as ollows: x = ( x + 1) + ( x ( x) Simply takes into account the values both beore and ater the current value 1)
22 nd Derivative
23 Using Second Derivatives For Image Enhancement The nd derivative is more useul or image enhancement than the 1 st derivative Stronger response to ine detail Simpler implementation We will come back to the 1 st order derivative later on The irst sharpening ilter we will look at is the Laplacian One o the simplest sharpening ilters We will look at a digital implementation
24 The Laplacian The Laplacian is deined as ollows: where the partial 1 st order derivative in the x direction is deined as ollows: and in the y direction as ollows: y x + = ), ( ) 1, ( ) 1, ( y x y x y x x + + = ), ( 1), ( 1), ( y x y x y x y + + =
25 The Laplacian So, the Laplacian can be given as ollows: = [ ( x + 1, y) + ( x 1, y) We can easily build a ilter based on this + ( x, y + 1) + ( x, y 1)] 4 ( x, y)
26 The Laplacian Applying the Laplacian to an image we get a new image that highlights edges and other discontinuities Original Image Laplacian Filtered Image Laplacian Filtered Image Scaled or Display
27 But That Is Not Very Enhanced! The result o a Laplacian iltering is not an enhanced image We have to do more work in order to get our inal image Subtract the Laplacian result rom the original image to generate our inal sharpened enhanced image Laplacian Filtered Image Scaled or Display g( x, y) = ( x, y)
28 Laplacian Image Enhancement - = Original Image Laplacian Filtered Image Sharpened Image In the inal sharpened image edges and ine detail are much more obvious
29 Laplacian Image Enhancement
30 Simpliied Image Enhancement The entire enhancement can be combined into a single iltering operation ) 1, ( ) 1, ( [ ), ( y x y x y x + + = 1), ( 1), ( y x y x )], ( 4 y x y x y x g ), ( ), ( = ) 1, ( ) 1, ( ), ( 5 y x y x y x + = 1), ( 1), ( + y x y x
31 Simpliied Image Enhancement This gives us a new ilter which does the whole job or us in one step
32 Simpliied Image Enhancement
33 Variants On The Simple Laplacian There are lots o slightly dierent versions o the Laplacian that can be used: Simple Laplacian Variant o Laplacian
34 1 st Derivative Filtering Implementing 1 st derivative ilters is diicult in practice For a unction (x, y) the gradient o at coordinates (x, y) is given as the column vector: = G G x y = x y
35 1 st Derivative Filtering The magnitude o this vector is given by: For practical reasons this can be simpliied as: ( ) = mag [ ] 1 x G y G + = 1 + = y x G x G y +
36 1 st Derivative Filtering There is some debate as to how best to calculate these gradients but we will use: ( z + z + z ) ( z + z z ) ( z + z + z ) ( z + z + z ) which is based on these coordinates z 1 z z 3 z 4 z 5 z 6 z 7 z 8 z 9
37 Sobel Operators Based on the previous equations we can derive the Sobel Operators To ilter an image it is iltered using both operators the results o which are added together
38 Sobel Example Sobel ilters are typically used or edge detection An image o a contact lens which is enhanced in order to make deects (at our and ive o clock in the image) more obvious
39 1st Derivative Filtering Chapter 3: Image Enhancement (Spatial Filtering) We may use the approximation : This can implemented using the masks: As ollows: Alternatively, we may use the approximation: This can implemented using the masks: As ollows:
40 Roberts cross-gradient operator Chapter 3: Image Enhancement (Spatial Filtering) The resulting masks are called Roberts cross-gradient operators. The Roberts operators and the Prewitt/Sobel operators (described later) are used or edge detection and are sometimes called edge detectors. Example: Roberts cross-gradient operator :
41 Prewitt operators Chapter 3: Image Enhancement (Spatial Filtering) Better approximations to the gradient can be obtained by: This can be implemented using the masks: as ollows: The resulting masks are called Prewitt operators.
42 Chapter Prewitt 3: Image operators Enhancement (Spatial Filtering)
43 1 st & nd Derivatives Comparing the 1 st and nd derivatives we can conclude the ollowing: 1 st order derivatives generally produce thicker edges nd order derivatives have a stronger response to ine detail e.g. thin lines 1 st order derivatives have stronger response to grey level step nd order derivatives produce a double response at step changes in grey level
44 Spatial Filtering- High-boost iltering This is a ilter whose output g is produced by subtracting a lowpass (blurred) version o rom an ampliied version o : This is also reerred to as unsharp masking. Observe that : For A >1, part o the original image is added back to the highpass iltered version o. The result is the original image with the edges enhanced relative to the original image.
45 Spatial Filtering- High-boost iltering
46 Chapter Spatial3: Filtering- Image Enhancement High-Boost (Spatial Filtering Filtering)
47 Chapter Spatial3: Filtering- Image Enhancement Derivative(Spatial ilter Filtering)
48 Combining Spatial Enhancement Methods Successul image enhancement is typically not achieved using a single operation Rather we combine a range o techniques in order to achieve a inal result This example will ocus on enhancing the bone scan to the right
49 Combining Spatial Enhancement Methods (a) Laplacian ilter o bone scan (a) (b) Sharpened version o bone scan achieved (c) by subtracting (a) and (b) Sobel ilter o bone scan (a) (d)
50 Combining Spatial Enhancement Methods The product o (c) and (e) which will be used as a mask (e) Sharpened image which is sum o (a) and () () Result o applying a power-law trans. to (g) (g) (h) Image (d) smoothed with a 5*5 averaging ilter
51 Combining Spatial Enhancement Methods Compare the original and inal images
Image 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 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 informationLecture Outline. Basics of Spatial Filtering Smoothing Spatial Filters. Sharpening Spatial Filters
1 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
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 informationDigital Image Processing: Sharpening Filtering in Spatial Domain CSC Biomedical Imaging and Analysis Dr. Kazunori Okada
Homework Exercise Start project coding work according to the project plan Adjust project plans according to my comments (reply ilearn threads) New Exercise: Install VTK & FLTK. Find a simple hello world
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 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 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 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 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 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 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 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 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 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 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 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 informationDigital Image Processing. Chapter 4: Image Enhancement in the Frequency Domain
Digital Image Processing Chapter 4: Image Enhancement in the Frequency Domain Image Enhancement in Frequency Domain Objective: To understand the Fourier Transform and frequency domain and how to apply
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 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 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 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 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 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 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 informationLaplacian Filters. Sobel Filters. Laplacian Filters. Laplacian Filters. Laplacian Filters. Laplacian Filters
Sobel Filters Note that smoothing the image before applying a Sobel filter typically gives better results. Even thresholding the Sobel filtered image cannot usually create precise, i.e., -pixel wide, edges.
More informationPhysics 5153 Classical Mechanics. Solution by Quadrature-1
October 14, 003 11:47:49 1 Introduction Physics 5153 Classical Mechanics Solution by Quadrature In the previous lectures, we have reduced the number o eective degrees o reedom that are needed to solve
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 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 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 informationNew method for two-point nonuniformity correction of microbolometer detectors
10 th International Conerence on Quantitative InraRed Thermography July 27-30, 2010, Québec (Canada) New method or two-point nonuniormity correction o microbolometer detectors by R. Olbrycht*, B. Wiecek*,
More informationIntroduction to the Discrete Fourier Transform
Introduction to the Discrete ourier Transform Lucas J. van Vliet www.ph.tn.tudelft.nl/~lucas TNW: aculty of Applied Sciences IST: Imaging Science and technology PH: Linear Shift Invariant System A discrete
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 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 informationTLT-5200/5206 COMMUNICATION THEORY, Exercise 3, Fall TLT-5200/5206 COMMUNICATION THEORY, Exercise 3, Fall Problem 1.
TLT-5/56 COMMUNICATION THEORY, Exercise 3, Fall Problem. The "random walk" was modelled as a random sequence [ n] where W[i] are binary i.i.d. random variables with P[W[i] = s] = p (orward step with probability
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 informationExtreme Values of Functions
Extreme Values o Functions When we are using mathematics to model the physical world in which we live, we oten express observed physical quantities in terms o variables. Then, unctions are used to describe
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 informationNumerical Methods - Lecture 2. Numerical Methods. Lecture 2. Analysis of errors in numerical methods
Numerical Methods - Lecture 1 Numerical Methods Lecture. Analysis o errors in numerical methods Numerical Methods - Lecture Why represent numbers in loating point ormat? Eample 1. How a number 56.78 can
More informationEdge Detection. CS 650: Computer Vision
CS 650: Computer Vision Edges and Gradients Edge: local indication of an object transition Edge detection: local operators that find edges (usually involves convolution) Local intensity transitions are
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 informationLecture 13: Applications of Fourier transforms (Recipes, Chapter 13)
Lecture 13: Applications o Fourier transorms (Recipes, Chapter 13 There are many applications o FT, some o which involve the convolution theorem (Recipes 13.1: The convolution o h(t and r(t is deined by
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 informationECE 2100 Lecture notes Wed, 1/22/03
HW #4, due, /24 Ch : 34, 37, 43 ECE 0 Lecture notes Wed, /22/03 Exercises: 2., 2.2, 2.4, 2.5 Stu or hints etc., see lecture notes or, /7 Problem Sessions: W, :50-2:40 am, WBB 22 (tall brick geology building),
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 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 informationDefinition: Let f(x) be a function of one variable with continuous derivatives of all orders at a the point x 0, then the series.
2.4 Local properties o unctions o several variables In this section we will learn how to address three kinds o problems which are o great importance in the ield o applied mathematics: how to obtain the
More information10. Joint Moments and Joint Characteristic Functions
10. Joint Moments and Joint Characteristic Functions Following section 6, in this section we shall introduce various parameters to compactly represent the inormation contained in the joint p.d. o two r.vs.
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 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 informationSignals & Linear Systems Analysis Chapter 2&3, Part II
Signals & Linear Systems Analysis Chapter &3, Part II Dr. Yun Q. Shi Dept o Electrical & Computer Engr. New Jersey Institute o echnology Email: shi@njit.edu et used or the course:
More informationFourier Transforms 1D
Fourier Transforms 1D 3D Image Processing Alireza Ghane 1 Overview Recap Intuitions Function representations shift-invariant spaces linear, time-invariant (LTI) systems complex numbers Fourier Transforms
More informationA Simple Explanation of the Sobolev Gradient Method
A Simple Explanation o the Sobolev Gradient Method R. J. Renka July 3, 2006 Abstract We have observed that the term Sobolev gradient is used more oten than it is understood. Also, the term is oten used
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 informationTreatment and analysis of data Applied statistics Lecture 6: Bayesian estimation
Treatment and analysis o data Applied statistics Lecture 6: Bayesian estimation Topics covered: Bayes' Theorem again Relation to Likelihood Transormation o pd A trivial example Wiener ilter Malmquist bias
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 informationBasics on 2-D 2 D Random Signal
Basics on -D D Random Signal Spring 06 Instructor: K. J. Ray Liu ECE Department, Univ. of Maryland, College Park Overview Last Time: Fourier Analysis for -D signals Image enhancement via spatial filtering
More informationFiltering in Frequency Domain
Dr. Praveen Sankaran Department of ECE NIT Calicut February 4, 2013 Outline 1 2D DFT - Review 2 2D Sampling 2D DFT - Review 2D Impulse Train s [t, z] = m= n= δ [t m T, z n Z] (1) f (t, z) s [t, z] sampled
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 informationSpecial types of Riemann sums
Roberto s Notes on Subject Chapter 4: Deinite integrals and the FTC Section 3 Special types o Riemann sums What you need to know already: What a Riemann sum is. What you can learn here: The key types o
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(C) The rationals and the reals as linearly ordered sets. Contents. 1 The characterizing results
(C) The rationals and the reals as linearly ordered sets We know that both Q and R are something special. When we think about about either o these we usually view it as a ield, or at least some kind o
More informationRoadmap. Introduction to image analysis (computer vision) Theory of edge detection. Applications
Edge Detection Roadmap Introduction to image analysis (computer vision) Its connection with psychology and neuroscience Why is image analysis difficult? Theory of edge detection Gradient operator Advanced
More informationLecture 8 Optimization
4/9/015 Lecture 8 Optimization EE 4386/5301 Computational Methods in EE Spring 015 Optimization 1 Outline Introduction 1D Optimization Parabolic interpolation Golden section search Newton s method Multidimensional
More informationAdditional exercises in Stationary Stochastic Processes
Mathematical Statistics, Centre or Mathematical Sciences Lund University Additional exercises 8 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
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 informationTwo-step self-tuning phase-shifting interferometry
Two-step sel-tuning phase-shiting intererometry J. Vargas, 1,* J. Antonio Quiroga, T. Belenguer, 1 M. Servín, 3 J. C. Estrada 3 1 Laboratorio de Instrumentación Espacial, Instituto Nacional de Técnica
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 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 informationCategories and Natural Transformations
Categories and Natural Transormations Ethan Jerzak 17 August 2007 1 Introduction The motivation or studying Category Theory is to ormalise the underlying similarities between a broad range o mathematical
More informationAsymptotics of integrals
October 3, 4 Asymptotics o integrals Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/complex/notes 4-5/4c basic asymptotics.pd].
More informationMesa College Math SAMPLES
Mesa College Math 6 - SAMPLES Directions: NO CALCULATOR. Write neatly, show your work and steps. Label your work so it s easy to ollow. Answers without appropriate work will receive NO credit. For inal
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 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 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 informationNew Results on Boomerang and Rectangle Attacks
New Results on Boomerang and Rectangle Attacks Eli Biham, 1 Orr Dunkelman, 1 Nathan Keller 2 1 Computer Science Department, Technion. Haia 32000, Israel {biham,orrd}@cs.technion.ac.il 2 Mathematics Department,
More informationNotes on Wavelets- Sandra Chapman (MPAGS: Time series analysis) # $ ( ) = G f. y t
Wavelets Recall: we can choose! t ) as basis on which we expand, ie: ) = y t ) = G! t ) y t! may be orthogonal chosen or appropriate properties. This is equivalent to the transorm: ) = G y t )!,t )d 2
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 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 information( ) x y z. 3 Functions 36. SECTION D Composite Functions
3 Functions 36 SECTION D Composite Functions By the end o this section you will be able to understand what is meant by a composite unction ind composition o unctions combine unctions by addition, subtraction,
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 informationCOMP344 Digital Image Processing Fall 2007 Final Examination
COMP344 Digital Image Processing Fall 2007 Final Examination Time allowed: 2 hours Name Student ID Email Question 1 Question 2 Question 3 Question 4 Question 5 Question 6 Total With model answer HK University
More informationRoberto s Notes on Differential Calculus Chapter 8: Graphical analysis Section 1. Extreme points
Roberto s Notes on Dierential Calculus Chapter 8: Graphical analysis Section 1 Extreme points What you need to know already: How to solve basic algebraic and trigonometric equations. All basic techniques
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 informationMSE405 Microstructure Characterization XRD-1 Lab X-ray diffraction in crystallography
X-ray diraction in crystallography I. Goals Crystallography is the science that studies the structure (and structure-derived properties) o crystals. Among its many tools, X-ray diraction (XRD) has had
More informationScattering of Solitons of Modified KdV Equation with Self-consistent Sources
Commun. Theor. Phys. Beijing, China 49 8 pp. 89 84 c Chinese Physical Society Vol. 49, No. 4, April 5, 8 Scattering o Solitons o Modiied KdV Equation with Sel-consistent Sources ZHANG Da-Jun and WU Hua
More informationSystems & Signals 315
1 / 15 Systems & Signals 315 Lecture 13: Signals and Linear Systems Dr. Herman A. Engelbrecht Stellenbosch University Dept. E & E Engineering 2 Maart 2009 Outline 2 / 15 1 Signal Transmission through a
More informationAnalysis Scheme in the Ensemble Kalman Filter
JUNE 1998 BURGERS ET AL. 1719 Analysis Scheme in the Ensemble Kalman Filter GERRIT BURGERS Royal Netherlands Meteorological Institute, De Bilt, the Netherlands PETER JAN VAN LEEUWEN Institute or Marine
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 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 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 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 informationNumerical Solution of Ordinary Differential Equations in Fluctuationlessness Theorem Perspective
Numerical Solution o Ordinary Dierential Equations in Fluctuationlessness Theorem Perspective NEJLA ALTAY Bahçeşehir University Faculty o Arts and Sciences Beşiktaş, İstanbul TÜRKİYE TURKEY METİN DEMİRALP
More informationRelating axial motion of optical elements to focal shift
Relating aial motion o optical elements to ocal shit Katie Schwertz and J. H. Burge College o Optical Sciences, University o Arizona, Tucson AZ 857, USA katie.schwertz@gmail.com ABSTRACT In this paper,
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 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 informationMEASUREMENT UNCERTAINTIES
MEASUREMENT UNCERTAINTIES What distinguishes science rom philosophy is that it is grounded in experimental observations. These observations are most striking when they take the orm o a quantitative measurement.
More informationLab 3: The FFT and Digital Filtering. Slides prepared by: Chun-Te (Randy) Chu
Lab 3: The FFT and Digital Filtering Slides prepared by: Chun-Te (Randy) Chu Lab 3: The FFT and Digital Filtering Assignment 1 Assignment 2 Assignment 3 Assignment 4 Assignment 5 What you will learn in
More information